./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-01-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/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 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a --- 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 10:16:44,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 10:16:44,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 10:16:44,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 10:16:44,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 10:16:44,525 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 10:16:44,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 10:16:44,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 10:16:44,529 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 10:16:44,530 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 10:16:44,531 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 10:16:44,532 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 10:16:44,533 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 10:16:44,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 10:16:44,535 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 10:16:44,536 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 10:16:44,537 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 10:16:44,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 10:16:44,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 10:16:44,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 10:16:44,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 10:16:44,544 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 10:16:44,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 10:16:44,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 10:16:44,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 10:16:44,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 10:16:44,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 10:16:44,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 10:16:44,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 10:16:44,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 10:16:44,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 10:16:44,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 10:16:44,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 10:16:44,556 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 10:16:44,556 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 10:16:44,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 10:16:44,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 10:16:44,557 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 10:16:44,557 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 10:16:44,558 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 10:16:44,559 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 10:16:44,559 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 10:16:44,580 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 10:16:44,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 10:16:44,580 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 10:16:44,580 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 10:16:44,581 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 10:16:44,581 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 10:16:44,581 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 10:16:44,582 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 10:16:44,582 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 10:16:44,582 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 10:16:44,582 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 10:16:44,582 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 10:16:44,582 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 10:16:44,583 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 10:16:44,583 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 10:16:44,583 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 10:16:44,583 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 10:16:44,583 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 10:16:44,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 10:16:44,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 10:16:44,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 10:16:44,584 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 10:16:44,585 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 10:16:44,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 10:16:44,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 10:16:44,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 10:16:44,585 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 10:16:44,585 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 10:16:44,586 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 10:16:44,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 10:16:44,586 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 10:16:44,586 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 10:16:44,586 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 10:16:44,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 10:16:44,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 10:16:44,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 10:16:44,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 10:16:44,587 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 10:16:44,587 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 10:16:44,587 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 10:16:44,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 10:16:44,587 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 10:16:44,587 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/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 -> 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a [2022-12-14 10:16:44,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 10:16:44,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 10:16:44,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 10:16:44,802 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 10:16:44,802 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 10:16:44,804 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/forester-heap/sll-01-2.i [2022-12-14 10:16:47,501 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 10:16:47,659 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 10:16:47,659 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i [2022-12-14 10:16:47,672 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/data/fc06bc4bd/4fd44b833e25429986b043d75502bb67/FLAGb5072ac52 [2022-12-14 10:16:47,682 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/data/fc06bc4bd/4fd44b833e25429986b043d75502bb67 [2022-12-14 10:16:47,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 10:16:47,685 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 10:16:47,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 10:16:47,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 10:16:47,689 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 10:16:47,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:16:47" (1/1) ... [2022-12-14 10:16:47,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bfcd9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:16:47, skipping insertion in model container [2022-12-14 10:16:47,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:16:47" (1/1) ... [2022-12-14 10:16:47,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 10:16:47,721 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 10:16:47,889 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2022-12-14 10:16:47,894 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2022-12-14 10:16:47,895 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2022-12-14 10:16:47,896 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2022-12-14 10:16:47,898 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2022-12-14 10:16:47,899 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2022-12-14 10:16:47,900 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2022-12-14 10:16:47,901 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2022-12-14 10:16:47,901 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2022-12-14 10:16:47,902 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2022-12-14 10:16:47,903 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2022-12-14 10:16:47,904 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2022-12-14 10:16:47,905 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2022-12-14 10:16:47,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 10:16:47,915 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 10:16:47,935 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2022-12-14 10:16:47,937 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2022-12-14 10:16:47,938 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2022-12-14 10:16:47,938 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2022-12-14 10:16:47,940 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2022-12-14 10:16:47,941 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2022-12-14 10:16:47,942 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2022-12-14 10:16:47,943 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2022-12-14 10:16:47,944 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2022-12-14 10:16:47,944 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2022-12-14 10:16:47,945 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2022-12-14 10:16:47,946 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2022-12-14 10:16:47,947 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_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2022-12-14 10:16:47,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 10:16:47,963 INFO L208 MainTranslator]: Completed translation [2022-12-14 10:16:47,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:16:47 WrapperNode [2022-12-14 10:16:47,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 10:16:47,964 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 10:16:47,964 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 10:16:47,965 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 10:16:47,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:16:47" (1/1) ... [2022-12-14 10:16:47,979 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:16:47" (1/1) ... [2022-12-14 10:16:47,997 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 231 [2022-12-14 10:16:47,997 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 10:16:47,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 10:16:47,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 10:16:47,998 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 10:16:48,005 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:16:47" (1/1) ... [2022-12-14 10:16:48,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:16:47" (1/1) ... [2022-12-14 10:16:48,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:16:47" (1/1) ... [2022-12-14 10:16:48,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:16:47" (1/1) ... [2022-12-14 10:16:48,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:16:47" (1/1) ... [2022-12-14 10:16:48,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:16:47" (1/1) ... [2022-12-14 10:16:48,021 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:16:47" (1/1) ... [2022-12-14 10:16:48,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:16:47" (1/1) ... [2022-12-14 10:16:48,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 10:16:48,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 10:16:48,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 10:16:48,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 10:16:48,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:16:47" (1/1) ... [2022-12-14 10:16:48,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 10:16:48,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:16:48,049 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 10:16:48,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 10:16:48,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 10:16:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 10:16:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 10:16:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 10:16:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 10:16:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 10:16:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 10:16:48,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 10:16:48,182 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 10:16:48,184 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 10:16:48,576 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 10:16:48,614 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 10:16:48,614 INFO L300 CfgBuilder]: Removed 30 assume(true) statements. [2022-12-14 10:16:48,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:16:48 BoogieIcfgContainer [2022-12-14 10:16:48,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 10:16:48,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 10:16:48,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 10:16:48,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 10:16:48,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 10:16:47" (1/3) ... [2022-12-14 10:16:48,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51060dbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:16:48, skipping insertion in model container [2022-12-14 10:16:48,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:16:47" (2/3) ... [2022-12-14 10:16:48,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51060dbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:16:48, skipping insertion in model container [2022-12-14 10:16:48,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:16:48" (3/3) ... [2022-12-14 10:16:48,623 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2022-12-14 10:16:48,638 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 10:16:48,638 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2022-12-14 10:16:48,673 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 10:16:48,678 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;@5928c18b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 10:16:48,678 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-12-14 10:16:48,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 173 states, 92 states have (on average 2.4130434782608696) internal successors, (222), 172 states have internal predecessors, (222), 0 states have call successors, (0), 0 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 10:16:48,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 10:16:48,687 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:16:48,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 10:16:48,688 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:16:48,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:16:48,692 INFO L85 PathProgramCache]: Analyzing trace with hash 15039, now seen corresponding path program 1 times [2022-12-14 10:16:48,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:16:48,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980066609] [2022-12-14 10:16:48,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:48,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:16:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:48,836 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 10:16:48,836 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:16:48,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980066609] [2022-12-14 10:16:48,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980066609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:16:48,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:16:48,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 10:16:48,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361147897] [2022-12-14 10:16:48,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:16:48,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:16:48,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:16:48,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:16:48,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:16:48,866 INFO L87 Difference]: Start difference. First operand has 173 states, 92 states have (on average 2.4130434782608696) internal successors, (222), 172 states have internal predecessors, (222), 0 states have call successors, (0), 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 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 10:16:49,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:16:49,016 INFO L93 Difference]: Finished difference Result 173 states and 182 transitions. [2022-12-14 10:16:49,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:16:49,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-12-14 10:16:49,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:16:49,027 INFO L225 Difference]: With dead ends: 173 [2022-12-14 10:16:49,027 INFO L226 Difference]: Without dead ends: 171 [2022-12-14 10:16:49,028 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 10:16:49,032 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 166 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:16:49,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 94 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:16:49,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-12-14 10:16:49,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2022-12-14 10:16:49,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 95 states have (on average 1.8842105263157896) internal successors, (179), 166 states have internal predecessors, (179), 0 states have call successors, (0), 0 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 10:16:49,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 179 transitions. [2022-12-14 10:16:49,070 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 179 transitions. Word has length 2 [2022-12-14 10:16:49,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:16:49,071 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 179 transitions. [2022-12-14 10:16:49,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 10:16:49,071 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 179 transitions. [2022-12-14 10:16:49,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 10:16:49,071 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:16:49,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 10:16:49,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 10:16:49,072 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:16:49,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:16:49,072 INFO L85 PathProgramCache]: Analyzing trace with hash 15040, now seen corresponding path program 1 times [2022-12-14 10:16:49,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:16:49,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489624889] [2022-12-14 10:16:49,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:49,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:16:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:49,146 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 10:16:49,146 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:16:49,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489624889] [2022-12-14 10:16:49,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489624889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:16:49,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:16:49,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 10:16:49,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483724340] [2022-12-14 10:16:49,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:16:49,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:16:49,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:16:49,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:16:49,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:16:49,150 INFO L87 Difference]: Start difference. First operand 167 states and 179 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 10:16:49,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:16:49,259 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2022-12-14 10:16:49,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:16:49,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-12-14 10:16:49,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:16:49,261 INFO L225 Difference]: With dead ends: 194 [2022-12-14 10:16:49,261 INFO L226 Difference]: Without dead ends: 194 [2022-12-14 10:16:49,262 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 10:16:49,263 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 157 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 120 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 10:16:49,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 120 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:16:49,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-12-14 10:16:49,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 175. [2022-12-14 10:16:49,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 110 states have (on average 1.8) internal successors, (198), 174 states have internal predecessors, (198), 0 states have call successors, (0), 0 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 10:16:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 198 transitions. [2022-12-14 10:16:49,273 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 198 transitions. Word has length 2 [2022-12-14 10:16:49,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:16:49,274 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 198 transitions. [2022-12-14 10:16:49,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 10:16:49,274 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 198 transitions. [2022-12-14 10:16:49,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 10:16:49,274 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:16:49,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 10:16:49,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 10:16:49,275 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:16:49,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:16:49,275 INFO L85 PathProgramCache]: Analyzing trace with hash 14451871, now seen corresponding path program 1 times [2022-12-14 10:16:49,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:16:49,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446904545] [2022-12-14 10:16:49,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:49,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:16:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:49,300 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 10:16:49,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:16:49,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446904545] [2022-12-14 10:16:49,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446904545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:16:49,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:16:49,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:16:49,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423130655] [2022-12-14 10:16:49,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:16:49,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:16:49,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:16:49,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:16:49,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:16:49,302 INFO L87 Difference]: Start difference. First operand 175 states and 198 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) 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 10:16:49,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:16:49,363 INFO L93 Difference]: Finished difference Result 190 states and 201 transitions. [2022-12-14 10:16:49,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:16:49,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) 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 10:16:49,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:16:49,365 INFO L225 Difference]: With dead ends: 190 [2022-12-14 10:16:49,365 INFO L226 Difference]: Without dead ends: 190 [2022-12-14 10:16:49,365 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 10:16:49,366 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 155 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:16:49,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 158 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:16:49,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-12-14 10:16:49,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 173. [2022-12-14 10:16:49,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 109 states have (on average 1.7889908256880733) internal successors, (195), 172 states have internal predecessors, (195), 0 states have call successors, (0), 0 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 10:16:49,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 195 transitions. [2022-12-14 10:16:49,376 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 195 transitions. Word has length 4 [2022-12-14 10:16:49,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:16:49,377 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 195 transitions. [2022-12-14 10:16:49,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) 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 10:16:49,377 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 195 transitions. [2022-12-14 10:16:49,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 10:16:49,377 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:16:49,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:16:49,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 10:16:49,378 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:16:49,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:16:49,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1486544837, now seen corresponding path program 1 times [2022-12-14 10:16:49,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:16:49,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642875989] [2022-12-14 10:16:49,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:49,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:16:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:49,519 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 10:16:49,520 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:16:49,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642875989] [2022-12-14 10:16:49,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642875989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:16:49,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:16:49,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 10:16:49,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980944415] [2022-12-14 10:16:49,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:16:49,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:16:49,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:16:49,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:16:49,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:16:49,522 INFO L87 Difference]: Start difference. First operand 173 states and 195 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 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 10:16:49,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:16:49,660 INFO L93 Difference]: Finished difference Result 172 states and 194 transitions. [2022-12-14 10:16:49,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:16:49,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-12-14 10:16:49,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:16:49,661 INFO L225 Difference]: With dead ends: 172 [2022-12-14 10:16:49,661 INFO L226 Difference]: Without dead ends: 172 [2022-12-14 10:16:49,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:16:49,662 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 3 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:16:49,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 422 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:16:49,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-12-14 10:16:49,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2022-12-14 10:16:49,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 109 states have (on average 1.7798165137614679) internal successors, (194), 171 states have internal predecessors, (194), 0 states have call successors, (0), 0 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 10:16:49,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 194 transitions. [2022-12-14 10:16:49,668 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 194 transitions. Word has length 9 [2022-12-14 10:16:49,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:16:49,668 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 194 transitions. [2022-12-14 10:16:49,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 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 10:16:49,668 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 194 transitions. [2022-12-14 10:16:49,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 10:16:49,669 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:16:49,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:16:49,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 10:16:49,669 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:16:49,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:16:49,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1486544838, now seen corresponding path program 1 times [2022-12-14 10:16:49,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:16:49,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034701418] [2022-12-14 10:16:49,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:49,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:16:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:49,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:16:49,825 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:16:49,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034701418] [2022-12-14 10:16:49,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034701418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:16:49,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:16:49,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 10:16:49,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673366416] [2022-12-14 10:16:49,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:16:49,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:16:49,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:16:49,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:16:49,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:16:49,827 INFO L87 Difference]: Start difference. First operand 172 states and 194 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 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 10:16:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:16:49,969 INFO L93 Difference]: Finished difference Result 171 states and 193 transitions. [2022-12-14 10:16:49,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:16:49,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-12-14 10:16:49,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:16:49,970 INFO L225 Difference]: With dead ends: 171 [2022-12-14 10:16:49,970 INFO L226 Difference]: Without dead ends: 171 [2022-12-14 10:16:49,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:16:49,971 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:16:49,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 433 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:16:49,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-12-14 10:16:49,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-12-14 10:16:49,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 109 states have (on average 1.7706422018348624) internal successors, (193), 170 states have internal predecessors, (193), 0 states have call successors, (0), 0 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 10:16:49,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 193 transitions. [2022-12-14 10:16:49,975 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 193 transitions. Word has length 9 [2022-12-14 10:16:49,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:16:49,976 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 193 transitions. [2022-12-14 10:16:49,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 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 10:16:49,976 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 193 transitions. [2022-12-14 10:16:49,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 10:16:49,976 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:16:49,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:16:49,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 10:16:49,977 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:16:49,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:16:49,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1654127711, now seen corresponding path program 1 times [2022-12-14 10:16:49,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:16:49,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907498147] [2022-12-14 10:16:49,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:49,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:16:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:50,130 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 10:16:50,131 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:16:50,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907498147] [2022-12-14 10:16:50,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907498147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:16:50,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:16:50,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 10:16:50,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878992644] [2022-12-14 10:16:50,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:16:50,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 10:16:50,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:16:50,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 10:16:50,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 10:16:50,133 INFO L87 Difference]: Start difference. First operand 171 states and 193 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 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 10:16:50,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:16:50,384 INFO L93 Difference]: Finished difference Result 171 states and 192 transitions. [2022-12-14 10:16:50,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 10:16:50,385 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-12-14 10:16:50,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:16:50,386 INFO L225 Difference]: With dead ends: 171 [2022-12-14 10:16:50,386 INFO L226 Difference]: Without dead ends: 171 [2022-12-14 10:16:50,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-12-14 10:16:50,387 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 150 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:16:50,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 533 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:16:50,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-12-14 10:16:50,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2022-12-14 10:16:50,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 109 states have (on average 1.761467889908257) internal successors, (192), 169 states have internal predecessors, (192), 0 states have call successors, (0), 0 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 10:16:50,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 192 transitions. [2022-12-14 10:16:50,391 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 192 transitions. Word has length 11 [2022-12-14 10:16:50,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:16:50,391 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 192 transitions. [2022-12-14 10:16:50,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 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 10:16:50,392 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 192 transitions. [2022-12-14 10:16:50,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 10:16:50,392 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:16:50,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:16:50,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 10:16:50,392 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:16:50,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:16:50,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1654127710, now seen corresponding path program 1 times [2022-12-14 10:16:50,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:16:50,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207261517] [2022-12-14 10:16:50,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:50,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:16:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:50,559 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 10:16:50,559 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:16:50,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207261517] [2022-12-14 10:16:50,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207261517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:16:50,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:16:50,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 10:16:50,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436967849] [2022-12-14 10:16:50,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:16:50,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 10:16:50,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:16:50,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 10:16:50,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 10:16:50,561 INFO L87 Difference]: Start difference. First operand 170 states and 192 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 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 10:16:50,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:16:50,894 INFO L93 Difference]: Finished difference Result 170 states and 191 transitions. [2022-12-14 10:16:50,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 10:16:50,894 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-12-14 10:16:50,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:16:50,895 INFO L225 Difference]: With dead ends: 170 [2022-12-14 10:16:50,895 INFO L226 Difference]: Without dead ends: 170 [2022-12-14 10:16:50,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-12-14 10:16:50,896 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 147 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:16:50,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 444 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 10:16:50,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-12-14 10:16:50,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2022-12-14 10:16:50,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 109 states have (on average 1.7522935779816513) internal successors, (191), 168 states have internal predecessors, (191), 0 states have call successors, (0), 0 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 10:16:50,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 191 transitions. [2022-12-14 10:16:50,899 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 191 transitions. Word has length 11 [2022-12-14 10:16:50,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:16:50,899 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 191 transitions. [2022-12-14 10:16:50,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 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 10:16:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 191 transitions. [2022-12-14 10:16:50,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 10:16:50,900 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:16:50,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:16:50,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 10:16:50,901 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:16:50,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:16:50,901 INFO L85 PathProgramCache]: Analyzing trace with hash 2111646544, now seen corresponding path program 1 times [2022-12-14 10:16:50,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:16:50,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301928267] [2022-12-14 10:16:50,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:50,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:16:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:50,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:16:50,920 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:16:50,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301928267] [2022-12-14 10:16:50,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301928267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:16:50,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:16:50,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:16:50,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995862892] [2022-12-14 10:16:50,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:16:50,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:16:50,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:16:50,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:16:50,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:16:50,922 INFO L87 Difference]: Start difference. First operand 169 states and 191 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 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 10:16:50,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:16:50,957 INFO L93 Difference]: Finished difference Result 170 states and 192 transitions. [2022-12-14 10:16:50,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:16:50,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-12-14 10:16:50,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:16:50,958 INFO L225 Difference]: With dead ends: 170 [2022-12-14 10:16:50,958 INFO L226 Difference]: Without dead ends: 170 [2022-12-14 10:16:50,958 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 10:16:50,959 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:16:50,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 269 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:16:50,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-12-14 10:16:50,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-12-14 10:16:50,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 110 states have (on average 1.7454545454545454) internal successors, (192), 169 states have internal predecessors, (192), 0 states have call successors, (0), 0 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 10:16:50,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 192 transitions. [2022-12-14 10:16:50,963 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 192 transitions. Word has length 11 [2022-12-14 10:16:50,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:16:50,964 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 192 transitions. [2022-12-14 10:16:50,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 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 10:16:50,964 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 192 transitions. [2022-12-14 10:16:50,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 10:16:50,964 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:16:50,965 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:16:50,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 10:16:50,965 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:16:50,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:16:50,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1036968797, now seen corresponding path program 1 times [2022-12-14 10:16:50,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:16:50,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016398843] [2022-12-14 10:16:50,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:50,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:16:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:51,024 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 10:16:51,024 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:16:51,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016398843] [2022-12-14 10:16:51,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016398843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:16:51,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:16:51,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 10:16:51,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631136663] [2022-12-14 10:16:51,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:16:51,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:16:51,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:16:51,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:16:51,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:16:51,025 INFO L87 Difference]: Start difference. First operand 170 states and 192 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 10:16:51,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:16:51,147 INFO L93 Difference]: Finished difference Result 254 states and 282 transitions. [2022-12-14 10:16:51,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 10:16:51,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-12-14 10:16:51,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:16:51,149 INFO L225 Difference]: With dead ends: 254 [2022-12-14 10:16:51,149 INFO L226 Difference]: Without dead ends: 254 [2022-12-14 10:16:51,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:16:51,149 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 89 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:16:51,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 456 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:16:51,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-12-14 10:16:51,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 167. [2022-12-14 10:16:51,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 108 states have (on average 1.75) internal successors, (189), 166 states have internal predecessors, (189), 0 states have call successors, (0), 0 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 10:16:51,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 189 transitions. [2022-12-14 10:16:51,154 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 189 transitions. Word has length 12 [2022-12-14 10:16:51,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:16:51,154 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 189 transitions. [2022-12-14 10:16:51,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 10:16:51,155 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 189 transitions. [2022-12-14 10:16:51,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 10:16:51,155 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:16:51,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:16:51,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 10:16:51,155 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:16:51,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:16:51,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1324082405, now seen corresponding path program 1 times [2022-12-14 10:16:51,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:16:51,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866727263] [2022-12-14 10:16:51,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:51,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:16:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:51,234 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 10:16:51,234 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:16:51,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866727263] [2022-12-14 10:16:51,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866727263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:16:51,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:16:51,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 10:16:51,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132740899] [2022-12-14 10:16:51,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:16:51,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:16:51,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:16:51,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:16:51,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 10:16:51,236 INFO L87 Difference]: Start difference. First operand 167 states and 189 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 10:16:51,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:16:51,329 INFO L93 Difference]: Finished difference Result 254 states and 281 transitions. [2022-12-14 10:16:51,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:16:51,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 10:16:51,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:16:51,330 INFO L225 Difference]: With dead ends: 254 [2022-12-14 10:16:51,330 INFO L226 Difference]: Without dead ends: 254 [2022-12-14 10:16:51,330 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 10:16:51,331 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 90 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:16:51,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 352 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:16:51,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-12-14 10:16:51,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 169. [2022-12-14 10:16:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 110 states have (on average 1.7363636363636363) internal successors, (191), 168 states have internal predecessors, (191), 0 states have call successors, (0), 0 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 10:16:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 191 transitions. [2022-12-14 10:16:51,336 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 191 transitions. Word has length 15 [2022-12-14 10:16:51,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:16:51,336 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 191 transitions. [2022-12-14 10:16:51,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 10:16:51,336 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 191 transitions. [2022-12-14 10:16:51,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 10:16:51,337 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:16:51,337 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:16:51,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 10:16:51,337 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:16:51,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:16:51,338 INFO L85 PathProgramCache]: Analyzing trace with hash 841024680, now seen corresponding path program 1 times [2022-12-14 10:16:51,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:16:51,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786000377] [2022-12-14 10:16:51,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:51,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:16:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:51,464 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 10:16:51,465 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:16:51,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786000377] [2022-12-14 10:16:51,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786000377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:16:51,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:16:51,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 10:16:51,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904067659] [2022-12-14 10:16:51,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:16:51,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 10:16:51,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:16:51,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 10:16:51,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:16:51,466 INFO L87 Difference]: Start difference. First operand 169 states and 191 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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 10:16:51,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:16:51,694 INFO L93 Difference]: Finished difference Result 226 states and 241 transitions. [2022-12-14 10:16:51,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:16:51,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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 10:16:51,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:16:51,695 INFO L225 Difference]: With dead ends: 226 [2022-12-14 10:16:51,695 INFO L226 Difference]: Without dead ends: 226 [2022-12-14 10:16:51,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:16:51,696 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 399 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:16:51,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 193 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:16:51,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-12-14 10:16:51,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 190. [2022-12-14 10:16:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 131 states have (on average 1.7404580152671756) internal successors, (228), 189 states have internal predecessors, (228), 0 states have call successors, (0), 0 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 10:16:51,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 228 transitions. [2022-12-14 10:16:51,701 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 228 transitions. Word has length 16 [2022-12-14 10:16:51,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:16:51,701 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 228 transitions. [2022-12-14 10:16:51,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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 10:16:51,701 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 228 transitions. [2022-12-14 10:16:51,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 10:16:51,702 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:16:51,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:16:51,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 10:16:51,702 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:16:51,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:16:51,702 INFO L85 PathProgramCache]: Analyzing trace with hash 770914773, now seen corresponding path program 1 times [2022-12-14 10:16:51,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:16:51,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285107284] [2022-12-14 10:16:51,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:51,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:16:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:51,732 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 10:16:51,732 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:16:51,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285107284] [2022-12-14 10:16:51,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285107284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:16:51,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:16:51,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:16:51,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314871927] [2022-12-14 10:16:51,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:16:51,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:16:51,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:16:51,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:16:51,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 10:16:51,733 INFO L87 Difference]: Start difference. First operand 190 states and 228 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 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 10:16:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:16:51,820 INFO L93 Difference]: Finished difference Result 222 states and 236 transitions. [2022-12-14 10:16:51,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:16:51,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-12-14 10:16:51,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:16:51,821 INFO L225 Difference]: With dead ends: 222 [2022-12-14 10:16:51,821 INFO L226 Difference]: Without dead ends: 222 [2022-12-14 10:16:51,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 10:16:51,822 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 213 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:16:51,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 222 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:16:51,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-12-14 10:16:51,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 188. [2022-12-14 10:16:51,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 130 states have (on average 1.7307692307692308) internal successors, (225), 187 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:16:51,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 225 transitions. [2022-12-14 10:16:51,827 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 225 transitions. Word has length 18 [2022-12-14 10:16:51,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:16:51,827 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 225 transitions. [2022-12-14 10:16:51,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 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 10:16:51,827 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 225 transitions. [2022-12-14 10:16:51,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 10:16:51,828 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:16:51,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:16:51,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 10:16:51,828 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:16:51,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:16:51,828 INFO L85 PathProgramCache]: Analyzing trace with hash 771222869, now seen corresponding path program 1 times [2022-12-14 10:16:51,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:16:51,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547144533] [2022-12-14 10:16:51,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:51,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:16:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:51,888 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 10:16:51,888 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:16:51,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547144533] [2022-12-14 10:16:51,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547144533] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:16:51,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:16:51,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 10:16:51,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356845159] [2022-12-14 10:16:51,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:16:51,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:16:51,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:16:51,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:16:51,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:16:51,890 INFO L87 Difference]: Start difference. First operand 188 states and 225 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 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 10:16:52,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:16:52,031 INFO L93 Difference]: Finished difference Result 177 states and 212 transitions. [2022-12-14 10:16:52,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 10:16:52,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-12-14 10:16:52,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:16:52,032 INFO L225 Difference]: With dead ends: 177 [2022-12-14 10:16:52,032 INFO L226 Difference]: Without dead ends: 177 [2022-12-14 10:16:52,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:16:52,033 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 89 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:16:52,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 257 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:16:52,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-12-14 10:16:52,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2022-12-14 10:16:52,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 130 states have (on average 1.623076923076923) internal successors, (211), 175 states have internal predecessors, (211), 0 states have call successors, (0), 0 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 10:16:52,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 211 transitions. [2022-12-14 10:16:52,037 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 211 transitions. Word has length 18 [2022-12-14 10:16:52,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:16:52,037 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 211 transitions. [2022-12-14 10:16:52,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 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 10:16:52,038 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 211 transitions. [2022-12-14 10:16:52,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 10:16:52,038 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:16:52,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:16:52,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 10:16:52,038 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:16:52,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:16:52,039 INFO L85 PathProgramCache]: Analyzing trace with hash 771222870, now seen corresponding path program 1 times [2022-12-14 10:16:52,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:16:52,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709530457] [2022-12-14 10:16:52,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:52,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:16:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:52,162 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 10:16:52,162 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:16:52,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709530457] [2022-12-14 10:16:52,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709530457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:16:52,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:16:52,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 10:16:52,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638839715] [2022-12-14 10:16:52,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:16:52,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:16:52,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:16:52,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:16:52,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:16:52,164 INFO L87 Difference]: Start difference. First operand 176 states and 211 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 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 10:16:52,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:16:52,307 INFO L93 Difference]: Finished difference Result 168 states and 203 transitions. [2022-12-14 10:16:52,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 10:16:52,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-12-14 10:16:52,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:16:52,308 INFO L225 Difference]: With dead ends: 168 [2022-12-14 10:16:52,308 INFO L226 Difference]: Without dead ends: 168 [2022-12-14 10:16:52,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:16:52,309 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 32 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:16:52,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 306 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:16:52,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-12-14 10:16:52,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 163. [2022-12-14 10:16:52,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 126 states have (on average 1.5634920634920635) internal successors, (197), 162 states have internal predecessors, (197), 0 states have call successors, (0), 0 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 10:16:52,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 197 transitions. [2022-12-14 10:16:52,313 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 197 transitions. Word has length 18 [2022-12-14 10:16:52,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:16:52,313 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 197 transitions. [2022-12-14 10:16:52,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 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 10:16:52,314 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 197 transitions. [2022-12-14 10:16:52,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 10:16:52,314 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:16:52,314 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] [2022-12-14 10:16:52,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 10:16:52,315 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:16:52,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:16:52,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1884162539, now seen corresponding path program 1 times [2022-12-14 10:16:52,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:16:52,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165778397] [2022-12-14 10:16:52,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:52,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:16:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:52,366 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 10:16:52,367 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:16:52,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165778397] [2022-12-14 10:16:52,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165778397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:16:52,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:16:52,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 10:16:52,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76791075] [2022-12-14 10:16:52,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:16:52,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:16:52,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:16:52,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:16:52,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:16:52,368 INFO L87 Difference]: Start difference. First operand 163 states and 197 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 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 10:16:52,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:16:52,466 INFO L93 Difference]: Finished difference Result 164 states and 199 transitions. [2022-12-14 10:16:52,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 10:16:52,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-12-14 10:16:52,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:16:52,467 INFO L225 Difference]: With dead ends: 164 [2022-12-14 10:16:52,467 INFO L226 Difference]: Without dead ends: 164 [2022-12-14 10:16:52,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:16:52,468 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 29 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:16:52,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 354 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:16:52,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-12-14 10:16:52,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 159. [2022-12-14 10:16:52,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 124 states have (on average 1.5564516129032258) internal successors, (193), 158 states have internal predecessors, (193), 0 states have call successors, (0), 0 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 10:16:52,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 193 transitions. [2022-12-14 10:16:52,472 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 193 transitions. Word has length 20 [2022-12-14 10:16:52,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:16:52,472 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 193 transitions. [2022-12-14 10:16:52,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 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 10:16:52,473 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 193 transitions. [2022-12-14 10:16:52,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 10:16:52,473 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:16:52,473 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] [2022-12-14 10:16:52,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 10:16:52,474 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:16:52,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:16:52,474 INFO L85 PathProgramCache]: Analyzing trace with hash 780865503, now seen corresponding path program 1 times [2022-12-14 10:16:52,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:16:52,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902953567] [2022-12-14 10:16:52,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:52,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:16:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:52,494 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 10:16:52,494 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:16:52,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902953567] [2022-12-14 10:16:52,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902953567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:16:52,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:16:52,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:16:52,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302132714] [2022-12-14 10:16:52,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:16:52,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:16:52,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:16:52,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:16:52,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:16:52,496 INFO L87 Difference]: Start difference. First operand 159 states and 193 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 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 10:16:52,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:16:52,534 INFO L93 Difference]: Finished difference Result 224 states and 273 transitions. [2022-12-14 10:16:52,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:16:52,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-12-14 10:16:52,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:16:52,535 INFO L225 Difference]: With dead ends: 224 [2022-12-14 10:16:52,535 INFO L226 Difference]: Without dead ends: 224 [2022-12-14 10:16:52,536 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 10:16:52,536 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 45 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:16:52,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 209 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:16:52,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-12-14 10:16:52,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 163. [2022-12-14 10:16:52,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 128 states have (on average 1.5546875) internal successors, (199), 162 states have internal predecessors, (199), 0 states have call successors, (0), 0 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 10:16:52,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 199 transitions. [2022-12-14 10:16:52,540 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 199 transitions. Word has length 23 [2022-12-14 10:16:52,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:16:52,540 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 199 transitions. [2022-12-14 10:16:52,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 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 10:16:52,540 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 199 transitions. [2022-12-14 10:16:52,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 10:16:52,541 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:16:52,541 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] [2022-12-14 10:16:52,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 10:16:52,541 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:16:52,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:16:52,542 INFO L85 PathProgramCache]: Analyzing trace with hash 780865057, now seen corresponding path program 1 times [2022-12-14 10:16:52,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:16:52,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371627649] [2022-12-14 10:16:52,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:52,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:16:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:52,564 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 10:16:52,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:16:52,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371627649] [2022-12-14 10:16:52,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371627649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:16:52,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:16:52,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:16:52,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031375587] [2022-12-14 10:16:52,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:16:52,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:16:52,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:16:52,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:16:52,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:16:52,566 INFO L87 Difference]: Start difference. First operand 163 states and 199 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 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 10:16:52,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:16:52,603 INFO L93 Difference]: Finished difference Result 161 states and 196 transitions. [2022-12-14 10:16:52,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:16:52,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-12-14 10:16:52,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:16:52,604 INFO L225 Difference]: With dead ends: 161 [2022-12-14 10:16:52,604 INFO L226 Difference]: Without dead ends: 161 [2022-12-14 10:16:52,604 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 10:16:52,605 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 18 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:16:52,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 183 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:16:52,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-12-14 10:16:52,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-12-14 10:16:52,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 127 states have (on average 1.5433070866141732) internal successors, (196), 160 states have internal predecessors, (196), 0 states have call successors, (0), 0 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 10:16:52,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 196 transitions. [2022-12-14 10:16:52,614 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 196 transitions. Word has length 23 [2022-12-14 10:16:52,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:16:52,615 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 196 transitions. [2022-12-14 10:16:52,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 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 10:16:52,615 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 196 transitions. [2022-12-14 10:16:52,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 10:16:52,615 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:16:52,616 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 10:16:52,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 10:16:52,616 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:16:52,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:16:52,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1562982680, now seen corresponding path program 1 times [2022-12-14 10:16:52,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:16:52,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015691896] [2022-12-14 10:16:52,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:52,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:16:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:52,708 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 10:16:52,709 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:16:52,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015691896] [2022-12-14 10:16:52,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015691896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:16:52,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:16:52,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 10:16:52,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469013857] [2022-12-14 10:16:52,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:16:52,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 10:16:52,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:16:52,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 10:16:52,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:16:52,710 INFO L87 Difference]: Start difference. First operand 161 states and 196 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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 10:16:52,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:16:52,912 INFO L93 Difference]: Finished difference Result 256 states and 299 transitions. [2022-12-14 10:16:52,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 10:16:52,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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 10:16:52,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:16:52,914 INFO L225 Difference]: With dead ends: 256 [2022-12-14 10:16:52,914 INFO L226 Difference]: Without dead ends: 256 [2022-12-14 10:16:52,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-14 10:16:52,914 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 187 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:16:52,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 429 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:16:52,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-12-14 10:16:52,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 172. [2022-12-14 10:16:52,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 138 states have (on average 1.5072463768115942) internal successors, (208), 171 states have internal predecessors, (208), 0 states have call successors, (0), 0 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 10:16:52,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 208 transitions. [2022-12-14 10:16:52,917 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 208 transitions. Word has length 24 [2022-12-14 10:16:52,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:16:52,917 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 208 transitions. [2022-12-14 10:16:52,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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 10:16:52,917 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 208 transitions. [2022-12-14 10:16:52,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 10:16:52,918 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:16:52,918 INFO L195 NwaCegarLoop]: trace histogram [2, 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 10:16:52,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 10:16:52,918 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:16:52,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:16:52,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1225663262, now seen corresponding path program 1 times [2022-12-14 10:16:52,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:16:52,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676115510] [2022-12-14 10:16:52,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:52,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:16:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:53,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:16:53,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:16:53,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676115510] [2022-12-14 10:16:53,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676115510] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:16:53,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134537821] [2022-12-14 10:16:53,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:53,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:16:53,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:16:53,016 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:16:53,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 10:16:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:53,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 10:16:53,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:16:53,124 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 11 treesize of output 7 [2022-12-14 10:16:53,129 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 11 treesize of output 7 [2022-12-14 10:16:53,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:16:53,179 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 21 treesize of output 20 [2022-12-14 10:16:53,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:16:53,187 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 21 treesize of output 20 [2022-12-14 10:16:53,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:16:53,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 10:16:53,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:16:53,311 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:16:53,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 10 [2022-12-14 10:16:53,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:16:53,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:16:53,722 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 10 treesize of output 8 [2022-12-14 10:16:53,726 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 14 treesize of output 12 [2022-12-14 10:16:53,734 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 10 treesize of output 8 [2022-12-14 10:16:53,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:16:53,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:16:53,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134537821] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:16:53,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [531683071] [2022-12-14 10:16:53,761 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2022-12-14 10:16:53,761 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:16:53,764 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:16:53,768 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:16:53,768 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:16:53,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:16:53,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:16:53,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 10:16:53,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:16:53,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:16:53,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:16:53,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 10:16:53,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:16:53,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 10:16:53,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:16:53,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 10:16:53,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:16:53,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 10:16:54,047 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:16:55,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [531683071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:16:55,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:16:55,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5, 5, 5] total 22 [2022-12-14 10:16:55,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520023720] [2022-12-14 10:16:55,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:16:55,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 10:16:55,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:16:55,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 10:16:55,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2022-12-14 10:16:55,433 INFO L87 Difference]: Start difference. First operand 172 states and 208 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 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 10:16:56,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:16:56,031 INFO L93 Difference]: Finished difference Result 226 states and 265 transitions. [2022-12-14 10:16:56,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 10:16:56,031 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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 10:16:56,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:16:56,032 INFO L225 Difference]: With dead ends: 226 [2022-12-14 10:16:56,032 INFO L226 Difference]: Without dead ends: 226 [2022-12-14 10:16:56,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2022-12-14 10:16:56,033 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 122 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 10:16:56,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 271 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 10:16:56,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-12-14 10:16:56,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 194. [2022-12-14 10:16:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 160 states have (on average 1.45625) internal successors, (233), 193 states have internal predecessors, (233), 0 states have call successors, (0), 0 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 10:16:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 233 transitions. [2022-12-14 10:16:56,037 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 233 transitions. Word has length 26 [2022-12-14 10:16:56,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:16:56,037 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 233 transitions. [2022-12-14 10:16:56,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 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 10:16:56,037 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 233 transitions. [2022-12-14 10:16:56,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 10:16:56,038 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:16:56,038 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 10:16:56,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 10:16:56,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:16:56,239 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:16:56,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:16:56,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1384186235, now seen corresponding path program 1 times [2022-12-14 10:16:56,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:16:56,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219739578] [2022-12-14 10:16:56,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:56,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:16:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:56,405 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 10:16:56,405 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:16:56,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219739578] [2022-12-14 10:16:56,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219739578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:16:56,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:16:56,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 10:16:56,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970062320] [2022-12-14 10:16:56,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:16:56,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 10:16:56,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:16:56,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 10:16:56,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-14 10:16:56,407 INFO L87 Difference]: Start difference. First operand 194 states and 233 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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 10:16:56,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:16:56,818 INFO L93 Difference]: Finished difference Result 335 states and 382 transitions. [2022-12-14 10:16:56,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 10:16:56,818 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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 10:16:56,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:16:56,819 INFO L225 Difference]: With dead ends: 335 [2022-12-14 10:16:56,819 INFO L226 Difference]: Without dead ends: 335 [2022-12-14 10:16:56,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-12-14 10:16:56,820 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 419 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:16:56,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 620 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 10:16:56,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-12-14 10:16:56,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 203. [2022-12-14 10:16:56,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 171 states have (on average 1.4210526315789473) internal successors, (243), 202 states have internal predecessors, (243), 0 states have call successors, (0), 0 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 10:16:56,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 243 transitions. [2022-12-14 10:16:56,825 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 243 transitions. Word has length 27 [2022-12-14 10:16:56,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:16:56,826 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 243 transitions. [2022-12-14 10:16:56,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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 10:16:56,826 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 243 transitions. [2022-12-14 10:16:56,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 10:16:56,826 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:16:56,826 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 10:16:56,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 10:16:56,827 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:16:56,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:16:56,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1384186234, now seen corresponding path program 1 times [2022-12-14 10:16:56,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:16:56,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955402855] [2022-12-14 10:16:56,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:56,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:16:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:57,214 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 10:16:57,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:16:57,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955402855] [2022-12-14 10:16:57,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955402855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:16:57,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:16:57,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 10:16:57,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722058763] [2022-12-14 10:16:57,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:16:57,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 10:16:57,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:16:57,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 10:16:57,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-14 10:16:57,216 INFO L87 Difference]: Start difference. First operand 203 states and 243 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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 10:16:57,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:16:57,799 INFO L93 Difference]: Finished difference Result 387 states and 435 transitions. [2022-12-14 10:16:57,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 10:16:57,800 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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 10:16:57,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:16:57,802 INFO L225 Difference]: With dead ends: 387 [2022-12-14 10:16:57,802 INFO L226 Difference]: Without dead ends: 387 [2022-12-14 10:16:57,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-12-14 10:16:57,803 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 447 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 10:16:57,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 680 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 10:16:57,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-12-14 10:16:57,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 209. [2022-12-14 10:16:57,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 177 states have (on average 1.4124293785310735) internal successors, (250), 208 states have internal predecessors, (250), 0 states have call successors, (0), 0 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 10:16:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 250 transitions. [2022-12-14 10:16:57,808 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 250 transitions. Word has length 27 [2022-12-14 10:16:57,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:16:57,809 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 250 transitions. [2022-12-14 10:16:57,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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 10:16:57,809 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 250 transitions. [2022-12-14 10:16:57,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 10:16:57,809 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:16:57,809 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 10:16:57,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 10:16:57,810 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:16:57,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:16:57,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1506981278, now seen corresponding path program 1 times [2022-12-14 10:16:57,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:16:57,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089404173] [2022-12-14 10:16:57,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:57,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:16:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:57,901 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 10:16:57,901 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:16:57,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089404173] [2022-12-14 10:16:57,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089404173] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:16:57,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:16:57,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 10:16:57,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932164784] [2022-12-14 10:16:57,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:16:57,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:16:57,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:16:57,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:16:57,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:16:57,902 INFO L87 Difference]: Start difference. First operand 209 states and 250 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 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 10:16:58,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:16:58,009 INFO L93 Difference]: Finished difference Result 208 states and 249 transitions. [2022-12-14 10:16:58,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:16:58,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 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 10:16:58,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:16:58,011 INFO L225 Difference]: With dead ends: 208 [2022-12-14 10:16:58,012 INFO L226 Difference]: Without dead ends: 208 [2022-12-14 10:16:58,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:16:58,012 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 3 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:16:58,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 314 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:16:58,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-12-14 10:16:58,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2022-12-14 10:16:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 177 states have (on average 1.4067796610169492) internal successors, (249), 207 states have internal predecessors, (249), 0 states have call successors, (0), 0 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 10:16:58,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 249 transitions. [2022-12-14 10:16:58,016 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 249 transitions. Word has length 27 [2022-12-14 10:16:58,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:16:58,017 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 249 transitions. [2022-12-14 10:16:58,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 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 10:16:58,017 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 249 transitions. [2022-12-14 10:16:58,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 10:16:58,017 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:16:58,017 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 10:16:58,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 10:16:58,017 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:16:58,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:16:58,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1506981277, now seen corresponding path program 1 times [2022-12-14 10:16:58,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:16:58,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739442119] [2022-12-14 10:16:58,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:58,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:16:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:58,128 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 10:16:58,128 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:16:58,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739442119] [2022-12-14 10:16:58,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739442119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:16:58,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:16:58,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 10:16:58,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349519678] [2022-12-14 10:16:58,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:16:58,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:16:58,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:16:58,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:16:58,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:16:58,129 INFO L87 Difference]: Start difference. First operand 208 states and 249 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 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 10:16:58,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:16:58,255 INFO L93 Difference]: Finished difference Result 207 states and 248 transitions. [2022-12-14 10:16:58,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:16:58,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 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 10:16:58,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:16:58,256 INFO L225 Difference]: With dead ends: 207 [2022-12-14 10:16:58,257 INFO L226 Difference]: Without dead ends: 207 [2022-12-14 10:16:58,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:16:58,257 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 1 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:16:58,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 311 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:16:58,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-12-14 10:16:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-12-14 10:16:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 177 states have (on average 1.4011299435028248) internal successors, (248), 206 states have internal predecessors, (248), 0 states have call successors, (0), 0 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 10:16:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 248 transitions. [2022-12-14 10:16:58,260 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 248 transitions. Word has length 27 [2022-12-14 10:16:58,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:16:58,260 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 248 transitions. [2022-12-14 10:16:58,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 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 10:16:58,260 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 248 transitions. [2022-12-14 10:16:58,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 10:16:58,260 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:16:58,260 INFO L195 NwaCegarLoop]: trace histogram [2, 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 10:16:58,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-14 10:16:58,261 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:16:58,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:16:58,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1250355067, now seen corresponding path program 1 times [2022-12-14 10:16:58,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:16:58,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157035415] [2022-12-14 10:16:58,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:58,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:16:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:58,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:16:58,508 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:16:58,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157035415] [2022-12-14 10:16:58,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157035415] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:16:58,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743159050] [2022-12-14 10:16:58,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:58,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:16:58,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:16:58,509 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:16:58,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 10:16:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:58,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-14 10:16:58,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:16:58,722 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:16:58,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 25 [2022-12-14 10:16:58,728 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:16:58,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 21 [2022-12-14 10:16:58,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:16:58,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:16:58,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743159050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:16:58,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:16:58,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2022-12-14 10:16:58,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642100062] [2022-12-14 10:16:58,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:16:58,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 10:16:58,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:16:58,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 10:16:58,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-12-14 10:16:58,779 INFO L87 Difference]: Start difference. First operand 207 states and 248 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 10:16:59,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:16:59,117 INFO L93 Difference]: Finished difference Result 318 states and 356 transitions. [2022-12-14 10:16:59,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 10:16:59,118 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-12-14 10:16:59,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:16:59,119 INFO L225 Difference]: With dead ends: 318 [2022-12-14 10:16:59,119 INFO L226 Difference]: Without dead ends: 315 [2022-12-14 10:16:59,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-12-14 10:16:59,120 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 266 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:16:59,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 599 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 10:16:59,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-12-14 10:16:59,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 207. [2022-12-14 10:16:59,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 177 states have (on average 1.3954802259887005) internal successors, (247), 206 states have internal predecessors, (247), 0 states have call successors, (0), 0 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 10:16:59,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 247 transitions. [2022-12-14 10:16:59,125 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 247 transitions. Word has length 29 [2022-12-14 10:16:59,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:16:59,125 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 247 transitions. [2022-12-14 10:16:59,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 10:16:59,125 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 247 transitions. [2022-12-14 10:16:59,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 10:16:59,126 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:16:59,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, 1, 1, 1] [2022-12-14 10:16:59,130 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 10:16:59,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-14 10:16:59,327 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:16:59,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:16:59,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1236897669, now seen corresponding path program 1 times [2022-12-14 10:16:59,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:16:59,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48901619] [2022-12-14 10:16:59,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:16:59,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:16:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:16:59,730 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 10:16:59,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:16:59,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48901619] [2022-12-14 10:16:59,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48901619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:16:59,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:16:59,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 10:16:59,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486773491] [2022-12-14 10:16:59,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:16:59,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 10:16:59,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:16:59,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 10:16:59,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-14 10:16:59,731 INFO L87 Difference]: Start difference. First operand 207 states and 247 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 10:17:00,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:17:00,400 INFO L93 Difference]: Finished difference Result 395 states and 435 transitions. [2022-12-14 10:17:00,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 10:17:00,400 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-12-14 10:17:00,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:17:00,401 INFO L225 Difference]: With dead ends: 395 [2022-12-14 10:17:00,401 INFO L226 Difference]: Without dead ends: 395 [2022-12-14 10:17:00,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2022-12-14 10:17:00,401 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 678 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:17:00,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 840 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 10:17:00,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-12-14 10:17:00,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 207. [2022-12-14 10:17:00,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 177 states have (on average 1.3898305084745763) internal successors, (246), 206 states have internal predecessors, (246), 0 states have call successors, (0), 0 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 10:17:00,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 246 transitions. [2022-12-14 10:17:00,405 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 246 transitions. Word has length 29 [2022-12-14 10:17:00,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:17:00,405 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 246 transitions. [2022-12-14 10:17:00,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 10:17:00,405 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 246 transitions. [2022-12-14 10:17:00,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 10:17:00,405 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:17:00,405 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, 1, 1] [2022-12-14 10:17:00,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-14 10:17:00,405 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:17:00,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:17:00,406 INFO L85 PathProgramCache]: Analyzing trace with hash -804731177, now seen corresponding path program 1 times [2022-12-14 10:17:00,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:17:00,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095080522] [2022-12-14 10:17:00,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:17:00,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:17:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:17:00,587 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 10:17:00,587 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:17:00,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095080522] [2022-12-14 10:17:00,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095080522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:17:00,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:17:00,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 10:17:00,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001016182] [2022-12-14 10:17:00,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:17:00,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 10:17:00,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:17:00,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 10:17:00,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-14 10:17:00,589 INFO L87 Difference]: Start difference. First operand 207 states and 246 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 10:17:00,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:17:00,846 INFO L93 Difference]: Finished difference Result 207 states and 246 transitions. [2022-12-14 10:17:00,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 10:17:00,846 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-12-14 10:17:00,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:17:00,847 INFO L225 Difference]: With dead ends: 207 [2022-12-14 10:17:00,847 INFO L226 Difference]: Without dead ends: 207 [2022-12-14 10:17:00,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-12-14 10:17:00,848 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 67 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:17:00,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 494 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:17:00,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-12-14 10:17:00,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2022-12-14 10:17:00,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 177 states have (on average 1.384180790960452) internal successors, (245), 205 states have internal predecessors, (245), 0 states have call successors, (0), 0 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 10:17:00,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 245 transitions. [2022-12-14 10:17:00,851 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 245 transitions. Word has length 29 [2022-12-14 10:17:00,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:17:00,851 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 245 transitions. [2022-12-14 10:17:00,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 10:17:00,852 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 245 transitions. [2022-12-14 10:17:00,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 10:17:00,852 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:17:00,852 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, 1, 1] [2022-12-14 10:17:00,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-14 10:17:00,852 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:17:00,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:17:00,853 INFO L85 PathProgramCache]: Analyzing trace with hash -804731176, now seen corresponding path program 1 times [2022-12-14 10:17:00,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:17:00,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386100227] [2022-12-14 10:17:00,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:17:00,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:17:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:17:01,077 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 10:17:01,077 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:17:01,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386100227] [2022-12-14 10:17:01,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386100227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:17:01,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:17:01,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 10:17:01,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114114324] [2022-12-14 10:17:01,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:17:01,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 10:17:01,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:17:01,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 10:17:01,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-14 10:17:01,079 INFO L87 Difference]: Start difference. First operand 206 states and 245 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 10:17:01,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:17:01,285 INFO L93 Difference]: Finished difference Result 206 states and 245 transitions. [2022-12-14 10:17:01,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 10:17:01,285 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-12-14 10:17:01,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:17:01,286 INFO L225 Difference]: With dead ends: 206 [2022-12-14 10:17:01,286 INFO L226 Difference]: Without dead ends: 206 [2022-12-14 10:17:01,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-12-14 10:17:01,287 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 63 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:17:01,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 426 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:17:01,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-12-14 10:17:01,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2022-12-14 10:17:01,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 177 states have (on average 1.3785310734463276) internal successors, (244), 204 states have internal predecessors, (244), 0 states have call successors, (0), 0 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 10:17:01,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 244 transitions. [2022-12-14 10:17:01,292 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 244 transitions. Word has length 29 [2022-12-14 10:17:01,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:17:01,292 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 244 transitions. [2022-12-14 10:17:01,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 10:17:01,292 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 244 transitions. [2022-12-14 10:17:01,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 10:17:01,292 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:17:01,293 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, 1, 1] [2022-12-14 10:17:01,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-14 10:17:01,293 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:17:01,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:17:01,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1221870657, now seen corresponding path program 1 times [2022-12-14 10:17:01,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:17:01,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672199727] [2022-12-14 10:17:01,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:17:01,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:17:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:17:01,314 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 10:17:01,314 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:17:01,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672199727] [2022-12-14 10:17:01,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672199727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:17:01,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:17:01,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:17:01,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669557684] [2022-12-14 10:17:01,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:17:01,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:17:01,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:17:01,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:17:01,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:17:01,316 INFO L87 Difference]: Start difference. First operand 205 states and 244 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 10:17:01,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:17:01,346 INFO L93 Difference]: Finished difference Result 206 states and 245 transitions. [2022-12-14 10:17:01,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:17:01,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-12-14 10:17:01,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:17:01,347 INFO L225 Difference]: With dead ends: 206 [2022-12-14 10:17:01,347 INFO L226 Difference]: Without dead ends: 206 [2022-12-14 10:17:01,347 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 10:17:01,347 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:17:01,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 195 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:17:01,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-12-14 10:17:01,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-12-14 10:17:01,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 178 states have (on average 1.3764044943820224) internal successors, (245), 205 states have internal predecessors, (245), 0 states have call successors, (0), 0 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 10:17:01,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 245 transitions. [2022-12-14 10:17:01,350 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 245 transitions. Word has length 29 [2022-12-14 10:17:01,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:17:01,350 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 245 transitions. [2022-12-14 10:17:01,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 10:17:01,350 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 245 transitions. [2022-12-14 10:17:01,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 10:17:01,350 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:17:01,350 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:17:01,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-14 10:17:01,350 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:17:01,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:17:01,351 INFO L85 PathProgramCache]: Analyzing trace with hash 41776820, now seen corresponding path program 1 times [2022-12-14 10:17:01,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:17:01,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223425192] [2022-12-14 10:17:01,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:17:01,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:17:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:17:01,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 10:17:01,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:17:01,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223425192] [2022-12-14 10:17:01,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223425192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:17:01,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:17:01,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 10:17:01,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303803852] [2022-12-14 10:17:01,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:17:01,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 10:17:01,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:17:01,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 10:17:01,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-14 10:17:01,483 INFO L87 Difference]: Start difference. First operand 206 states and 245 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 10:17:01,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:17:01,713 INFO L93 Difference]: Finished difference Result 277 states and 329 transitions. [2022-12-14 10:17:01,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 10:17:01,714 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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 30 [2022-12-14 10:17:01,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:17:01,715 INFO L225 Difference]: With dead ends: 277 [2022-12-14 10:17:01,715 INFO L226 Difference]: Without dead ends: 277 [2022-12-14 10:17:01,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-14 10:17:01,716 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 294 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:17:01,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 500 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:17:01,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-12-14 10:17:01,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 194. [2022-12-14 10:17:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 166 states have (on average 1.391566265060241) internal successors, (231), 193 states have internal predecessors, (231), 0 states have call successors, (0), 0 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 10:17:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 231 transitions. [2022-12-14 10:17:01,721 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 231 transitions. Word has length 30 [2022-12-14 10:17:01,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:17:01,721 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 231 transitions. [2022-12-14 10:17:01,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 10:17:01,721 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 231 transitions. [2022-12-14 10:17:01,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 10:17:01,722 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:17:01,722 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, 1, 1, 1] [2022-12-14 10:17:01,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-14 10:17:01,722 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:17:01,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:17:01,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1490088857, now seen corresponding path program 1 times [2022-12-14 10:17:01,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:17:01,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425499527] [2022-12-14 10:17:01,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:17:01,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:17:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:17:01,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 10:17:01,791 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:17:01,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425499527] [2022-12-14 10:17:01,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425499527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:17:01,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:17:01,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 10:17:01,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050784251] [2022-12-14 10:17:01,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:17:01,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:17:01,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:17:01,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:17:01,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:17:01,792 INFO L87 Difference]: Start difference. First operand 194 states and 231 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 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 10:17:01,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:17:01,901 INFO L93 Difference]: Finished difference Result 196 states and 232 transitions. [2022-12-14 10:17:01,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 10:17:01,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-12-14 10:17:01,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:17:01,902 INFO L225 Difference]: With dead ends: 196 [2022-12-14 10:17:01,902 INFO L226 Difference]: Without dead ends: 196 [2022-12-14 10:17:01,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 10:17:01,903 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 20 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:17:01,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 230 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:17:01,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-12-14 10:17:01,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2022-12-14 10:17:01,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 166 states have (on average 1.3855421686746987) internal successors, (230), 193 states have internal predecessors, (230), 0 states have call successors, (0), 0 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 10:17:01,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 230 transitions. [2022-12-14 10:17:01,907 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 230 transitions. Word has length 30 [2022-12-14 10:17:01,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:17:01,907 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 230 transitions. [2022-12-14 10:17:01,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 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 10:17:01,908 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 230 transitions. [2022-12-14 10:17:01,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 10:17:01,908 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:17:01,908 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, 1, 1, 1] [2022-12-14 10:17:01,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-14 10:17:01,908 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:17:01,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:17:01,909 INFO L85 PathProgramCache]: Analyzing trace with hash 777041232, now seen corresponding path program 1 times [2022-12-14 10:17:01,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:17:01,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965442417] [2022-12-14 10:17:01,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:17:01,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:17:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:17:01,975 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 10:17:01,975 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:17:01,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965442417] [2022-12-14 10:17:01,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965442417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:17:01,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:17:01,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 10:17:01,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393413459] [2022-12-14 10:17:01,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:17:01,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:17:01,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:17:01,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:17:01,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:17:01,977 INFO L87 Difference]: Start difference. First operand 194 states and 230 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 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 10:17:02,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:17:02,088 INFO L93 Difference]: Finished difference Result 201 states and 239 transitions. [2022-12-14 10:17:02,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 10:17:02,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-12-14 10:17:02,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:17:02,089 INFO L225 Difference]: With dead ends: 201 [2022-12-14 10:17:02,089 INFO L226 Difference]: Without dead ends: 201 [2022-12-14 10:17:02,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:17:02,089 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 9 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:17:02,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 228 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:17:02,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-12-14 10:17:02,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 191. [2022-12-14 10:17:02,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 164 states have (on average 1.3841463414634145) internal successors, (227), 190 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:17:02,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2022-12-14 10:17:02,092 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 30 [2022-12-14 10:17:02,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:17:02,092 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2022-12-14 10:17:02,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 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 10:17:02,092 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2022-12-14 10:17:02,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 10:17:02,092 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:17:02,092 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, 1, 1, 1, 1, 1] [2022-12-14 10:17:02,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-14 10:17:02,092 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:17:02,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:17:02,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1898212568, now seen corresponding path program 1 times [2022-12-14 10:17:02,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:17:02,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280113312] [2022-12-14 10:17:02,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:17:02,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:17:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:17:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:17:02,469 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:17:02,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280113312] [2022-12-14 10:17:02,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280113312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:17:02,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:17:02,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 10:17:02,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210110946] [2022-12-14 10:17:02,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:17:02,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 10:17:02,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:17:02,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 10:17:02,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-14 10:17:02,470 INFO L87 Difference]: Start difference. First operand 191 states and 227 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 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 10:17:02,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:17:02,990 INFO L93 Difference]: Finished difference Result 286 states and 327 transitions. [2022-12-14 10:17:02,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 10:17:02,990 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-12-14 10:17:02,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:17:02,991 INFO L225 Difference]: With dead ends: 286 [2022-12-14 10:17:02,991 INFO L226 Difference]: Without dead ends: 286 [2022-12-14 10:17:02,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-12-14 10:17:02,992 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 308 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:17:02,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 895 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 10:17:02,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-12-14 10:17:02,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 191. [2022-12-14 10:17:02,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 164 states have (on average 1.3780487804878048) internal successors, (226), 190 states have internal predecessors, (226), 0 states have call successors, (0), 0 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 10:17:02,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 226 transitions. [2022-12-14 10:17:02,996 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 226 transitions. Word has length 32 [2022-12-14 10:17:02,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:17:02,996 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 226 transitions. [2022-12-14 10:17:02,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 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 10:17:02,996 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 226 transitions. [2022-12-14 10:17:02,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 10:17:02,997 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:17:02,997 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:17:02,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-14 10:17:02,997 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:17:02,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:17:02,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1770465652, now seen corresponding path program 1 times [2022-12-14 10:17:02,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:17:02,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299187282] [2022-12-14 10:17:02,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:17:02,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:17:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:17:03,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:17:03,099 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:17:03,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299187282] [2022-12-14 10:17:03,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299187282] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:17:03,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907677181] [2022-12-14 10:17:03,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:17:03,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:17:03,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:17:03,100 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:17:03,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 10:17:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:17:03,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-14 10:17:03,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:17:03,191 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 11 treesize of output 7 [2022-12-14 10:17:03,195 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 11 treesize of output 7 [2022-12-14 10:17:03,210 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 21 treesize of output 20 [2022-12-14 10:17:03,215 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 21 treesize of output 20 [2022-12-14 10:17:03,280 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 15 treesize of output 7 [2022-12-14 10:17:03,282 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 15 treesize of output 7 [2022-12-14 10:17:03,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 10:17:03,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:17:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 10:17:03,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907677181] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:17:03,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [767458823] [2022-12-14 10:17:03,367 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2022-12-14 10:17:03,367 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:17:03,367 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:17:03,367 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:17:03,367 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:17:03,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:17:03,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:17:03,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 10:17:03,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:17:03,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 10:17:03,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:17:03,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:17:03,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:17:03,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 10:17:03,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:17:03,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 10:17:03,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:17:03,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 10:17:03,643 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 9 [2022-12-14 10:17:03,678 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 10:17:03,701 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 10:17:03,711 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:17:05,358 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '14079#(and (not (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 10:17:05,358 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:17:05,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:17:05,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2022-12-14 10:17:05,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510556398] [2022-12-14 10:17:05,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:17:05,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 10:17:05,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:17:05,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 10:17:05,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2022-12-14 10:17:05,360 INFO L87 Difference]: Start difference. First operand 191 states and 226 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 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 10:17:05,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:17:05,638 INFO L93 Difference]: Finished difference Result 301 states and 332 transitions. [2022-12-14 10:17:05,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 10:17:05,638 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 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 34 [2022-12-14 10:17:05,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:17:05,640 INFO L225 Difference]: With dead ends: 301 [2022-12-14 10:17:05,640 INFO L226 Difference]: Without dead ends: 301 [2022-12-14 10:17:05,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2022-12-14 10:17:05,641 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 178 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:17:05,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 453 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:17:05,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-12-14 10:17:05,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 228. [2022-12-14 10:17:05,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 201 states have (on average 1.4179104477611941) internal successors, (285), 227 states have internal predecessors, (285), 0 states have call successors, (0), 0 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 10:17:05,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 285 transitions. [2022-12-14 10:17:05,646 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 285 transitions. Word has length 34 [2022-12-14 10:17:05,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:17:05,646 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 285 transitions. [2022-12-14 10:17:05,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 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 10:17:05,646 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 285 transitions. [2022-12-14 10:17:05,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 10:17:05,646 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:17:05,647 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:17:05,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-14 10:17:05,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-12-14 10:17:05,848 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:17:05,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:17:05,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1770469367, now seen corresponding path program 1 times [2022-12-14 10:17:05,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:17:05,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109344650] [2022-12-14 10:17:05,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:17:05,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:17:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:17:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 10:17:05,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:17:05,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109344650] [2022-12-14 10:17:05,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109344650] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:17:05,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645062456] [2022-12-14 10:17:05,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:17:05,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:17:05,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:17:05,941 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:17:05,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 10:17:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:17:06,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 10:17:06,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:17:06,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2022-12-14 10:17:06,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 10:17:06,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:17:06,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 10:17:06,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645062456] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:17:06,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2134595562] [2022-12-14 10:17:06,129 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2022-12-14 10:17:06,129 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:17:06,129 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:17:06,129 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:17:06,130 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:17:06,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:17:06,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:17:06,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 10:17:06,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:17:06,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:17:06,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:17:06,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 10:17:06,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:17:06,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 10:17:06,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:17:06,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 10:17:06,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:17:06,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 10:17:06,380 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 9 [2022-12-14 10:17:06,416 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 10:17:06,441 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 10:17:06,457 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:17:07,932 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '14838#(and (<= 0 |#NULL.base|) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (<= |#NULL.offset| 0) (<= |#NULL.base| 0) (= |ULTIMATE.start_main_~list~0#1.offset| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~list~0#1.base| 0) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2022-12-14 10:17:07,932 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:17:07,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:17:07,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 3 [2022-12-14 10:17:07,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692710677] [2022-12-14 10:17:07,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:17:07,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:17:07,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:17:07,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:17:07,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2022-12-14 10:17:07,933 INFO L87 Difference]: Start difference. First operand 228 states and 285 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 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 10:17:08,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:17:08,001 INFO L93 Difference]: Finished difference Result 231 states and 287 transitions. [2022-12-14 10:17:08,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 10:17:08,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 34 [2022-12-14 10:17:08,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:17:08,001 INFO L225 Difference]: With dead ends: 231 [2022-12-14 10:17:08,002 INFO L226 Difference]: Without dead ends: 212 [2022-12-14 10:17:08,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 73 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2022-12-14 10:17:08,002 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:17:08,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 219 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:17:08,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-12-14 10:17:08,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-12-14 10:17:08,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 185 states have (on average 1.4486486486486487) internal successors, (268), 211 states have internal predecessors, (268), 0 states have call successors, (0), 0 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 10:17:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 268 transitions. [2022-12-14 10:17:08,004 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 268 transitions. Word has length 34 [2022-12-14 10:17:08,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:17:08,004 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 268 transitions. [2022-12-14 10:17:08,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 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 10:17:08,004 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 268 transitions. [2022-12-14 10:17:08,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 10:17:08,005 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:17:08,005 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:17:08,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 10:17:08,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-14 10:17:08,205 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2022-12-14 10:17:08,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:17:08,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2115548787, now seen corresponding path program 1 times [2022-12-14 10:17:08,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:17:08,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368115341] [2022-12-14 10:17:08,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:17:08,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:17:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 10:17:08,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 10:17:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 10:17:08,242 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 10:17:08,242 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 10:17:08,242 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 80 remaining) [2022-12-14 10:17:08,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 80 remaining) [2022-12-14 10:17:08,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 80 remaining) [2022-12-14 10:17:08,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (76 of 80 remaining) [2022-12-14 10:17:08,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 80 remaining) [2022-12-14 10:17:08,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 80 remaining) [2022-12-14 10:17:08,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 80 remaining) [2022-12-14 10:17:08,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 80 remaining) [2022-12-14 10:17:08,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 80 remaining) [2022-12-14 10:17:08,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 80 remaining) [2022-12-14 10:17:08,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 80 remaining) [2022-12-14 10:17:08,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 80 remaining) [2022-12-14 10:17:08,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 80 remaining) [2022-12-14 10:17:08,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 80 remaining) [2022-12-14 10:17:08,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 80 remaining) [2022-12-14 10:17:08,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 80 remaining) [2022-12-14 10:17:08,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 80 remaining) [2022-12-14 10:17:08,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 80 remaining) [2022-12-14 10:17:08,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 80 remaining) [2022-12-14 10:17:08,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 80 remaining) [2022-12-14 10:17:08,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (59 of 80 remaining) [2022-12-14 10:17:08,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 80 remaining) [2022-12-14 10:17:08,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 80 remaining) [2022-12-14 10:17:08,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 80 remaining) [2022-12-14 10:17:08,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 80 remaining) [2022-12-14 10:17:08,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 80 remaining) [2022-12-14 10:17:08,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 80 remaining) [2022-12-14 10:17:08,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (52 of 80 remaining) [2022-12-14 10:17:08,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK (51 of 80 remaining) [2022-12-14 10:17:08,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 80 remaining) [2022-12-14 10:17:08,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 80 remaining) [2022-12-14 10:17:08,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 80 remaining) [2022-12-14 10:17:08,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 80 remaining) [2022-12-14 10:17:08,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 80 remaining) [2022-12-14 10:17:08,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 80 remaining) [2022-12-14 10:17:08,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 80 remaining) [2022-12-14 10:17:08,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 80 remaining) [2022-12-14 10:17:08,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 80 remaining) [2022-12-14 10:17:08,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 80 remaining) [2022-12-14 10:17:08,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 80 remaining) [2022-12-14 10:17:08,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 80 remaining) [2022-12-14 10:17:08,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 80 remaining) [2022-12-14 10:17:08,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 80 remaining) [2022-12-14 10:17:08,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 80 remaining) [2022-12-14 10:17:08,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 80 remaining) [2022-12-14 10:17:08,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (34 of 80 remaining) [2022-12-14 10:17:08,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK (33 of 80 remaining) [2022-12-14 10:17:08,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 80 remaining) [2022-12-14 10:17:08,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 80 remaining) [2022-12-14 10:17:08,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK (30 of 80 remaining) [2022-12-14 10:17:08,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 80 remaining) [2022-12-14 10:17:08,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 80 remaining) [2022-12-14 10:17:08,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK (27 of 80 remaining) [2022-12-14 10:17:08,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 80 remaining) [2022-12-14 10:17:08,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 80 remaining) [2022-12-14 10:17:08,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK (24 of 80 remaining) [2022-12-14 10:17:08,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 80 remaining) [2022-12-14 10:17:08,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 80 remaining) [2022-12-14 10:17:08,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 80 remaining) [2022-12-14 10:17:08,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_LEAK (20 of 80 remaining) [2022-12-14 10:17:08,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 80 remaining) [2022-12-14 10:17:08,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 80 remaining) [2022-12-14 10:17:08,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 80 remaining) [2022-12-14 10:17:08,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 80 remaining) [2022-12-14 10:17:08,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK (15 of 80 remaining) [2022-12-14 10:17:08,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 80 remaining) [2022-12-14 10:17:08,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 80 remaining) [2022-12-14 10:17:08,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK (12 of 80 remaining) [2022-12-14 10:17:08,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 80 remaining) [2022-12-14 10:17:08,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 80 remaining) [2022-12-14 10:17:08,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK (9 of 80 remaining) [2022-12-14 10:17:08,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE (8 of 80 remaining) [2022-12-14 10:17:08,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE (7 of 80 remaining) [2022-12-14 10:17:08,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE (6 of 80 remaining) [2022-12-14 10:17:08,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 80 remaining) [2022-12-14 10:17:08,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 80 remaining) [2022-12-14 10:17:08,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE (3 of 80 remaining) [2022-12-14 10:17:08,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE (2 of 80 remaining) [2022-12-14 10:17:08,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE (1 of 80 remaining) [2022-12-14 10:17:08,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK (0 of 80 remaining) [2022-12-14 10:17:08,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-14 10:17:08,252 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:17:08,255 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 10:17:08,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 10:17:08 BoogieIcfgContainer [2022-12-14 10:17:08,272 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 10:17:08,272 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 10:17:08,273 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 10:17:08,273 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 10:17:08,273 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:16:48" (3/4) ... [2022-12-14 10:17:08,274 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 10:17:08,298 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 10:17:08,298 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 10:17:08,299 INFO L158 Benchmark]: Toolchain (without parser) took 20613.60ms. Allocated memory was 130.0MB in the beginning and 186.6MB in the end (delta: 56.6MB). Free memory was 95.0MB in the beginning and 104.6MB in the end (delta: -9.7MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. [2022-12-14 10:17:08,299 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 130.0MB. Free memory was 69.2MB in the beginning and 69.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 10:17:08,299 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.65ms. Allocated memory is still 130.0MB. Free memory was 94.6MB in the beginning and 74.8MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-14 10:17:08,299 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.08ms. Allocated memory is still 130.0MB. Free memory was 74.8MB in the beginning and 72.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 10:17:08,299 INFO L158 Benchmark]: Boogie Preprocessor took 26.49ms. Allocated memory is still 130.0MB. Free memory was 72.3MB in the beginning and 69.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 10:17:08,299 INFO L158 Benchmark]: RCFGBuilder took 591.71ms. Allocated memory was 130.0MB in the beginning and 186.6MB in the end (delta: 56.6MB). Free memory was 69.9MB in the beginning and 127.4MB in the end (delta: -57.5MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2022-12-14 10:17:08,299 INFO L158 Benchmark]: TraceAbstraction took 19653.77ms. Allocated memory is still 186.6MB. Free memory was 126.4MB in the beginning and 107.8MB in the end (delta: 18.6MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2022-12-14 10:17:08,299 INFO L158 Benchmark]: Witness Printer took 25.93ms. Allocated memory is still 186.6MB. Free memory was 107.8MB in the beginning and 104.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 10:17:08,300 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 130.0MB. Free memory was 69.2MB in the beginning and 69.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.65ms. Allocated memory is still 130.0MB. Free memory was 94.6MB in the beginning and 74.8MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.08ms. Allocated memory is still 130.0MB. Free memory was 74.8MB in the beginning and 72.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.49ms. Allocated memory is still 130.0MB. Free memory was 72.3MB in the beginning and 69.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 591.71ms. Allocated memory was 130.0MB in the beginning and 186.6MB in the end (delta: 56.6MB). Free memory was 69.9MB in the beginning and 127.4MB in the end (delta: -57.5MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * TraceAbstraction took 19653.77ms. Allocated memory is still 186.6MB. Free memory was 126.4MB in the beginning and 107.8MB in the end (delta: 18.6MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * Witness Printer took 25.93ms. Allocated memory is still 186.6MB. Free memory was 107.8MB in the beginning and 104.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1002] SLL* list = malloc(sizeof(SLL)); [L1003] list->next = ((void*)0) VAL [list={-1:0}] [L1004] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1004] list->inner = malloc(sizeof(SLL)) [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] list->inner->next = ((void*)0) [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] list->inner->inner = ((void*)0) [L1004] EXPR list->inner [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1] [L1004] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1006] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1019] end = ((void*)0) [L1020] end = list VAL [end={-1:0}, list={-1:0}] [L1023] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1025] COND TRUE ((void*)0) != end [L1027] int len = 0; VAL [end={-1:0}, len=0, list={-1:0}] [L1028] EXPR end->inner [L1028] SLL* inner = end->inner; [L1029] COND TRUE ((void*)0) != inner [L1031] COND TRUE len == 0 [L1032] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1036] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1036] COND FALSE !(!(((void*)0) == inner->inner)) [L1037] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}] [L1037] COND FALSE !(!(((void*)0) == inner->next)) [L1038] EXPR inner->inner [L1038] inner = inner->inner [L1039] COND TRUE len == 1 VAL [end={-1:0}, inner={0:0}, len=1, list={-1:0}] [L1040] inner->inner - 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: 1004]: 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: 1004]: 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: 1015]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1016]: 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: 1016]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1023]: 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: 1035]: 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: 1036]: 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: 1037]: 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: 1042]: 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: 1054]: 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: 1055]: 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: 1056]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free 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: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 173 locations, 80 error locations. Started 1 CEGAR loops. OverallTime: 19.6s, OverallIterations: 35, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4845 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4845 mSDsluCounter, 12709 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9193 mSDsCounter, 216 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9604 IncrementalHoareTripleChecker+Invalid, 9820 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 216 mSolverCounterUnsat, 3516 mSDtfsCounter, 9604 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 587 GetRequests, 274 SyntacticMatches, 21 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=33, InterpolantAutomatonStates: 239, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 1343 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 873 NumberOfCodeBlocks, 873 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 891 ConstructedInterpolants, 16 QuantifiedInterpolants, 8473 SizeOfPredicates, 25 NumberOfNonLiveVariables, 665 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 41 InterpolantComputations, 31 PerfectInterpolantSequences, 17/28 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: OVERALL_TIME: 0.3s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 24, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 31, TOOLS_POST_TIME: 0.2s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 31, TOOLS_QUANTIFIERELIM_TIME: 0.2s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 60, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 1, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 1, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 24, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 1, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 366, DAG_COMPRESSION_RETAINED_NODES: 62, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-14 10:17:08,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33f5e849-2a4e-4af1-bbc3-ef3ba25a324e/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)