./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-queue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-queue-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af4a0e4f738e916feae01fb2c2f056f4ba7834b8a7b8d69765614c5417c16c63 --- 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-b5237d8 [2022-11-21 13:46:05,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:46:05,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:46:05,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:46:05,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:46:05,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:46:05,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:46:05,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:46:05,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:46:05,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:46:05,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:46:05,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:46:05,590 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:46:05,592 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:46:05,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:46:05,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:46:05,595 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:46:05,596 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:46:05,598 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:46:05,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:46:05,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:46:05,603 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:46:05,604 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:46:05,605 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:46:05,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:46:05,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:46:05,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:46:05,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:46:05,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:46:05,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:46:05,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:46:05,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:46:05,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:46:05,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:46:05,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:46:05,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:46:05,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:46:05,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:46:05,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:46:05,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:46:05,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:46:05,622 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-11-21 13:46:05,654 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:46:05,654 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:46:05,654 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:46:05,655 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:46:05,655 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:46:05,656 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:46:05,657 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:46:05,657 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:46:05,657 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:46:05,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:46:05,658 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 13:46:05,658 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 13:46:05,658 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:46:05,658 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 13:46:05,659 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:46:05,659 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 13:46:05,659 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 13:46:05,659 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:46:05,659 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 13:46:05,660 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 13:46:05,660 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:46:05,660 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:46:05,660 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:46:05,661 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:46:05,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:46:05,661 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:46:05,661 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:46:05,662 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 13:46:05,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 13:46:05,662 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/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_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a 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-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> af4a0e4f738e916feae01fb2c2f056f4ba7834b8a7b8d69765614c5417c16c63 [2022-11-21 13:46:05,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:46:05,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:46:05,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:46:05,963 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:46:05,964 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:46:05,965 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/forester-heap/sll-queue-2.i [2022-11-21 13:46:09,061 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:46:09,377 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:46:09,377 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i [2022-11-21 13:46:09,390 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/data/ebeda6e32/ee168ddb6cdd4c54a944e774780d0a65/FLAG3c945f3b4 [2022-11-21 13:46:09,406 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/data/ebeda6e32/ee168ddb6cdd4c54a944e774780d0a65 [2022-11-21 13:46:09,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:46:09,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:46:09,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:46:09,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:46:09,428 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:46:09,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:46:09" (1/1) ... [2022-11-21 13:46:09,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f7c85be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:09, skipping insertion in model container [2022-11-21 13:46:09,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:46:09" (1/1) ... [2022-11-21 13:46:09,438 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:46:09,473 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:46:09,773 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[22387,22400] [2022-11-21 13:46:09,784 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[22458,22471] [2022-11-21 13:46:09,786 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[22532,22545] [2022-11-21 13:46:09,788 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[22624,22637] [2022-11-21 13:46:09,790 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[22701,22714] [2022-11-21 13:46:09,792 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[22796,22809] [2022-11-21 13:46:09,795 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[22873,22886] [2022-11-21 13:46:09,798 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[22956,22969] [2022-11-21 13:46:09,801 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[23051,23064] [2022-11-21 13:46:09,803 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[23128,23141] [2022-11-21 13:46:09,805 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[23211,23224] [2022-11-21 13:46:09,807 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[23300,23313] [2022-11-21 13:46:09,811 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[23386,23399] [2022-11-21 13:46:09,813 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[23532,23545] [2022-11-21 13:46:09,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:46:09,839 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:46:09,906 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[22387,22400] [2022-11-21 13:46:09,919 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[22458,22471] [2022-11-21 13:46:09,920 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[22532,22545] [2022-11-21 13:46:09,921 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[22624,22637] [2022-11-21 13:46:09,922 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[22701,22714] [2022-11-21 13:46:09,923 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[22796,22809] [2022-11-21 13:46:09,924 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[22873,22886] [2022-11-21 13:46:09,925 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[22956,22969] [2022-11-21 13:46:09,926 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[23051,23064] [2022-11-21 13:46:09,927 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[23128,23141] [2022-11-21 13:46:09,928 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[23211,23224] [2022-11-21 13:46:09,929 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[23300,23313] [2022-11-21 13:46:09,931 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[23386,23399] [2022-11-21 13:46:09,932 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_ec8d37f1-439e-4965-9eba-50a50a333c5d/sv-benchmarks/c/forester-heap/sll-queue-2.i[23532,23545] [2022-11-21 13:46:09,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:46:09,977 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:46:09,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:09 WrapperNode [2022-11-21 13:46:09,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:46:09,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:46:09,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:46:09,979 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:46:09,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:09" (1/1) ... [2022-11-21 13:46:10,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:09" (1/1) ... [2022-11-21 13:46:10,037 INFO L138 Inliner]: procedures = 119, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 222 [2022-11-21 13:46:10,037 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:46:10,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:46:10,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:46:10,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:46:10,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:09" (1/1) ... [2022-11-21 13:46:10,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:09" (1/1) ... [2022-11-21 13:46:10,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:09" (1/1) ... [2022-11-21 13:46:10,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:09" (1/1) ... [2022-11-21 13:46:10,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:09" (1/1) ... [2022-11-21 13:46:10,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:09" (1/1) ... [2022-11-21 13:46:10,078 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:09" (1/1) ... [2022-11-21 13:46:10,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:09" (1/1) ... [2022-11-21 13:46:10,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:46:10,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:46:10,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:46:10,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:46:10,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:09" (1/1) ... [2022-11-21 13:46:10,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:46:10,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:46:10,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:46:10,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:46:10,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 13:46:10,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 13:46:10,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 13:46:10,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 13:46:10,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 13:46:10,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 13:46:10,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 13:46:10,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 13:46:10,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:46:10,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:46:10,306 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:46:10,309 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:46:10,892 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:46:10,901 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:46:10,901 INFO L300 CfgBuilder]: Removed 31 assume(true) statements. [2022-11-21 13:46:10,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:46:10 BoogieIcfgContainer [2022-11-21 13:46:10,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:46:10,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:46:10,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:46:10,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:46:10,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:46:09" (1/3) ... [2022-11-21 13:46:10,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4022a3e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:46:10, skipping insertion in model container [2022-11-21 13:46:10,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:46:09" (2/3) ... [2022-11-21 13:46:10,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4022a3e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:46:10, skipping insertion in model container [2022-11-21 13:46:10,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:46:10" (3/3) ... [2022-11-21 13:46:10,912 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-queue-2.i [2022-11-21 13:46:10,932 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:46:10,932 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2022-11-21 13:46:10,986 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:46:10,992 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;@6c63e664, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:46:10,992 INFO L358 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2022-11-21 13:46:10,997 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 100 states have (on average 2.26) internal successors, (226), 170 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-11-21 13:46:11,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-21 13:46:11,004 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:11,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-21 13:46:11,005 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:46:11,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:11,010 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-21 13:46:11,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:11,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957108393] [2022-11-21 13:46:11,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:11,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:11,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:11,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957108393] [2022-11-21 13:46:11,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957108393] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:11,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:11,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:46:11,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236705935] [2022-11-21 13:46:11,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:11,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:46:11,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:11,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:46:11,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:46:11,340 INFO L87 Difference]: Start difference. First operand has 171 states, 100 states have (on average 2.26) internal successors, (226), 170 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:11,583 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2022-11-21 13:46:11,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:46:11,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-21 13:46:11,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:11,596 INFO L225 Difference]: With dead ends: 169 [2022-11-21 13:46:11,596 INFO L226 Difference]: Without dead ends: 165 [2022-11-21 13:46:11,598 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-11-21 13:46:11,601 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 160 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:11,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 109 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:46:11,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-21 13:46:11,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2022-11-21 13:46:11,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 101 states have (on average 1.7128712871287128) internal successors, (173), 160 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:11,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2022-11-21 13:46:11,644 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 3 [2022-11-21 13:46:11,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:11,645 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2022-11-21 13:46:11,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:11,645 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2022-11-21 13:46:11,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-21 13:46:11,646 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:11,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-21 13:46:11,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 13:46:11,647 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:46:11,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:11,648 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-21 13:46:11,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:11,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570975263] [2022-11-21 13:46:11,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:11,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:11,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:11,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570975263] [2022-11-21 13:46:11,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570975263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:11,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:11,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:46:11,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716222300] [2022-11-21 13:46:11,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:11,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:46:11,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:11,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:46:11,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:46:11,780 INFO L87 Difference]: Start difference. First operand 161 states and 173 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:11,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:11,957 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2022-11-21 13:46:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:46:11,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-21 13:46:11,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:11,964 INFO L225 Difference]: With dead ends: 155 [2022-11-21 13:46:11,964 INFO L226 Difference]: Without dead ends: 155 [2022-11-21 13:46:11,964 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-11-21 13:46:11,969 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 147 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:11,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 112 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:46:11,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-21 13:46:11,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2022-11-21 13:46:11,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 101 states have (on average 1.603960396039604) internal successors, (162), 150 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:11,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2022-11-21 13:46:11,989 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 3 [2022-11-21 13:46:11,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:11,989 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2022-11-21 13:46:11,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:11,990 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2022-11-21 13:46:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-21 13:46:11,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:11,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:11,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 13:46:11,991 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:46:11,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:11,993 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2022-11-21 13:46:11,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:11,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186609843] [2022-11-21 13:46:11,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:11,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:12,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:12,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:12,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186609843] [2022-11-21 13:46:12,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186609843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:12,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:12,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:46:12,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429363828] [2022-11-21 13:46:12,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:12,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:46:12,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:12,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:46:12,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:46:12,180 INFO L87 Difference]: Start difference. First operand 151 states and 162 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:12,334 INFO L93 Difference]: Finished difference Result 161 states and 171 transitions. [2022-11-21 13:46:12,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:46:12,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-21 13:46:12,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:12,340 INFO L225 Difference]: With dead ends: 161 [2022-11-21 13:46:12,340 INFO L226 Difference]: Without dead ends: 161 [2022-11-21 13:46:12,340 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-11-21 13:46:12,342 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 260 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:12,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 116 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:46:12,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-11-21 13:46:12,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2022-11-21 13:46:12,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 108 states have (on average 1.5555555555555556) internal successors, (168), 152 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:12,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 168 transitions. [2022-11-21 13:46:12,352 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 168 transitions. Word has length 8 [2022-11-21 13:46:12,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:12,352 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 168 transitions. [2022-11-21 13:46:12,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:12,353 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 168 transitions. [2022-11-21 13:46:12,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-21 13:46:12,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:12,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:12,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 13:46:12,354 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:46:12,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:12,355 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2022-11-21 13:46:12,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:12,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824683405] [2022-11-21 13:46:12,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:12,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:12,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:12,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824683405] [2022-11-21 13:46:12,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824683405] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:12,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:12,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:46:12,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674900789] [2022-11-21 13:46:12,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:12,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:46:12,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:12,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:46:12,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:46:12,533 INFO L87 Difference]: Start difference. First operand 153 states and 168 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:12,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:12,752 INFO L93 Difference]: Finished difference Result 244 states and 260 transitions. [2022-11-21 13:46:12,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:46:12,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-21 13:46:12,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:12,754 INFO L225 Difference]: With dead ends: 244 [2022-11-21 13:46:12,754 INFO L226 Difference]: Without dead ends: 244 [2022-11-21 13:46:12,754 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-11-21 13:46:12,756 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 318 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:12,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 184 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:46:12,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-11-21 13:46:12,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 158. [2022-11-21 13:46:12,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 113 states have (on average 1.5309734513274336) internal successors, (173), 157 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:12,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 173 transitions. [2022-11-21 13:46:12,767 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 173 transitions. Word has length 8 [2022-11-21 13:46:12,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:12,767 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 173 transitions. [2022-11-21 13:46:12,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:12,768 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 173 transitions. [2022-11-21 13:46:12,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 13:46:12,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:12,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:12,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 13:46:12,769 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:46:12,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:12,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1837174119, now seen corresponding path program 1 times [2022-11-21 13:46:12,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:12,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734511566] [2022-11-21 13:46:12,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:12,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:12,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:12,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:12,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734511566] [2022-11-21 13:46:12,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734511566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:12,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:12,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:46:12,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308093832] [2022-11-21 13:46:12,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:12,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:46:12,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:12,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:46:12,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:46:12,808 INFO L87 Difference]: Start difference. First operand 158 states and 173 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-11-21 13:46:12,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:12,851 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2022-11-21 13:46:12,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:46:12,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-11-21 13:46:12,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:12,853 INFO L225 Difference]: With dead ends: 148 [2022-11-21 13:46:12,853 INFO L226 Difference]: Without dead ends: 148 [2022-11-21 13:46:12,853 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-11-21 13:46:12,855 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 125 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:12,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:46:12,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-11-21 13:46:12,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-11-21 13:46:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 108 states have (on average 1.5) internal successors, (162), 147 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2022-11-21 13:46:12,863 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 9 [2022-11-21 13:46:12,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:12,863 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2022-11-21 13:46:12,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-11-21 13:46:12,864 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2022-11-21 13:46:12,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 13:46:12,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:12,865 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:12,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 13:46:12,865 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:46:12,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:12,866 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2022-11-21 13:46:12,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:12,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828038137] [2022-11-21 13:46:12,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:12,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:13,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:13,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828038137] [2022-11-21 13:46:13,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828038137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:13,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:13,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:46:13,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473590746] [2022-11-21 13:46:13,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:13,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:46:13,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:13,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:46:13,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:46:13,077 INFO L87 Difference]: Start difference. First operand 148 states and 162 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-11-21 13:46:13,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:13,394 INFO L93 Difference]: Finished difference Result 219 states and 234 transitions. [2022-11-21 13:46:13,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:46:13,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-11-21 13:46:13,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:13,396 INFO L225 Difference]: With dead ends: 219 [2022-11-21 13:46:13,396 INFO L226 Difference]: Without dead ends: 219 [2022-11-21 13:46:13,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:46:13,397 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 110 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:13,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 682 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:46:13,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-11-21 13:46:13,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 147. [2022-11-21 13:46:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 146 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:13,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2022-11-21 13:46:13,410 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 12 [2022-11-21 13:46:13,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:13,410 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2022-11-21 13:46:13,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-11-21 13:46:13,411 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2022-11-21 13:46:13,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 13:46:13,411 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:13,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:13,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 13:46:13,412 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:46:13,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:13,412 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2022-11-21 13:46:13,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:13,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610358944] [2022-11-21 13:46:13,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:13,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:13,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:13,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:13,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610358944] [2022-11-21 13:46:13,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610358944] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:13,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:13,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:46:13,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207398619] [2022-11-21 13:46:13,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:13,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:46:13,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:13,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:46:13,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:46:13,634 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-11-21 13:46:14,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:14,008 INFO L93 Difference]: Finished difference Result 211 states and 228 transitions. [2022-11-21 13:46:14,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 13:46:14,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-11-21 13:46:14,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:14,010 INFO L225 Difference]: With dead ends: 211 [2022-11-21 13:46:14,010 INFO L226 Difference]: Without dead ends: 211 [2022-11-21 13:46:14,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-21 13:46:14,011 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 97 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:14,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 676 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:46:14,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-11-21 13:46:14,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 136. [2022-11-21 13:46:14,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 103 states have (on average 1.4466019417475728) internal successors, (149), 135 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:14,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2022-11-21 13:46:14,017 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 12 [2022-11-21 13:46:14,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:14,018 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2022-11-21 13:46:14,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-11-21 13:46:14,018 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2022-11-21 13:46:14,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 13:46:14,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:14,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:14,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 13:46:14,019 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:46:14,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:14,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1603335132, now seen corresponding path program 1 times [2022-11-21 13:46:14,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:14,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845182045] [2022-11-21 13:46:14,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:14,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:14,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:14,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845182045] [2022-11-21 13:46:14,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845182045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:14,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:14,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:46:14,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280542999] [2022-11-21 13:46:14,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:14,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:46:14,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:14,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:46:14,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:46:14,055 INFO L87 Difference]: Start difference. First operand 136 states and 149 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:14,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:14,084 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2022-11-21 13:46:14,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:46:14,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-21 13:46:14,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:14,086 INFO L225 Difference]: With dead ends: 191 [2022-11-21 13:46:14,086 INFO L226 Difference]: Without dead ends: 191 [2022-11-21 13:46:14,086 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-11-21 13:46:14,087 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 47 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:14,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 250 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:46:14,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-21 13:46:14,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 149. [2022-11-21 13:46:14,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 116 states have (on average 1.4051724137931034) internal successors, (163), 148 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:14,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 163 transitions. [2022-11-21 13:46:14,093 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 163 transitions. Word has length 15 [2022-11-21 13:46:14,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:14,093 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 163 transitions. [2022-11-21 13:46:14,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:14,094 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 163 transitions. [2022-11-21 13:46:14,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 13:46:14,095 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:14,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:14,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 13:46:14,095 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:46:14,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:14,096 INFO L85 PathProgramCache]: Analyzing trace with hash -775737061, now seen corresponding path program 1 times [2022-11-21 13:46:14,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:14,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447725833] [2022-11-21 13:46:14,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:14,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:14,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:14,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:14,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447725833] [2022-11-21 13:46:14,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447725833] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:14,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:14,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:46:14,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468493039] [2022-11-21 13:46:14,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:14,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:46:14,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:14,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:46:14,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:46:14,235 INFO L87 Difference]: Start difference. First operand 149 states and 163 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:14,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:14,392 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2022-11-21 13:46:14,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 13:46:14,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-21 13:46:14,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:14,394 INFO L225 Difference]: With dead ends: 149 [2022-11-21 13:46:14,394 INFO L226 Difference]: Without dead ends: 149 [2022-11-21 13:46:14,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-21 13:46:14,395 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 90 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:14,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 541 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:46:14,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-21 13:46:14,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2022-11-21 13:46:14,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 115 states have (on average 1.4) internal successors, (161), 146 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:14,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2022-11-21 13:46:14,403 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 19 [2022-11-21 13:46:14,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:14,403 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2022-11-21 13:46:14,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:14,404 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2022-11-21 13:46:14,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-21 13:46:14,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:14,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] [2022-11-21 13:46:14,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 13:46:14,405 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:46:14,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:14,406 INFO L85 PathProgramCache]: Analyzing trace with hash 73317399, now seen corresponding path program 1 times [2022-11-21 13:46:14,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:14,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655363620] [2022-11-21 13:46:14,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:14,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:14,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:14,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:14,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655363620] [2022-11-21 13:46:14,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655363620] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:14,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:14,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:46:14,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166379794] [2022-11-21 13:46:14,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:14,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:46:14,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:14,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:46:14,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:46:14,574 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-11-21 13:46:14,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:14,743 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2022-11-21 13:46:14,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:46:14,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-11-21 13:46:14,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:14,745 INFO L225 Difference]: With dead ends: 156 [2022-11-21 13:46:14,745 INFO L226 Difference]: Without dead ends: 156 [2022-11-21 13:46:14,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:46:14,746 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 12 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:14,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 572 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:46:14,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-21 13:46:14,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2022-11-21 13:46:14,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 151 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:14,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2022-11-21 13:46:14,752 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 20 [2022-11-21 13:46:14,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:14,752 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2022-11-21 13:46:14,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-11-21 13:46:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2022-11-21 13:46:14,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 13:46:14,758 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:14,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:14,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 13:46:14,759 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:46:14,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:14,761 INFO L85 PathProgramCache]: Analyzing trace with hash -800612379, now seen corresponding path program 1 times [2022-11-21 13:46:14,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:14,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524425623] [2022-11-21 13:46:14,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:14,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:14,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:14,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:14,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524425623] [2022-11-21 13:46:14,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524425623] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:14,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:14,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:46:14,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484285525] [2022-11-21 13:46:14,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:14,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:46:14,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:14,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:46:14,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:46:14,841 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:14,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:14,957 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2022-11-21 13:46:14,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:46:14,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 13:46:14,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:14,959 INFO L225 Difference]: With dead ends: 152 [2022-11-21 13:46:14,960 INFO L226 Difference]: Without dead ends: 152 [2022-11-21 13:46:14,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:46:14,961 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 125 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:14,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 296 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:46:14,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-21 13:46:14,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-11-21 13:46:14,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.375) internal successors, (165), 151 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2022-11-21 13:46:14,967 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 22 [2022-11-21 13:46:14,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:14,968 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2022-11-21 13:46:14,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:14,968 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2022-11-21 13:46:14,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-21 13:46:14,972 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:14,972 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] [2022-11-21 13:46:14,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 13:46:14,973 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:46:14,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:14,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1089542561, now seen corresponding path program 1 times [2022-11-21 13:46:14,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:14,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218447997] [2022-11-21 13:46:14,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:14,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:15,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:15,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:15,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218447997] [2022-11-21 13:46:15,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218447997] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:46:15,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927984012] [2022-11-21 13:46:15,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:15,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:46:15,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:46:15,226 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:46:15,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 13:46:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:15,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-21 13:46:15,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:46:15,603 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-11-21 13:46:15,610 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-11-21 13:46:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:15,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:46:15,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:15,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927984012] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:46:15,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:46:15,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 11 [2022-11-21 13:46:15,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437362709] [2022-11-21 13:46:15,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:46:15,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 13:46:15,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:15,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 13:46:15,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:46:15,782 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:16,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:16,246 INFO L93 Difference]: Finished difference Result 181 states and 199 transitions. [2022-11-21 13:46:16,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 13:46:16,247 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 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 25 [2022-11-21 13:46:16,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:16,248 INFO L225 Difference]: With dead ends: 181 [2022-11-21 13:46:16,248 INFO L226 Difference]: Without dead ends: 181 [2022-11-21 13:46:16,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-11-21 13:46:16,249 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 163 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:16,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 712 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:46:16,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-21 13:46:16,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 162. [2022-11-21 13:46:16,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 130 states have (on average 1.353846153846154) internal successors, (176), 161 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:16,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 176 transitions. [2022-11-21 13:46:16,257 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 176 transitions. Word has length 25 [2022-11-21 13:46:16,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:16,258 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 176 transitions. [2022-11-21 13:46:16,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:16,258 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 176 transitions. [2022-11-21 13:46:16,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-21 13:46:16,261 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:16,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:16,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 13:46:16,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:46:16,477 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:46:16,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:16,478 INFO L85 PathProgramCache]: Analyzing trace with hash 583917852, now seen corresponding path program 1 times [2022-11-21 13:46:16,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:16,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093964446] [2022-11-21 13:46:16,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:16,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:16,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:16,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093964446] [2022-11-21 13:46:16,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093964446] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:46:16,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224484176] [2022-11-21 13:46:16,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:16,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:46:16,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:46:16,631 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:46:16,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 13:46:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:16,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-21 13:46:16,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:46:16,838 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-11-21 13:46:16,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:16,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:46:16,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:16,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224484176] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:46:16,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:46:16,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-21 13:46:16,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928520774] [2022-11-21 13:46:16,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:46:16,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:46:16,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:16,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:46:16,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:46:16,945 INFO L87 Difference]: Start difference. First operand 162 states and 176 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 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-11-21 13:46:17,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:17,130 INFO L93 Difference]: Finished difference Result 172 states and 185 transitions. [2022-11-21 13:46:17,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:46:17,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 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 26 [2022-11-21 13:46:17,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:17,132 INFO L225 Difference]: With dead ends: 172 [2022-11-21 13:46:17,132 INFO L226 Difference]: Without dead ends: 153 [2022-11-21 13:46:17,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:46:17,133 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 12 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:17,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 378 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:46:17,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-21 13:46:17,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-11-21 13:46:17,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.371900826446281) internal successors, (166), 152 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:17,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 166 transitions. [2022-11-21 13:46:17,138 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 166 transitions. Word has length 26 [2022-11-21 13:46:17,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:17,139 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 166 transitions. [2022-11-21 13:46:17,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 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-11-21 13:46:17,139 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 166 transitions. [2022-11-21 13:46:17,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-21 13:46:17,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:17,143 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-11-21 13:46:17,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 13:46:17,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-21 13:46:17,344 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:46:17,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:17,344 INFO L85 PathProgramCache]: Analyzing trace with hash -370767273, now seen corresponding path program 1 times [2022-11-21 13:46:17,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:17,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183708974] [2022-11-21 13:46:17,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:17,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:17,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:17,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:17,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183708974] [2022-11-21 13:46:17,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183708974] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:46:17,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433175323] [2022-11-21 13:46:17,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:17,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:46:17,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:46:17,739 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:46:17,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 13:46:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:17,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-21 13:46:17,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:46:17,867 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 6 treesize of output 5 [2022-11-21 13:46:17,951 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:46:17,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 13:46:17,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-11-21 13:46:18,127 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:46:18,127 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 1 case distinctions, treesize of input 30 treesize of output 28 [2022-11-21 13:46:18,160 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:46:18,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-21 13:46:18,283 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 24 treesize of output 12 [2022-11-21 13:46:18,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:18,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:46:18,318 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-11-21 13:46:18,331 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-11-21 13:46:18,381 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:46:18,382 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2022-11-21 13:46:18,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:46:18,393 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 33 treesize of output 36 [2022-11-21 13:46:18,397 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 20 treesize of output 18 [2022-11-21 13:46:18,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:18,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433175323] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:46:18,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:46:18,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-11-21 13:46:18,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830425991] [2022-11-21 13:46:18,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:46:18,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-21 13:46:18,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:18,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-21 13:46:18,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=397, Unknown=6, NotChecked=82, Total=552 [2022-11-21 13:46:18,580 INFO L87 Difference]: Start difference. First operand 153 states and 166 transitions. Second operand has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:19,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:19,754 INFO L93 Difference]: Finished difference Result 281 states and 308 transitions. [2022-11-21 13:46:19,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-21 13:46:19,755 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 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-11-21 13:46:19,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:19,756 INFO L225 Difference]: With dead ends: 281 [2022-11-21 13:46:19,756 INFO L226 Difference]: Without dead ends: 281 [2022-11-21 13:46:19,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=199, Invalid=795, Unknown=6, NotChecked=122, Total=1122 [2022-11-21 13:46:19,758 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 535 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 313 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:19,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1456 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1025 Invalid, 1 Unknown, 313 Unchecked, 0.7s Time] [2022-11-21 13:46:19,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-21 13:46:19,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 168. [2022-11-21 13:46:19,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 167 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:19,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 183 transitions. [2022-11-21 13:46:19,763 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 183 transitions. Word has length 29 [2022-11-21 13:46:19,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:19,763 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 183 transitions. [2022-11-21 13:46:19,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:19,763 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 183 transitions. [2022-11-21 13:46:19,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 13:46:19,764 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:19,764 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-11-21 13:46:19,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 13:46:19,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-21 13:46:19,965 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:46:19,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:19,966 INFO L85 PathProgramCache]: Analyzing trace with hash -751968760, now seen corresponding path program 1 times [2022-11-21 13:46:19,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:19,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887396503] [2022-11-21 13:46:19,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:19,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:20,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:20,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:20,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887396503] [2022-11-21 13:46:20,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887396503] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:20,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:20,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:46:20,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961194250] [2022-11-21 13:46:20,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:20,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:46:20,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:20,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:46:20,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:46:20,005 INFO L87 Difference]: Start difference. First operand 168 states and 183 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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-11-21 13:46:20,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:20,031 INFO L93 Difference]: Finished difference Result 239 states and 260 transitions. [2022-11-21 13:46:20,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:46:20,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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-11-21 13:46:20,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:20,032 INFO L225 Difference]: With dead ends: 239 [2022-11-21 13:46:20,032 INFO L226 Difference]: Without dead ends: 239 [2022-11-21 13:46:20,033 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-11-21 13:46:20,033 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 55 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:20,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 245 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:46:20,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-11-21 13:46:20,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 186. [2022-11-21 13:46:20,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 154 states have (on average 1.3051948051948052) internal successors, (201), 185 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:20,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 201 transitions. [2022-11-21 13:46:20,039 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 201 transitions. Word has length 30 [2022-11-21 13:46:20,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:20,039 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 201 transitions. [2022-11-21 13:46:20,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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-11-21 13:46:20,039 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 201 transitions. [2022-11-21 13:46:20,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-21 13:46:20,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:20,040 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, 1, 1, 1, 1, 1] [2022-11-21 13:46:20,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 13:46:20,041 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:46:20,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:20,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1573046208, now seen corresponding path program 1 times [2022-11-21 13:46:20,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:20,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290293036] [2022-11-21 13:46:20,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:20,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:20,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:20,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:20,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290293036] [2022-11-21 13:46:20,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290293036] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:46:20,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816236679] [2022-11-21 13:46:20,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:20,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:46:20,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:46:20,527 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:46:20,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 13:46:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:20,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-21 13:46:20,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:46:20,673 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 6 treesize of output 5 [2022-11-21 13:46:20,760 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 13:46:20,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 13:46:20,817 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-11-21 13:46:20,971 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:46:20,971 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 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-21 13:46:21,016 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:46:21,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-21 13:46:21,235 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 25 treesize of output 13 [2022-11-21 13:46:21,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:21,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:46:21,533 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_413 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_413) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2022-11-21 13:46:21,544 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:46:21,545 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-21 13:46:21,554 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:46:21,554 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 34 treesize of output 37 [2022-11-21 13:46:21,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-21 13:46:25,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:25,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816236679] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:46:25,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:46:25,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 29 [2022-11-21 13:46:25,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107254691] [2022-11-21 13:46:25,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:46:25,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-21 13:46:25,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:25,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-21 13:46:25,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=660, Unknown=12, NotChecked=54, Total=870 [2022-11-21 13:46:25,844 INFO L87 Difference]: Start difference. First operand 186 states and 201 transitions. Second operand has 30 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 30 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:31,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:31,631 INFO L93 Difference]: Finished difference Result 324 states and 351 transitions. [2022-11-21 13:46:31,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-21 13:46:31,632 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 30 states have internal predecessors, (114), 0 states have call successors, (0), 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 39 [2022-11-21 13:46:31,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:31,633 INFO L225 Difference]: With dead ends: 324 [2022-11-21 13:46:31,633 INFO L226 Difference]: Without dead ends: 324 [2022-11-21 13:46:31,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=424, Invalid=1460, Unknown=12, NotChecked=84, Total=1980 [2022-11-21 13:46:31,635 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 781 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 223 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:31,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 1178 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 996 Invalid, 0 Unknown, 223 Unchecked, 1.0s Time] [2022-11-21 13:46:31,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-11-21 13:46:31,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 197. [2022-11-21 13:46:31,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 165 states have (on average 1.309090909090909) internal successors, (216), 196 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:31,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 216 transitions. [2022-11-21 13:46:31,640 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 216 transitions. Word has length 39 [2022-11-21 13:46:31,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:31,641 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 216 transitions. [2022-11-21 13:46:31,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 30 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:31,641 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 216 transitions. [2022-11-21 13:46:31,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-21 13:46:31,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:31,641 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, 1, 1, 1, 1, 1] [2022-11-21 13:46:31,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 13:46:31,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-21 13:46:31,842 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:46:31,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:31,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1573046209, now seen corresponding path program 1 times [2022-11-21 13:46:31,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:31,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24867541] [2022-11-21 13:46:31,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:31,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:32,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:32,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:32,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24867541] [2022-11-21 13:46:32,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24867541] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:46:32,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127476800] [2022-11-21 13:46:32,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:32,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:46:32,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:46:32,522 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:46:32,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 13:46:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:32,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-21 13:46:32,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:46:32,696 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 6 treesize of output 5 [2022-11-21 13:46:32,849 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:46:32,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 13:46:32,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-21 13:46:32,940 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-11-21 13:46:32,955 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-11-21 13:46:33,165 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 13:46:33,166 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-21 13:46:33,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 13:46:33,192 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:46:33,193 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 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-21 13:46:33,275 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:46:33,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-21 13:46:33,283 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 18 treesize of output 20 [2022-11-21 13:46:33,537 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 25 treesize of output 13 [2022-11-21 13:46:33,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-11-21 13:46:33,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:33,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:46:33,946 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_491 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-11-21 13:46:33,978 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_491 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4)))) is different from false [2022-11-21 13:46:33,993 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_491 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4))) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2022-11-21 13:46:34,013 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:46:34,013 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-21 13:46:34,028 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:46:34,029 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 34 treesize of output 37 [2022-11-21 13:46:34,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-21 13:46:34,057 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:46:34,058 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-11-21 13:46:34,066 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:46:34,066 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-21 13:46:34,070 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:46:34,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-21 13:46:34,080 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:46:34,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-11-21 13:46:34,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:34,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127476800] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:46:34,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:46:34,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 31 [2022-11-21 13:46:34,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504827147] [2022-11-21 13:46:34,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:46:34,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-21 13:46:34,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:34,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-21 13:46:34,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=722, Unknown=3, NotChecked=168, Total=992 [2022-11-21 13:46:34,281 INFO L87 Difference]: Start difference. First operand 197 states and 216 transitions. Second operand has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:39,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:39,748 INFO L93 Difference]: Finished difference Result 331 states and 358 transitions. [2022-11-21 13:46:39,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-21 13:46:39,749 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 0 states have call successors, (0), 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 39 [2022-11-21 13:46:39,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:39,751 INFO L225 Difference]: With dead ends: 331 [2022-11-21 13:46:39,751 INFO L226 Difference]: Without dead ends: 331 [2022-11-21 13:46:39,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=400, Invalid=2059, Unknown=3, NotChecked=294, Total=2756 [2022-11-21 13:46:39,753 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 455 mSDsluCounter, 1723 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 57 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 2303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 517 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:39,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1825 Invalid, 2303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1728 Invalid, 1 Unknown, 517 Unchecked, 1.7s Time] [2022-11-21 13:46:39,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-11-21 13:46:39,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 201. [2022-11-21 13:46:39,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 169 states have (on average 1.301775147928994) internal successors, (220), 200 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 220 transitions. [2022-11-21 13:46:39,759 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 220 transitions. Word has length 39 [2022-11-21 13:46:39,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:39,761 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 220 transitions. [2022-11-21 13:46:39,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:39,761 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 220 transitions. [2022-11-21 13:46:39,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-21 13:46:39,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:39,762 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, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:39,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 13:46:39,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-21 13:46:39,969 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:46:39,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:39,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1519790839, now seen corresponding path program 1 times [2022-11-21 13:46:39,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:39,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677334222] [2022-11-21 13:46:39,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:39,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:40,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 13:46:40,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:40,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677334222] [2022-11-21 13:46:40,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677334222] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:40,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:40,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:46:40,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409976081] [2022-11-21 13:46:40,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:40,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:46:40,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:40,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:46:40,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:46:40,013 INFO L87 Difference]: Start difference. First operand 201 states and 220 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:40,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:40,023 INFO L93 Difference]: Finished difference Result 202 states and 220 transitions. [2022-11-21 13:46:40,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:46:40,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 40 [2022-11-21 13:46:40,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:40,025 INFO L225 Difference]: With dead ends: 202 [2022-11-21 13:46:40,025 INFO L226 Difference]: Without dead ends: 202 [2022-11-21 13:46:40,025 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-11-21 13:46:40,026 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:40,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:46:40,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-11-21 13:46:40,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2022-11-21 13:46:40,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 170 states have (on average 1.2941176470588236) internal successors, (220), 201 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:40,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 220 transitions. [2022-11-21 13:46:40,032 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 220 transitions. Word has length 40 [2022-11-21 13:46:40,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:40,032 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 220 transitions. [2022-11-21 13:46:40,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:40,033 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 220 transitions. [2022-11-21 13:46:40,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-21 13:46:40,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:40,034 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:40,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-21 13:46:40,034 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:46:40,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:40,035 INFO L85 PathProgramCache]: Analyzing trace with hash 231761564, now seen corresponding path program 1 times [2022-11-21 13:46:40,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:40,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335406047] [2022-11-21 13:46:40,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:40,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:41,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:41,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:41,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335406047] [2022-11-21 13:46:41,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335406047] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:46:41,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366741001] [2022-11-21 13:46:41,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:41,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:46:41,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:46:41,091 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:46:41,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 13:46:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:41,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-21 13:46:41,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:46:41,222 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 6 treesize of output 5 [2022-11-21 13:46:41,271 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:46:41,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 13:46:41,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-21 13:46:41,341 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-11-21 13:46:41,357 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-11-21 13:46:41,568 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:46:41,569 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 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-21 13:46:41,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:46:41,589 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 14 treesize of output 16 [2022-11-21 13:46:41,719 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:46:41,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 63 [2022-11-21 13:46:41,731 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 21 treesize of output 13 [2022-11-21 13:46:41,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 9 [2022-11-21 13:46:41,761 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 18 treesize of output 20 [2022-11-21 13:46:42,258 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 29 treesize of output 17 [2022-11-21 13:46:42,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-11-21 13:46:42,466 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:46:42,469 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:46:42,469 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 17 treesize of output 10 [2022-11-21 13:46:42,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:42,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:46:42,753 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 72 treesize of output 52 [2022-11-21 13:46:43,316 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:46:43,317 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-21 13:46:43,329 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:46:43,330 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 38 treesize of output 41 [2022-11-21 13:46:43,353 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 9 treesize of output 7 [2022-11-21 13:46:43,366 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:46:43,366 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-11-21 13:46:43,370 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:46:43,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:46:43,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:46:43,375 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 16 treesize of output 8 [2022-11-21 13:46:43,390 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:46:43,391 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 1 [2022-11-21 13:46:43,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:43,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366741001] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:46:43,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:46:43,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 37 [2022-11-21 13:46:43,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894390267] [2022-11-21 13:46:43,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:46:43,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-21 13:46:43,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:43,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-21 13:46:43,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2022-11-21 13:46:43,613 INFO L87 Difference]: Start difference. First operand 202 states and 220 transitions. Second operand has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 37 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:48,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:48,046 INFO L93 Difference]: Finished difference Result 332 states and 357 transitions. [2022-11-21 13:46:48,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-21 13:46:48,051 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 37 states have internal predecessors, (116), 0 states have call successors, (0), 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 42 [2022-11-21 13:46:48,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:48,052 INFO L225 Difference]: With dead ends: 332 [2022-11-21 13:46:48,052 INFO L226 Difference]: Without dead ends: 332 [2022-11-21 13:46:48,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=502, Invalid=3158, Unknown=0, NotChecked=0, Total=3660 [2022-11-21 13:46:48,054 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 1123 mSDsluCounter, 1937 mSDsCounter, 0 mSdLazyCounter, 1874 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 2026 SdHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:48,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 2026 Invalid, 1925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1874 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-21 13:46:48,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-11-21 13:46:48,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 201. [2022-11-21 13:46:48,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 169 states have (on average 1.2899408284023668) internal successors, (218), 200 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:48,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 218 transitions. [2022-11-21 13:46:48,060 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 218 transitions. Word has length 42 [2022-11-21 13:46:48,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:48,061 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 218 transitions. [2022-11-21 13:46:48,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 37 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:48,061 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 218 transitions. [2022-11-21 13:46:48,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-21 13:46:48,062 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:48,062 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:48,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 13:46:48,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:46:48,268 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:46:48,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:48,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1588995560, now seen corresponding path program 1 times [2022-11-21 13:46:48,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:48,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203179261] [2022-11-21 13:46:48,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:48,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:48,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:48,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203179261] [2022-11-21 13:46:48,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203179261] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:46:48,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307617601] [2022-11-21 13:46:48,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:48,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:46:48,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:46:48,778 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:46:48,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 13:46:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-21 13:46:48,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:46:48,912 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 6 treesize of output 5 [2022-11-21 13:46:49,049 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 13:46:49,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 13:46:49,114 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-11-21 13:46:49,363 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:46:49,364 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 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-21 13:46:49,411 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:46:49,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-21 13:46:49,765 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 25 treesize of output 13 [2022-11-21 13:46:49,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-21 13:46:49,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:49,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:46:50,110 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_681 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((v_ArrVal_681 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-11-21 13:46:50,233 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_681 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((v_ArrVal_681 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)))) is different from false [2022-11-21 13:46:50,259 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:46:50,260 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2022-11-21 13:46:50,271 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:46:50,272 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 33 treesize of output 36 [2022-11-21 13:46:50,277 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 20 treesize of output 18 [2022-11-21 13:46:50,307 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:46:50,308 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-21 13:46:50,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:46:50,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-11-21 13:46:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:50,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307617601] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:46:50,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:46:50,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2022-11-21 13:46:50,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177858197] [2022-11-21 13:46:50,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:46:50,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-21 13:46:50,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:50,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-21 13:46:50,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=576, Unknown=13, NotChecked=102, Total=812 [2022-11-21 13:46:50,492 INFO L87 Difference]: Start difference. First operand 201 states and 218 transitions. Second operand has 29 states, 28 states have (on average 3.642857142857143) internal successors, (102), 29 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:53,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:53,593 INFO L93 Difference]: Finished difference Result 248 states and 269 transitions. [2022-11-21 13:46:53,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 13:46:53,594 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.642857142857143) internal successors, (102), 29 states have internal predecessors, (102), 0 states have call successors, (0), 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 44 [2022-11-21 13:46:53,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:53,595 INFO L225 Difference]: With dead ends: 248 [2022-11-21 13:46:53,595 INFO L226 Difference]: Without dead ends: 248 [2022-11-21 13:46:53,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=188, Invalid=797, Unknown=15, NotChecked=122, Total=1122 [2022-11-21 13:46:53,596 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 384 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 41 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 287 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:53,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1096 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 900 Invalid, 2 Unknown, 287 Unchecked, 0.8s Time] [2022-11-21 13:46:53,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-11-21 13:46:53,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 224. [2022-11-21 13:46:53,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 192 states have (on average 1.3125) internal successors, (252), 223 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:53,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 252 transitions. [2022-11-21 13:46:53,601 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 252 transitions. Word has length 44 [2022-11-21 13:46:53,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:53,601 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 252 transitions. [2022-11-21 13:46:53,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.642857142857143) internal successors, (102), 29 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:53,602 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 252 transitions. [2022-11-21 13:46:53,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-21 13:46:53,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:53,602 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:53,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 13:46:53,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:46:53,809 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:46:53,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:53,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1588995559, now seen corresponding path program 1 times [2022-11-21 13:46:53,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:53,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117953295] [2022-11-21 13:46:53,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:53,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:54,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:54,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:54,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117953295] [2022-11-21 13:46:54,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117953295] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:46:54,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445144889] [2022-11-21 13:46:54,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:54,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:46:54,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:46:54,372 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:46:54,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 13:46:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:54,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-21 13:46:54,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:46:54,536 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 6 treesize of output 5 [2022-11-21 13:46:54,637 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 6 treesize of output 5 [2022-11-21 13:46:54,662 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:46:54,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 13:46:54,715 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-11-21 13:46:54,731 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-11-21 13:46:54,937 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 13:46:54,938 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-21 13:46:54,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 13:46:54,969 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:46:54,969 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 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-21 13:46:55,051 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:46:55,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-21 13:46:55,061 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 18 treesize of output 20 [2022-11-21 13:46:55,459 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 25 treesize of output 13 [2022-11-21 13:46:55,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-11-21 13:46:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:55,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:46:55,926 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_761 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-11-21 13:46:55,961 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_761 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-11-21 13:46:56,132 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:46:56,132 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-11-21 13:46:56,140 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:46:56,141 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-21 13:46:56,156 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:46:56,156 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 52 treesize of output 55 [2022-11-21 13:46:56,177 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:46:56,177 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 82 treesize of output 81 [2022-11-21 13:46:56,185 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 34 treesize of output 30 [2022-11-21 13:46:56,192 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 62 treesize of output 58 [2022-11-21 13:46:56,273 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:46:56,273 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-11-21 13:46:56,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:46:56,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-21 13:46:56,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:56,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445144889] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:46:56,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:46:56,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 29 [2022-11-21 13:46:56,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451909282] [2022-11-21 13:46:56,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:46:56,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-21 13:46:56,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:56,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-21 13:46:56,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=658, Unknown=11, NotChecked=106, Total=870 [2022-11-21 13:46:56,500 INFO L87 Difference]: Start difference. First operand 224 states and 252 transitions. Second operand has 30 states, 29 states have (on average 4.482758620689655) internal successors, (130), 30 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:58,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:58,256 INFO L93 Difference]: Finished difference Result 247 states and 268 transitions. [2022-11-21 13:46:58,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-21 13:46:58,257 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.482758620689655) internal successors, (130), 30 states have internal predecessors, (130), 0 states have call successors, (0), 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 44 [2022-11-21 13:46:58,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:58,258 INFO L225 Difference]: With dead ends: 247 [2022-11-21 13:46:58,258 INFO L226 Difference]: Without dead ends: 247 [2022-11-21 13:46:58,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=299, Invalid=1258, Unknown=11, NotChecked=154, Total=1722 [2022-11-21 13:46:58,259 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 452 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 324 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:58,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 975 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 872 Invalid, 0 Unknown, 324 Unchecked, 0.9s Time] [2022-11-21 13:46:58,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-11-21 13:46:58,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 224. [2022-11-21 13:46:58,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 192 states have (on average 1.3072916666666667) internal successors, (251), 223 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:58,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 251 transitions. [2022-11-21 13:46:58,265 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 251 transitions. Word has length 44 [2022-11-21 13:46:58,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:58,265 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 251 transitions. [2022-11-21 13:46:58,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.482758620689655) internal successors, (130), 30 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:58,266 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 251 transitions. [2022-11-21 13:46:58,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-21 13:46:58,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:58,267 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:58,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 13:46:58,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-21 13:46:58,468 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:46:58,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:58,468 INFO L85 PathProgramCache]: Analyzing trace with hash -64101254, now seen corresponding path program 1 times [2022-11-21 13:46:58,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:58,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900363239] [2022-11-21 13:46:58,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:58,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 13:46:58,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:58,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900363239] [2022-11-21 13:46:58,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900363239] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:58,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:58,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:46:58,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919116217] [2022-11-21 13:46:58,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:58,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:46:58,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:58,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:46:58,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:46:58,526 INFO L87 Difference]: Start difference. First operand 224 states and 251 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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-11-21 13:46:58,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:58,570 INFO L93 Difference]: Finished difference Result 298 states and 331 transitions. [2022-11-21 13:46:58,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:46:58,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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 44 [2022-11-21 13:46:58,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:58,572 INFO L225 Difference]: With dead ends: 298 [2022-11-21 13:46:58,572 INFO L226 Difference]: Without dead ends: 298 [2022-11-21 13:46:58,572 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-11-21 13:46:58,574 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 64 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:58,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 282 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:46:58,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-11-21 13:46:58,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 242. [2022-11-21 13:46:58,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 210 states have (on average 1.2857142857142858) internal successors, (270), 241 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:58,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 270 transitions. [2022-11-21 13:46:58,580 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 270 transitions. Word has length 44 [2022-11-21 13:46:58,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:58,580 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 270 transitions. [2022-11-21 13:46:58,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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-11-21 13:46:58,581 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 270 transitions. [2022-11-21 13:46:58,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-21 13:46:58,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:58,582 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:58,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-21 13:46:58,582 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:46:58,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:58,583 INFO L85 PathProgramCache]: Analyzing trace with hash -2014223229, now seen corresponding path program 1 times [2022-11-21 13:46:58,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:58,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672599303] [2022-11-21 13:46:58,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:58,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 13:46:58,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:58,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672599303] [2022-11-21 13:46:58,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672599303] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:46:58,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939412239] [2022-11-21 13:46:58,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:58,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:46:58,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:46:58,765 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:46:58,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 13:46:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:58,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-21 13:46:58,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:46:59,006 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 25 treesize of output 17 [2022-11-21 13:46:59,010 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 21 treesize of output 13 [2022-11-21 13:46:59,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 13:46:59,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:46:59,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 13:46:59,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939412239] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:46:59,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:46:59,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2022-11-21 13:46:59,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337480239] [2022-11-21 13:46:59,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:46:59,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:46:59,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:59,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:46:59,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:46:59,169 INFO L87 Difference]: Start difference. First operand 242 states and 270 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:59,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:59,366 INFO L93 Difference]: Finished difference Result 283 states and 314 transitions. [2022-11-21 13:46:59,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:46:59,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 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 45 [2022-11-21 13:46:59,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:59,368 INFO L225 Difference]: With dead ends: 283 [2022-11-21 13:46:59,368 INFO L226 Difference]: Without dead ends: 275 [2022-11-21 13:46:59,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:46:59,369 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 194 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:59,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 349 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:46:59,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-21 13:46:59,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 269. [2022-11-21 13:46:59,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 237 states have (on average 1.2827004219409284) internal successors, (304), 268 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:59,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 304 transitions. [2022-11-21 13:46:59,375 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 304 transitions. Word has length 45 [2022-11-21 13:46:59,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:59,376 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 304 transitions. [2022-11-21 13:46:59,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:59,376 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 304 transitions. [2022-11-21 13:46:59,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-21 13:46:59,377 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:59,377 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:59,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-21 13:46:59,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-21 13:46:59,583 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:46:59,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:59,584 INFO L85 PathProgramCache]: Analyzing trace with hash 164743237, now seen corresponding path program 1 times [2022-11-21 13:46:59,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:59,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358062284] [2022-11-21 13:46:59,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:59,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:00,470 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:00,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:00,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358062284] [2022-11-21 13:47:00,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358062284] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:47:00,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325740763] [2022-11-21 13:47:00,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:00,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:00,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:47:00,472 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:47:00,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 13:47:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:00,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-21 13:47:00,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:47:00,658 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 6 treesize of output 5 [2022-11-21 13:47:00,780 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:47:00,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 13:47:00,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-11-21 13:47:01,061 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:47:01,061 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 1 case distinctions, treesize of input 30 treesize of output 28 [2022-11-21 13:47:01,103 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:47:01,103 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 1 case distinctions, treesize of input 30 treesize of output 28 [2022-11-21 13:47:01,221 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:47:01,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 13:47:01,294 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-21 13:47:01,294 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 1 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 13:47:01,553 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-21 13:47:01,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 48 [2022-11-21 13:47:01,573 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 12 treesize of output 8 [2022-11-21 13:47:01,730 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-21 13:47:01,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 55 [2022-11-21 13:47:01,914 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 24 treesize of output 12 [2022-11-21 13:47:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:01,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:47:02,042 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-11-21 13:47:02,049 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-11-21 13:47:02,272 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:02,272 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 13:47:02,281 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_14 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_14) .cse0 v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))))) is different from false [2022-11-21 13:47:02,391 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_68| Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_1003 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_14 |v_ULTIMATE.start_main_~item~0#1.offset_68|))) (or (not (= 0 (select |c_#valid| .cse0))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_arrayElimArr_14) .cse0 v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))))) is different from false [2022-11-21 13:47:02,413 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:02,414 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-21 13:47:02,427 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:02,427 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 73 treesize of output 76 [2022-11-21 13:47:02,442 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:02,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 65 [2022-11-21 13:47:02,449 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 50 treesize of output 46 [2022-11-21 13:47:02,465 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 13:47:02,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-21 13:47:02,767 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-21 13:47:02,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325740763] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:47:02,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:47:02,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 40 [2022-11-21 13:47:02,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760289656] [2022-11-21 13:47:02,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:47:02,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-21 13:47:02,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:02,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-21 13:47:02,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1098, Unknown=15, NotChecked=284, Total=1560 [2022-11-21 13:47:02,770 INFO L87 Difference]: Start difference. First operand 269 states and 304 transitions. Second operand has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:08,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:08,435 INFO L93 Difference]: Finished difference Result 306 states and 342 transitions. [2022-11-21 13:47:08,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-21 13:47:08,436 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 0 states have call successors, (0), 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 45 [2022-11-21 13:47:08,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:08,437 INFO L225 Difference]: With dead ends: 306 [2022-11-21 13:47:08,437 INFO L226 Difference]: Without dead ends: 306 [2022-11-21 13:47:08,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1187 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=810, Invalid=3875, Unknown=23, NotChecked=548, Total=5256 [2022-11-21 13:47:08,439 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 876 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 2290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 711 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:08,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 1420 Invalid, 2290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1441 Invalid, 0 Unknown, 711 Unchecked, 1.6s Time] [2022-11-21 13:47:08,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-21 13:47:08,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 267. [2022-11-21 13:47:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 236 states have (on average 1.2796610169491525) internal successors, (302), 266 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:08,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 302 transitions. [2022-11-21 13:47:08,464 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 302 transitions. Word has length 45 [2022-11-21 13:47:08,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:08,465 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 302 transitions. [2022-11-21 13:47:08,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:08,465 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 302 transitions. [2022-11-21 13:47:08,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-21 13:47:08,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:08,466 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2022-11-21 13:47:08,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-21 13:47:08,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-21 13:47:08,673 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:47:08,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:08,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1983636472, now seen corresponding path program 1 times [2022-11-21 13:47:08,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:08,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898676182] [2022-11-21 13:47:08,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:08,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:09,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:09,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898676182] [2022-11-21 13:47:09,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898676182] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:47:09,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960769643] [2022-11-21 13:47:09,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:09,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:09,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:47:09,041 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:47:09,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-21 13:47:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-21 13:47:09,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:47:09,204 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 6 treesize of output 5 [2022-11-21 13:47:09,290 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:47:09,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 13:47:09,337 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-11-21 13:47:09,345 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-11-21 13:47:09,396 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 16 treesize of output 8 [2022-11-21 13:47:09,472 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 14 treesize of output 16 [2022-11-21 13:47:09,491 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 14 treesize of output 16 [2022-11-21 13:47:09,648 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-11-21 13:47:09,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:09,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:47:09,741 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1080 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1080) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) is different from false [2022-11-21 13:47:09,754 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1080 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1080) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) is different from false [2022-11-21 13:47:09,762 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1080 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1080) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) is different from false [2022-11-21 13:47:09,773 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:09,774 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-11-21 13:47:09,785 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:09,785 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 30 treesize of output 33 [2022-11-21 13:47:09,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 13:47:09,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:09,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960769643] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:47:09,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:47:09,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 24 [2022-11-21 13:47:09,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260930525] [2022-11-21 13:47:09,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:47:09,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-21 13:47:09,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:09,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-21 13:47:09,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=385, Unknown=3, NotChecked=126, Total=600 [2022-11-21 13:47:09,925 INFO L87 Difference]: Start difference. First operand 267 states and 302 transitions. Second operand has 25 states, 24 states have (on average 4.0) internal successors, (96), 25 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:10,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:10,964 INFO L93 Difference]: Finished difference Result 285 states and 315 transitions. [2022-11-21 13:47:10,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-21 13:47:10,964 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.0) internal successors, (96), 25 states have internal predecessors, (96), 0 states have call successors, (0), 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 46 [2022-11-21 13:47:10,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:10,966 INFO L225 Difference]: With dead ends: 285 [2022-11-21 13:47:10,966 INFO L226 Difference]: Without dead ends: 285 [2022-11-21 13:47:10,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=263, Invalid=868, Unknown=3, NotChecked=198, Total=1332 [2022-11-21 13:47:10,967 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 758 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 31 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 545 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:10,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 1068 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 786 Invalid, 5 Unknown, 545 Unchecked, 0.7s Time] [2022-11-21 13:47:10,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-11-21 13:47:10,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 269. [2022-11-21 13:47:10,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 238 states have (on average 1.2773109243697478) internal successors, (304), 268 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:10,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 304 transitions. [2022-11-21 13:47:10,974 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 304 transitions. Word has length 46 [2022-11-21 13:47:10,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:10,974 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 304 transitions. [2022-11-21 13:47:10,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.0) internal successors, (96), 25 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:10,975 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 304 transitions. [2022-11-21 13:47:10,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-21 13:47:10,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:10,975 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2022-11-21 13:47:10,985 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-21 13:47:11,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-21 13:47:11,183 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:47:11,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:11,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1363188935, now seen corresponding path program 1 times [2022-11-21 13:47:11,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:11,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334619277] [2022-11-21 13:47:11,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:11,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:11,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:11,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334619277] [2022-11-21 13:47:11,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334619277] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:47:11,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779130784] [2022-11-21 13:47:11,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:11,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:11,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:47:11,590 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:47:11,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-21 13:47:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:11,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-21 13:47:11,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:47:11,769 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 6 treesize of output 5 [2022-11-21 13:47:11,874 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:47:11,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 13:47:11,929 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-11-21 13:47:12,099 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:47:12,108 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 1 case distinctions, treesize of input 29 treesize of output 27 [2022-11-21 13:47:12,151 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:47:12,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-21 13:47:12,385 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 23 treesize of output 11 [2022-11-21 13:47:12,417 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:12,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:47:12,635 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1155 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1155) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-11-21 13:47:12,643 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1155 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1155) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-11-21 13:47:12,655 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:12,655 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-21 13:47:12,667 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:12,667 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 34 treesize of output 37 [2022-11-21 13:47:12,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-21 13:47:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:12,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779130784] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:47:12,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:47:12,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2022-11-21 13:47:12,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736459084] [2022-11-21 13:47:12,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:47:12,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-21 13:47:12,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:12,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-21 13:47:12,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=390, Unknown=6, NotChecked=82, Total=552 [2022-11-21 13:47:12,818 INFO L87 Difference]: Start difference. First operand 269 states and 304 transitions. Second operand has 24 states, 23 states have (on average 4.217391304347826) internal successors, (97), 24 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:14,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:14,220 INFO L93 Difference]: Finished difference Result 281 states and 311 transitions. [2022-11-21 13:47:14,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 13:47:14,221 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.217391304347826) internal successors, (97), 24 states have internal predecessors, (97), 0 states have call successors, (0), 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 47 [2022-11-21 13:47:14,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:14,222 INFO L225 Difference]: With dead ends: 281 [2022-11-21 13:47:14,222 INFO L226 Difference]: Without dead ends: 281 [2022-11-21 13:47:14,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=260, Invalid=925, Unknown=13, NotChecked=134, Total=1332 [2022-11-21 13:47:14,224 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 759 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:14,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 997 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 804 Invalid, 1 Unknown, 389 Unchecked, 0.8s Time] [2022-11-21 13:47:14,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-21 13:47:14,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 270. [2022-11-21 13:47:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 239 states have (on average 1.2761506276150627) internal successors, (305), 269 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 305 transitions. [2022-11-21 13:47:14,232 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 305 transitions. Word has length 47 [2022-11-21 13:47:14,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:14,233 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 305 transitions. [2022-11-21 13:47:14,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.217391304347826) internal successors, (97), 24 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:14,233 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 305 transitions. [2022-11-21 13:47:14,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-21 13:47:14,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:14,234 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-21 13:47:14,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-21 13:47:14,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-21 13:47:14,441 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:47:14,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:14,441 INFO L85 PathProgramCache]: Analyzing trace with hash -595406900, now seen corresponding path program 1 times [2022-11-21 13:47:14,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:14,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396372297] [2022-11-21 13:47:14,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:14,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:15,122 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:15,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:15,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396372297] [2022-11-21 13:47:15,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396372297] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:47:15,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374735539] [2022-11-21 13:47:15,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:15,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:15,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:47:15,127 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:47:15,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-21 13:47:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:15,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-21 13:47:15,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:47:15,313 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 6 treesize of output 5 [2022-11-21 13:47:15,415 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:47:15,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 13:47:15,460 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-11-21 13:47:15,636 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:47:15,636 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 1 case distinctions, treesize of input 22 treesize of output 22 [2022-11-21 13:47:15,668 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:47:15,668 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 1 case distinctions, treesize of input 22 treesize of output 22 [2022-11-21 13:47:15,770 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:47:15,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 13:47:15,836 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-21 13:47:15,836 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 1 case distinctions, treesize of input 27 treesize of output 22 [2022-11-21 13:47:16,081 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-21 13:47:16,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2022-11-21 13:47:16,094 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 12 treesize of output 8 [2022-11-21 13:47:16,239 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-21 13:47:16,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2022-11-21 13:47:16,273 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 16 treesize of output 12 [2022-11-21 13:47:16,447 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 25 treesize of output 13 [2022-11-21 13:47:16,450 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:16,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:47:16,588 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1272 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1272) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2022-11-21 13:47:16,595 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1272 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1272) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2022-11-21 13:47:16,614 INFO L321 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2022-11-21 13:47:16,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-11-21 13:47:16,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:16,849 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-11-21 13:47:17,105 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:17,105 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-21 13:47:17,120 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:17,120 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 134 treesize of output 133 [2022-11-21 13:47:17,129 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 118 treesize of output 110 [2022-11-21 13:47:17,154 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:17,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 108 [2022-11-21 13:47:17,171 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 13:47:17,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-21 13:47:17,375 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-21 13:47:17,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374735539] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:47:17,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:47:17,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 37 [2022-11-21 13:47:17,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701110187] [2022-11-21 13:47:17,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:47:17,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-21 13:47:17,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:17,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-21 13:47:17,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1096, Unknown=23, NotChecked=138, Total=1406 [2022-11-21 13:47:17,379 INFO L87 Difference]: Start difference. First operand 270 states and 305 transitions. Second operand has 38 states, 37 states have (on average 3.2432432432432434) internal successors, (120), 38 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:22,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:22,385 INFO L93 Difference]: Finished difference Result 339 states and 380 transitions. [2022-11-21 13:47:22,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-21 13:47:22,385 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.2432432432432434) internal successors, (120), 38 states have internal predecessors, (120), 0 states have call successors, (0), 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 47 [2022-11-21 13:47:22,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:22,387 INFO L225 Difference]: With dead ends: 339 [2022-11-21 13:47:22,387 INFO L226 Difference]: Without dead ends: 339 [2022-11-21 13:47:22,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=513, Invalid=2664, Unknown=23, NotChecked=222, Total=3422 [2022-11-21 13:47:22,389 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 429 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 323 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:22,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1613 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1542 Invalid, 0 Unknown, 323 Unchecked, 1.5s Time] [2022-11-21 13:47:22,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-11-21 13:47:22,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 296. [2022-11-21 13:47:22,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 265 states have (on average 1.2566037735849056) internal successors, (333), 295 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:22,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 333 transitions. [2022-11-21 13:47:22,395 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 333 transitions. Word has length 47 [2022-11-21 13:47:22,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:22,396 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 333 transitions. [2022-11-21 13:47:22,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.2432432432432434) internal successors, (120), 38 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:22,396 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 333 transitions. [2022-11-21 13:47:22,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-21 13:47:22,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:22,397 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-21 13:47:22,410 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-21 13:47:22,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:22,610 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:47:22,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:22,611 INFO L85 PathProgramCache]: Analyzing trace with hash -595406899, now seen corresponding path program 1 times [2022-11-21 13:47:22,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:22,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639171314] [2022-11-21 13:47:22,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:22,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:23,569 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:23,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:23,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639171314] [2022-11-21 13:47:23,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639171314] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:47:23,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624948898] [2022-11-21 13:47:23,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:23,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:23,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:47:23,571 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:47:23,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-21 13:47:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:23,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-21 13:47:23,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:47:23,748 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 6 treesize of output 5 [2022-11-21 13:47:23,860 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:47:23,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 13:47:23,911 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-11-21 13:47:23,922 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-11-21 13:47:24,132 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 13:47:24,133 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-21 13:47:24,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 13:47:24,166 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:47:24,166 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 1 case distinctions, treesize of input 22 treesize of output 22 [2022-11-21 13:47:24,267 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 13:47:24,267 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-21 13:47:24,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 13:47:24,291 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:47:24,291 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 1 case distinctions, treesize of input 22 treesize of output 22 [2022-11-21 13:47:24,412 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:47:24,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 13:47:24,485 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 13:47:24,485 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-21 13:47:24,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 13:47:24,519 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-21 13:47:24,519 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 1 case distinctions, treesize of input 27 treesize of output 22 [2022-11-21 13:47:24,799 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 13:47:24,799 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-21 13:47:24,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 13:47:24,843 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-21 13:47:24,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 51 [2022-11-21 13:47:24,870 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 12 treesize of output 8 [2022-11-21 13:47:25,127 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-21 13:47:25,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 69 [2022-11-21 13:47:25,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:47:25,138 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 14 treesize of output 16 [2022-11-21 13:47:25,179 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 13:47:25,399 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 25 treesize of output 13 [2022-11-21 13:47:25,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-11-21 13:47:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:25,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:47:25,702 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1396) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1395) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1396 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1396) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-11-21 13:47:25,714 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_1396 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1396) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1395 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1396) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1395) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2022-11-21 13:47:25,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:25,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2022-11-21 13:47:25,780 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_prenex_2) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 1))) (forall ((v_ArrVal_1396 (Array Int Int)) (v_ArrVal_1392 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1392) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1396) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_1395 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1395) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))) is different from false [2022-11-21 13:47:26,088 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:26,089 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-11-21 13:47:26,819 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:26,819 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 86 [2022-11-21 13:47:26,828 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:26,829 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 78 [2022-11-21 13:47:26,847 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:26,847 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 216 treesize of output 211 [2022-11-21 13:47:26,858 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 195 treesize of output 191 [2022-11-21 13:47:26,866 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 191 treesize of output 187 [2022-11-21 13:47:26,873 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 187 treesize of output 179 [2022-11-21 13:47:26,881 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 179 treesize of output 177 [2022-11-21 13:47:26,899 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:26,900 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 230 treesize of output 233 [2022-11-21 13:47:26,910 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 217 treesize of output 213 [2022-11-21 13:47:26,928 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:26,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 210 [2022-11-21 13:47:26,974 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:26,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 208 treesize of output 248 [2022-11-21 13:47:27,718 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-21 13:47:27,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624948898] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:47:27,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:47:27,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 42 [2022-11-21 13:47:27,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46325604] [2022-11-21 13:47:27,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:47:27,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-21 13:47:27,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:27,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-21 13:47:27,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1372, Unknown=20, NotChecked=234, Total=1806 [2022-11-21 13:47:27,720 INFO L87 Difference]: Start difference. First operand 296 states and 333 transitions. Second operand has 43 states, 42 states have (on average 3.2857142857142856) internal successors, (138), 43 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:33,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:33,357 INFO L93 Difference]: Finished difference Result 335 states and 376 transitions. [2022-11-21 13:47:33,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-21 13:47:33,358 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.2857142857142856) internal successors, (138), 43 states have internal predecessors, (138), 0 states have call successors, (0), 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 47 [2022-11-21 13:47:33,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:33,363 INFO L225 Difference]: With dead ends: 335 [2022-11-21 13:47:33,363 INFO L226 Difference]: Without dead ends: 335 [2022-11-21 13:47:33,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=503, Invalid=2911, Unknown=20, NotChecked=348, Total=3782 [2022-11-21 13:47:33,371 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 482 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 90 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 1955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 486 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:33,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 1442 Invalid, 1955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1378 Invalid, 1 Unknown, 486 Unchecked, 1.7s Time] [2022-11-21 13:47:33,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-11-21 13:47:33,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 296. [2022-11-21 13:47:33,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 265 states have (on average 1.2528301886792452) internal successors, (332), 295 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:33,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 332 transitions. [2022-11-21 13:47:33,378 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 332 transitions. Word has length 47 [2022-11-21 13:47:33,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:33,378 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 332 transitions. [2022-11-21 13:47:33,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.2857142857142856) internal successors, (138), 43 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:33,379 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 332 transitions. [2022-11-21 13:47:33,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-21 13:47:33,382 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:33,382 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2022-11-21 13:47:33,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-21 13:47:33,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-21 13:47:33,589 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:47:33,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:33,589 INFO L85 PathProgramCache]: Analyzing trace with hash -690815526, now seen corresponding path program 1 times [2022-11-21 13:47:33,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:33,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041085991] [2022-11-21 13:47:33,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:33,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,655 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 13:47:33,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:33,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041085991] [2022-11-21 13:47:33,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041085991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:47:33,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:47:33,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:47:33,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397444372] [2022-11-21 13:47:33,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:47:33,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:47:33,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:33,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:47:33,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:47:33,659 INFO L87 Difference]: Start difference. First operand 296 states and 332 transitions. Second operand has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:33,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:33,797 INFO L93 Difference]: Finished difference Result 300 states and 335 transitions. [2022-11-21 13:47:33,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:47:33,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 48 [2022-11-21 13:47:33,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:33,799 INFO L225 Difference]: With dead ends: 300 [2022-11-21 13:47:33,799 INFO L226 Difference]: Without dead ends: 300 [2022-11-21 13:47:33,799 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-11-21 13:47:33,800 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 158 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:33,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 154 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:47:33,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-11-21 13:47:33,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 289. [2022-11-21 13:47:33,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 259 states have (on average 1.2548262548262548) internal successors, (325), 288 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:33,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 325 transitions. [2022-11-21 13:47:33,805 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 325 transitions. Word has length 48 [2022-11-21 13:47:33,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:33,805 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 325 transitions. [2022-11-21 13:47:33,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:33,805 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 325 transitions. [2022-11-21 13:47:33,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-21 13:47:33,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:33,806 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2022-11-21 13:47:33,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-21 13:47:33,810 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:47:33,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:33,810 INFO L85 PathProgramCache]: Analyzing trace with hash -2103557434, now seen corresponding path program 1 times [2022-11-21 13:47:33,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:33,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411738642] [2022-11-21 13:47:33,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:33,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,876 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:33,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:33,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411738642] [2022-11-21 13:47:33,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411738642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:47:33,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:47:33,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:47:33,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640376048] [2022-11-21 13:47:33,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:47:33,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:47:33,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:33,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:47:33,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:47:33,879 INFO L87 Difference]: Start difference. First operand 289 states and 325 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:33,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:33,932 INFO L93 Difference]: Finished difference Result 306 states and 331 transitions. [2022-11-21 13:47:33,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:47:33,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-11-21 13:47:33,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:33,934 INFO L225 Difference]: With dead ends: 306 [2022-11-21 13:47:33,934 INFO L226 Difference]: Without dead ends: 306 [2022-11-21 13:47:33,934 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-11-21 13:47:33,935 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 46 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:33,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 362 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:47:33,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-21 13:47:33,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 283. [2022-11-21 13:47:33,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 253 states have (on average 1.233201581027668) internal successors, (312), 282 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:33,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 312 transitions. [2022-11-21 13:47:33,942 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 312 transitions. Word has length 48 [2022-11-21 13:47:33,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:33,942 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 312 transitions. [2022-11-21 13:47:33,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:33,942 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 312 transitions. [2022-11-21 13:47:33,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-21 13:47:33,943 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:33,943 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-21 13:47:33,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-21 13:47:33,943 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:47:33,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:33,944 INFO L85 PathProgramCache]: Analyzing trace with hash -955374836, now seen corresponding path program 1 times [2022-11-21 13:47:33,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:33,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711777664] [2022-11-21 13:47:33,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:33,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:35,004 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:35,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:35,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711777664] [2022-11-21 13:47:35,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711777664] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:47:35,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992648798] [2022-11-21 13:47:35,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:35,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:35,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:47:35,006 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:47:35,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-21 13:47:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:35,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-21 13:47:35,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:47:35,186 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 6 treesize of output 5 [2022-11-21 13:47:35,303 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 13:47:35,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 13:47:35,378 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-11-21 13:47:35,389 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-11-21 13:47:35,613 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:47:35,614 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 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-21 13:47:35,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:47:35,634 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 21 [2022-11-21 13:47:35,677 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 13:47:35,678 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 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-21 13:47:35,687 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 11 treesize of output 7 [2022-11-21 13:47:35,717 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:47:35,717 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 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-21 13:47:35,936 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-21 13:47:35,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-21 13:47:36,031 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 13:47:36,031 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 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-21 13:47:36,038 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 11 treesize of output 7 [2022-11-21 13:47:36,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:47:36,066 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-21 13:47:36,066 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 1 case distinctions, treesize of input 35 treesize of output 26 [2022-11-21 13:47:36,369 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-21 13:47:36,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 62 [2022-11-21 13:47:36,384 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:47:36,384 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 1 case distinctions, treesize of input 81 treesize of output 75 [2022-11-21 13:47:36,476 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-21 13:47:36,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 74 [2022-11-21 13:47:36,488 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:47:36,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 75 [2022-11-21 13:47:36,768 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 67 treesize of output 47 [2022-11-21 13:47:36,842 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:47:36,842 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2022-11-21 13:47:36,847 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:36,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:47:39,177 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (not (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1590))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1589) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0))) is different from false [2022-11-21 13:47:39,193 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1585 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (not (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1590))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1585) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))) is different from false [2022-11-21 13:47:39,384 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:39,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-11-21 13:47:39,403 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1585 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_23 |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (= .cse0 0) (not (= (select |c_#valid| .cse0) 0)) (not (= (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_23) .cse0 v_ArrVal_1590))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1585) .cse0 v_ArrVal_1589) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))))) is different from false [2022-11-21 13:47:39,684 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:39,684 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 65 [2022-11-21 13:47:39,693 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:39,694 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 49 [2022-11-21 13:47:39,711 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:39,713 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 335 treesize of output 334 [2022-11-21 13:47:40,695 INFO L321 Elim1Store]: treesize reduction 294, result has 60.5 percent of original size [2022-11-21 13:47:40,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 4239 treesize of output 4240 [2022-11-21 13:47:40,934 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:40,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 3948 treesize of output 3176 [2022-11-21 13:47:41,068 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:47:41,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3089 treesize of output 2877 [2022-11-21 13:47:41,142 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 219 treesize of output 181 [2022-11-21 13:47:41,234 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 209 treesize of output 171 [2022-11-21 13:48:54,665 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-21 13:48:54,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992648798] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:48:54,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:48:54,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 41 [2022-11-21 13:48:54,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545713263] [2022-11-21 13:48:54,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:48:54,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-21 13:48:54,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:54,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-21 13:48:54,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1252, Unknown=26, NotChecked=222, Total=1640 [2022-11-21 13:48:54,668 INFO L87 Difference]: Start difference. First operand 283 states and 312 transitions. Second operand has 41 states, 41 states have (on average 3.097560975609756) internal successors, (127), 41 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:00,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:49:01,059 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1590))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1)) is different from false [2022-11-21 13:49:03,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 13:49:08,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:49:08,020 INFO L93 Difference]: Finished difference Result 462 states and 507 transitions. [2022-11-21 13:49:08,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-21 13:49:08,020 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.097560975609756) internal successors, (127), 41 states have internal predecessors, (127), 0 states have call successors, (0), 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 49 [2022-11-21 13:49:08,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:49:08,024 INFO L225 Difference]: With dead ends: 462 [2022-11-21 13:49:08,024 INFO L226 Difference]: Without dead ends: 462 [2022-11-21 13:49:08,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=537, Invalid=3859, Unknown=42, NotChecked=532, Total=4970 [2022-11-21 13:49:08,025 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 533 mSDsluCounter, 2179 mSDsCounter, 0 mSdLazyCounter, 2211 mSolverCounterSat, 75 mSolverCounterUnsat, 33 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 2289 SdHoareTripleChecker+Invalid, 3156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2211 IncrementalHoareTripleChecker+Invalid, 33 IncrementalHoareTripleChecker+Unknown, 837 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-11-21 13:49:08,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 2289 Invalid, 3156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2211 Invalid, 33 Unknown, 837 Unchecked, 7.9s Time] [2022-11-21 13:49:08,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-11-21 13:49:08,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 311. [2022-11-21 13:49:08,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 281 states have (on average 1.2277580071174377) internal successors, (345), 310 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 345 transitions. [2022-11-21 13:49:08,032 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 345 transitions. Word has length 49 [2022-11-21 13:49:08,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:49:08,032 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 345 transitions. [2022-11-21 13:49:08,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.097560975609756) internal successors, (127), 41 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:08,033 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 345 transitions. [2022-11-21 13:49:08,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-21 13:49:08,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:49:08,033 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2022-11-21 13:49:08,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-21 13:49:08,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-21 13:49:08,240 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:49:08,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:08,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1846224445, now seen corresponding path program 2 times [2022-11-21 13:49:08,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:08,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788367117] [2022-11-21 13:49:08,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:08,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:09,218 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:09,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:09,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788367117] [2022-11-21 13:49:09,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788367117] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:49:09,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603415141] [2022-11-21 13:49:09,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:49:09,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:49:09,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:49:09,223 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:49:09,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-21 13:49:09,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:49:09,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:49:09,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-21 13:49:09,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:49:09,456 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 6 treesize of output 5 [2022-11-21 13:49:09,593 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:49:09,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 13:49:09,667 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-11-21 13:49:09,677 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-11-21 13:49:09,887 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-21 13:49:09,887 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 1 case distinctions, treesize of input 27 treesize of output 22 [2022-11-21 13:49:09,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:49:09,911 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 26 treesize of output 21 [2022-11-21 13:49:10,021 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:49:10,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 50 [2022-11-21 13:49:10,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-11-21 13:49:10,750 INFO L321 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2022-11-21 13:49:10,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 36 [2022-11-21 13:49:10,765 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:49:10,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2022-11-21 13:49:10,927 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:10,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:49:22,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:49:22,135 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:49:22,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 5230 treesize of output 5086 [2022-11-21 13:51:04,173 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 1722 treesize of output 1706 [2022-11-21 13:51:04,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:51:04,321 INFO L321 Elim1Store]: treesize reduction 81, result has 38.6 percent of original size [2022-11-21 13:51:04,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 3730 treesize of output 3556 [2022-11-21 13:51:04,617 INFO L321 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2022-11-21 13:51:04,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1015 treesize of output 1029 [2022-11-21 13:51:04,700 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 6 treesize of output 4 [2022-11-21 13:51:04,787 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 22 treesize of output 18 [2022-11-21 13:51:04,828 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 6 treesize of output 4 [2022-11-21 13:51:04,910 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:51:04,918 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 983 treesize of output 973 [2022-11-21 13:51:06,439 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:06,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603415141] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:51:06,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:51:06,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 41 [2022-11-21 13:51:06,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309150915] [2022-11-21 13:51:06,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:51:06,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-21 13:51:06,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:06,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-21 13:51:06,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1502, Unknown=1, NotChecked=0, Total=1640 [2022-11-21 13:51:06,442 INFO L87 Difference]: Start difference. First operand 311 states and 345 transitions. Second operand has 41 states, 41 states have (on average 2.926829268292683) internal successors, (120), 41 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:14,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:51:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:15,966 INFO L93 Difference]: Finished difference Result 326 states and 355 transitions. [2022-11-21 13:51:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-21 13:51:15,967 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.926829268292683) internal successors, (120), 41 states have internal predecessors, (120), 0 states have call successors, (0), 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 50 [2022-11-21 13:51:15,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:15,968 INFO L225 Difference]: With dead ends: 326 [2022-11-21 13:51:15,968 INFO L226 Difference]: Without dead ends: 326 [2022-11-21 13:51:15,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=342, Invalid=2963, Unknown=1, NotChecked=0, Total=3306 [2022-11-21 13:51:15,970 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 624 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:15,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 1774 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1356 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-11-21 13:51:15,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-11-21 13:51:15,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 311. [2022-11-21 13:51:15,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 281 states have (on average 1.2277580071174377) internal successors, (345), 310 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 345 transitions. [2022-11-21 13:51:15,975 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 345 transitions. Word has length 50 [2022-11-21 13:51:15,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:15,976 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 345 transitions. [2022-11-21 13:51:15,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.926829268292683) internal successors, (120), 41 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:15,976 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 345 transitions. [2022-11-21 13:51:15,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-21 13:51:15,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:15,977 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:15,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-21 13:51:16,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-21 13:51:16,183 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-21 13:51:16,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:16,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1316419221, now seen corresponding path program 1 times [2022-11-21 13:51:16,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:16,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529721577] [2022-11-21 13:51:16,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:16,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:17,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:17,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:17,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529721577] [2022-11-21 13:51:17,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529721577] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:51:17,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358556604] [2022-11-21 13:51:17,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:17,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:51:17,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:51:17,046 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:51:17,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8d37f1-439e-4965-9eba-50a50a333c5d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-21 13:51:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:17,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-21 13:51:17,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:51:17,251 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 6 treesize of output 5 [2022-11-21 13:51:17,367 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:51:17,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 13:51:17,431 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-11-21 13:51:17,441 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-11-21 13:51:17,629 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-21 13:51:17,630 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 1 case distinctions, treesize of input 27 treesize of output 22 [2022-11-21 13:51:17,645 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 26 treesize of output 21 [2022-11-21 13:51:17,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:17,743 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:51:17,749 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:51:17,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 70 [2022-11-21 13:51:17,770 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-21 13:51:17,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 58 [2022-11-21 13:51:18,507 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:51:18,510 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:51:18,510 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2022-11-21 13:51:18,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 16 [2022-11-21 13:51:18,527 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:18,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:51:28,121 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:51:28,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 24914 treesize of output 23639 [2022-11-21 13:51:28,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:51:31,303 INFO L321 Elim1Store]: treesize reduction 624, result has 48.3 percent of original size [2022-11-21 13:51:31,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 15 new quantified variables, introduced 92 case distinctions, treesize of input 1887455 treesize of output 1777968 [2022-11-21 13:54:39,199 WARN L233 SmtUtils]: Spent 3.13m on a formula simplification. DAG size of input: 1271 DAG size of output: 1238 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 13:54:46,058 WARN L233 SmtUtils]: Spent 6.84s on a formula simplification that was a NOOP. DAG size: 1226 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 13:54:46,345 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:54:46,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 2098482 treesize of output 1800068 [2022-11-21 13:54:53,312 WARN L233 SmtUtils]: Spent 6.96s on a formula simplification that was a NOOP. DAG size: 1270 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 13:54:54,173 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 6 treesize of output 4 [2022-11-21 13:55:14,721 WARN L233 SmtUtils]: Spent 13.14s on a formula simplification that was a NOOP. DAG size: 1017 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 13:55:27,678 WARN L233 SmtUtils]: Spent 6.52s on a formula simplification that was a NOOP. DAG size: 1007 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 13:57:20,994 WARN L233 SmtUtils]: Spent 12.74s on a formula simplification that was a NOOP. DAG size: 1014 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 13:57:33,567 WARN L233 SmtUtils]: Spent 6.32s on a formula simplification that was a NOOP. DAG size: 1006 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 13:59:27,602 WARN L233 SmtUtils]: Spent 20.69s on a formula simplification that was a NOOP. DAG size: 1012 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 13:59:56,310 WARN L233 SmtUtils]: Spent 15.33s on a formula simplification that was a NOOP. DAG size: 991 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 14:00:10,360 WARN L233 SmtUtils]: Spent 7.56s on a formula simplification that was a NOOP. DAG size: 977 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)