./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-01-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d --- 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-5e519f3 [2022-11-02 20:57:03,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:57:03,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:57:03,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:57:03,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:57:03,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:57:03,203 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:57:03,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:57:03,207 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:57:03,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:57:03,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:57:03,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:57:03,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:57:03,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:57:03,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:57:03,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:57:03,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:57:03,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:57:03,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:57:03,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:57:03,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:57:03,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:57:03,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:57:03,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:57:03,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:57:03,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:57:03,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:57:03,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:57:03,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:57:03,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:57:03,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:57:03,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:57:03,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:57:03,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:57:03,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:57:03,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:57:03,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:57:03,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:57:03,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:57:03,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:57:03,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:57:03,244 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:57:03,267 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:57:03,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:57:03,268 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:57:03,268 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:57:03,269 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:57:03,269 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:57:03,270 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:57:03,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:57:03,271 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:57:03,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:57:03,271 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:57:03,272 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:57:03,272 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:57:03,272 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:57:03,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:57:03,277 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:57:03,277 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:57:03,278 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:57:03,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:57:03,278 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:57:03,279 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:57:03,279 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:57:03,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:57:03,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:57:03,281 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:57:03,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:57:03,282 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:57:03,284 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:57:03,284 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:57:03,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:57:03,285 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_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/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_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d [2022-11-02 20:57:03,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:57:03,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:57:03,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:57:03,578 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:57:03,579 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:57:03,580 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/forester-heap/sll-01-1.i [2022-11-02 20:57:03,649 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/data/7b8a2d636/cfd644b5b72b40e3bda8440dfb675931/FLAG505478fe1 [2022-11-02 20:57:04,168 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:57:04,168 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i [2022-11-02 20:57:04,181 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/data/7b8a2d636/cfd644b5b72b40e3bda8440dfb675931/FLAG505478fe1 [2022-11-02 20:57:04,480 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/data/7b8a2d636/cfd644b5b72b40e3bda8440dfb675931 [2022-11-02 20:57:04,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:57:04,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:57:04,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:57:04,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:57:04,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:57:04,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:57:04" (1/1) ... [2022-11-02 20:57:04,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15b8bb62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:04, skipping insertion in model container [2022-11-02 20:57:04,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:57:04" (1/1) ... [2022-11-02 20:57:04,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:57:04,547 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:57:04,836 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[22034,22047] [2022-11-02 20:57:04,842 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[22307,22320] [2022-11-02 20:57:04,844 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[22516,22529] [2022-11-02 20:57:04,845 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[22586,22599] [2022-11-02 20:57:04,848 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[22853,22866] [2022-11-02 20:57:04,850 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[22961,22974] [2022-11-02 20:57:04,852 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[23192,23205] [2022-11-02 20:57:04,853 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[23272,23285] [2022-11-02 20:57:04,854 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[23351,23364] [2022-11-02 20:57:04,855 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[23441,23454] [2022-11-02 20:57:04,856 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[23619,23632] [2022-11-02 20:57:04,857 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[23697,23710] [2022-11-02 20:57:04,858 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[23774,23787] [2022-11-02 20:57:04,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:57:04,869 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:57:04,907 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[22034,22047] [2022-11-02 20:57:04,911 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[22307,22320] [2022-11-02 20:57:04,924 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[22516,22529] [2022-11-02 20:57:04,925 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[22586,22599] [2022-11-02 20:57:04,927 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[22853,22866] [2022-11-02 20:57:04,928 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[22961,22974] [2022-11-02 20:57:04,930 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[23192,23205] [2022-11-02 20:57:04,930 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[23272,23285] [2022-11-02 20:57:04,943 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[23351,23364] [2022-11-02 20:57:04,944 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[23441,23454] [2022-11-02 20:57:04,945 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[23619,23632] [2022-11-02 20:57:04,946 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[23697,23710] [2022-11-02 20:57:04,947 WARN L230 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_bc25084d-8c02-401a-8d56-7f91a306759a/sv-benchmarks/c/forester-heap/sll-01-1.i[23774,23787] [2022-11-02 20:57:04,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:57:04,980 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:57:04,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:04 WrapperNode [2022-11-02 20:57:04,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:57:04,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:57:04,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:57:04,985 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:57:04,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:04" (1/1) ... [2022-11-02 20:57:05,031 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:04" (1/1) ... [2022-11-02 20:57:05,066 INFO L138 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 227 [2022-11-02 20:57:05,066 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:57:05,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:57:05,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:57:05,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:57:05,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:04" (1/1) ... [2022-11-02 20:57:05,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:04" (1/1) ... [2022-11-02 20:57:05,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:04" (1/1) ... [2022-11-02 20:57:05,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:04" (1/1) ... [2022-11-02 20:57:05,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:04" (1/1) ... [2022-11-02 20:57:05,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:04" (1/1) ... [2022-11-02 20:57:05,097 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:04" (1/1) ... [2022-11-02 20:57:05,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:04" (1/1) ... [2022-11-02 20:57:05,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:57:05,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:57:05,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:57:05,102 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:57:05,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:04" (1/1) ... [2022-11-02 20:57:05,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:57:05,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:05,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:57:05,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:57:05,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:57:05,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:57:05,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:57:05,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:57:05,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:57:05,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:57:05,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:57:05,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:57:05,349 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:57:05,351 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:57:05,968 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:57:05,976 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:57:05,976 INFO L300 CfgBuilder]: Removed 30 assume(true) statements. [2022-11-02 20:57:05,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:05 BoogieIcfgContainer [2022-11-02 20:57:05,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:57:05,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:57:05,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:57:05,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:57:05,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:57:04" (1/3) ... [2022-11-02 20:57:05,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9841393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:57:05, skipping insertion in model container [2022-11-02 20:57:05,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:04" (2/3) ... [2022-11-02 20:57:05,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9841393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:57:05, skipping insertion in model container [2022-11-02 20:57:05,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:05" (3/3) ... [2022-11-02 20:57:05,989 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2022-11-02 20:57:06,009 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:57:06,010 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 78 error locations. [2022-11-02 20:57:06,060 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:57:06,067 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;@706463fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:57:06,067 INFO L358 AbstractCegarLoop]: Starting to check reachability of 78 error locations. [2022-11-02 20:57:06,072 INFO L276 IsEmpty]: Start isEmpty. Operand has 190 states, 111 states have (on average 2.18018018018018) internal successors, (242), 189 states have internal predecessors, (242), 0 states have call successors, (0), 0 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-02 20:57:06,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:57:06,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:06,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:57:06,080 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:06,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:06,086 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-02 20:57:06,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:06,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662199380] [2022-11-02 20:57:06,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:06,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:06,340 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-02 20:57:06,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:06,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662199380] [2022-11-02 20:57:06,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662199380] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:06,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:06,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:06,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63646675] [2022-11-02 20:57:06,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:06,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:06,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:06,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:06,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:06,381 INFO L87 Difference]: Start difference. First operand has 190 states, 111 states have (on average 2.18018018018018) internal successors, (242), 189 states have internal predecessors, (242), 0 states have call successors, (0), 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-02 20:57:06,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:06,562 INFO L93 Difference]: Finished difference Result 192 states and 201 transitions. [2022-11-02 20:57:06,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:06,565 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-02 20:57:06,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:06,574 INFO L225 Difference]: With dead ends: 192 [2022-11-02 20:57:06,575 INFO L226 Difference]: Without dead ends: 188 [2022-11-02 20:57:06,576 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-02 20:57:06,580 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 182 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:06,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 119 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:57:06,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-11-02 20:57:06,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 183. [2022-11-02 20:57:06,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 113 states have (on average 1.7256637168141593) internal successors, (195), 182 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:06,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 195 transitions. [2022-11-02 20:57:06,623 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 195 transitions. Word has length 3 [2022-11-02 20:57:06,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:06,624 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 195 transitions. [2022-11-02 20:57:06,624 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-02 20:57:06,624 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2022-11-02 20:57:06,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:57:06,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:06,625 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:57:06,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:57:06,626 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:06,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:06,627 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-02 20:57:06,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:06,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996340690] [2022-11-02 20:57:06,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:06,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:06,720 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-02 20:57:06,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:06,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996340690] [2022-11-02 20:57:06,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996340690] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:06,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:06,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:06,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186075547] [2022-11-02 20:57:06,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:06,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:06,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:06,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:06,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:06,725 INFO L87 Difference]: Start difference. First operand 183 states and 195 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-02 20:57:06,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:06,920 INFO L93 Difference]: Finished difference Result 213 states and 224 transitions. [2022-11-02 20:57:06,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:06,921 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-02 20:57:06,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:06,927 INFO L225 Difference]: With dead ends: 213 [2022-11-02 20:57:06,933 INFO L226 Difference]: Without dead ends: 213 [2022-11-02 20:57:06,933 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-02 20:57:06,934 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 172 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:06,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 145 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:57:06,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-02 20:57:06,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 193. [2022-11-02 20:57:06,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 130 states have (on average 1.6615384615384616) internal successors, (216), 192 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-02 20:57:06,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 216 transitions. [2022-11-02 20:57:06,953 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 216 transitions. Word has length 3 [2022-11-02 20:57:06,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:06,953 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 216 transitions. [2022-11-02 20:57:06,954 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-02 20:57:06,954 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 216 transitions. [2022-11-02 20:57:06,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:57:06,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:06,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:57:06,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:57:06,955 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:06,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:06,956 INFO L85 PathProgramCache]: Analyzing trace with hash 28691969, now seen corresponding path program 1 times [2022-11-02 20:57:06,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:06,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079682543] [2022-11-02 20:57:06,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:06,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:06,996 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-02 20:57:06,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:06,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079682543] [2022-11-02 20:57:06,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079682543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:06,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:06,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:06,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425892923] [2022-11-02 20:57:06,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:06,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:06,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:06,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:06,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:07,000 INFO L87 Difference]: Start difference. First operand 193 states and 216 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 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-02 20:57:07,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:07,039 INFO L93 Difference]: Finished difference Result 208 states and 219 transitions. [2022-11-02 20:57:07,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:07,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-02 20:57:07,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:07,041 INFO L225 Difference]: With dead ends: 208 [2022-11-02 20:57:07,041 INFO L226 Difference]: Without dead ends: 208 [2022-11-02 20:57:07,041 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-02 20:57:07,042 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 169 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:07,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 196 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:07,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-11-02 20:57:07,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2022-11-02 20:57:07,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 129 states have (on average 1.6511627906976745) internal successors, (213), 190 states have internal predecessors, (213), 0 states have call successors, (0), 0 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-02 20:57:07,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 213 transitions. [2022-11-02 20:57:07,056 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 213 transitions. Word has length 5 [2022-11-02 20:57:07,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:07,056 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 213 transitions. [2022-11-02 20:57:07,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 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-02 20:57:07,057 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 213 transitions. [2022-11-02 20:57:07,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:57:07,057 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:07,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:07,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:57:07,062 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:07,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:07,063 INFO L85 PathProgramCache]: Analyzing trace with hash -618617197, now seen corresponding path program 1 times [2022-11-02 20:57:07,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:07,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236726594] [2022-11-02 20:57:07,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:07,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:07,233 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-02 20:57:07,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:07,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236726594] [2022-11-02 20:57:07,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236726594] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:07,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:07,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:57:07,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798852867] [2022-11-02 20:57:07,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:07,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:57:07,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:07,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:57:07,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:57:07,237 INFO L87 Difference]: Start difference. First operand 191 states and 213 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:07,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:07,433 INFO L93 Difference]: Finished difference Result 190 states and 212 transitions. [2022-11-02 20:57:07,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:57:07,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-02 20:57:07,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:07,434 INFO L225 Difference]: With dead ends: 190 [2022-11-02 20:57:07,435 INFO L226 Difference]: Without dead ends: 190 [2022-11-02 20:57:07,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:57:07,436 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 4 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:07,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 518 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:57:07,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-02 20:57:07,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-11-02 20:57:07,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 129 states have (on average 1.6434108527131783) internal successors, (212), 189 states have internal predecessors, (212), 0 states have call successors, (0), 0 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-02 20:57:07,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2022-11-02 20:57:07,444 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 11 [2022-11-02 20:57:07,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:07,444 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2022-11-02 20:57:07,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:07,445 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2022-11-02 20:57:07,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:57:07,446 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:07,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:07,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:57:07,446 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:07,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:07,447 INFO L85 PathProgramCache]: Analyzing trace with hash -618617196, now seen corresponding path program 1 times [2022-11-02 20:57:07,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:07,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300499557] [2022-11-02 20:57:07,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:07,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:07,734 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-02 20:57:07,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:07,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300499557] [2022-11-02 20:57:07,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300499557] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:07,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:07,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:57:07,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301626124] [2022-11-02 20:57:07,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:07,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:57:07,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:07,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:57:07,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:57:07,737 INFO L87 Difference]: Start difference. First operand 190 states and 212 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:07,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:07,948 INFO L93 Difference]: Finished difference Result 189 states and 211 transitions. [2022-11-02 20:57:07,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:57:07,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-02 20:57:07,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:07,950 INFO L225 Difference]: With dead ends: 189 [2022-11-02 20:57:07,950 INFO L226 Difference]: Without dead ends: 189 [2022-11-02 20:57:07,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:57:07,951 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 2 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:07,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 529 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:57:07,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-11-02 20:57:07,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-11-02 20:57:07,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 129 states have (on average 1.6356589147286822) internal successors, (211), 188 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:07,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 211 transitions. [2022-11-02 20:57:07,958 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 211 transitions. Word has length 11 [2022-11-02 20:57:07,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:07,958 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 211 transitions. [2022-11-02 20:57:07,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:07,959 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 211 transitions. [2022-11-02 20:57:07,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:57:07,959 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:07,960 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:07,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:57:07,960 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:07,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:07,961 INFO L85 PathProgramCache]: Analyzing trace with hash -2054096635, now seen corresponding path program 1 times [2022-11-02 20:57:07,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:07,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915127462] [2022-11-02 20:57:07,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:07,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:07,990 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-02 20:57:07,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:07,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915127462] [2022-11-02 20:57:07,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915127462] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:07,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:07,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:07,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790709612] [2022-11-02 20:57:07,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:07,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:07,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:07,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:07,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:07,993 INFO L87 Difference]: Start difference. First operand 189 states and 211 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:08,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:08,003 INFO L93 Difference]: Finished difference Result 190 states and 212 transitions. [2022-11-02 20:57:08,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:08,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-02 20:57:08,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:08,005 INFO L225 Difference]: With dead ends: 190 [2022-11-02 20:57:08,005 INFO L226 Difference]: Without dead ends: 190 [2022-11-02 20:57:08,006 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-02 20:57:08,006 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 348 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-02 20:57:08,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 348 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:08,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-02 20:57:08,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-11-02 20:57:08,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 130 states have (on average 1.6307692307692307) internal successors, (212), 189 states have internal predecessors, (212), 0 states have call successors, (0), 0 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-02 20:57:08,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2022-11-02 20:57:08,012 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 13 [2022-11-02 20:57:08,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:08,013 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2022-11-02 20:57:08,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:08,013 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2022-11-02 20:57:08,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:57:08,014 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:08,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:08,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:57:08,015 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:08,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:08,015 INFO L85 PathProgramCache]: Analyzing trace with hash 479764253, now seen corresponding path program 1 times [2022-11-02 20:57:08,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:08,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475291365] [2022-11-02 20:57:08,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:08,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:08,247 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-02 20:57:08,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:08,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475291365] [2022-11-02 20:57:08,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475291365] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:08,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:08,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:57:08,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748078827] [2022-11-02 20:57:08,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:08,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:57:08,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:08,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:57:08,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:57:08,250 INFO L87 Difference]: Start difference. First operand 190 states and 212 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:08,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:08,557 INFO L93 Difference]: Finished difference Result 190 states and 211 transitions. [2022-11-02 20:57:08,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:57:08,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 20:57:08,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:08,559 INFO L225 Difference]: With dead ends: 190 [2022-11-02 20:57:08,559 INFO L226 Difference]: Without dead ends: 190 [2022-11-02 20:57:08,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:57:08,560 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 168 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:08,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 441 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:57:08,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-02 20:57:08,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2022-11-02 20:57:08,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 130 states have (on average 1.623076923076923) internal successors, (211), 188 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:08,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 211 transitions. [2022-11-02 20:57:08,565 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 211 transitions. Word has length 14 [2022-11-02 20:57:08,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:08,565 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 211 transitions. [2022-11-02 20:57:08,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:08,566 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 211 transitions. [2022-11-02 20:57:08,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:57:08,567 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:08,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:08,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:57:08,567 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:08,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:08,568 INFO L85 PathProgramCache]: Analyzing trace with hash 479764254, now seen corresponding path program 1 times [2022-11-02 20:57:08,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:08,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110143882] [2022-11-02 20:57:08,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:08,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:08,935 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-02 20:57:08,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:08,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110143882] [2022-11-02 20:57:08,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110143882] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:08,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:08,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:57:08,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745514684] [2022-11-02 20:57:08,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:08,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:57:08,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:08,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:57:08,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:57:08,938 INFO L87 Difference]: Start difference. First operand 189 states and 211 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:09,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:09,376 INFO L93 Difference]: Finished difference Result 189 states and 210 transitions. [2022-11-02 20:57:09,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:57:09,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 20:57:09,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:09,378 INFO L225 Difference]: With dead ends: 189 [2022-11-02 20:57:09,378 INFO L226 Difference]: Without dead ends: 189 [2022-11-02 20:57:09,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:57:09,379 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 162 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:09,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 479 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:57:09,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-11-02 20:57:09,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2022-11-02 20:57:09,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 130 states have (on average 1.6153846153846154) internal successors, (210), 187 states have internal predecessors, (210), 0 states have call successors, (0), 0 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-02 20:57:09,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 210 transitions. [2022-11-02 20:57:09,383 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 210 transitions. Word has length 14 [2022-11-02 20:57:09,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:09,383 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 210 transitions. [2022-11-02 20:57:09,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:09,384 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 210 transitions. [2022-11-02 20:57:09,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:57:09,385 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:09,385 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:09,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:57:09,385 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:09,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:09,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1699725866, now seen corresponding path program 1 times [2022-11-02 20:57:09,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:09,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889836747] [2022-11-02 20:57:09,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:09,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:09,557 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-02 20:57:09,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:09,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889836747] [2022-11-02 20:57:09,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889836747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:09,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:09,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:57:09,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101237869] [2022-11-02 20:57:09,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:09,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:57:09,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:09,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:57:09,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:57:09,562 INFO L87 Difference]: Start difference. First operand 188 states and 210 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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-02 20:57:09,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:09,823 INFO L93 Difference]: Finished difference Result 275 states and 303 transitions. [2022-11-02 20:57:09,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:57:09,823 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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-02 20:57:09,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:09,824 INFO L225 Difference]: With dead ends: 275 [2022-11-02 20:57:09,824 INFO L226 Difference]: Without dead ends: 275 [2022-11-02 20:57:09,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:57:09,825 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 193 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:09,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 699 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:57:09,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-02 20:57:09,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 185. [2022-11-02 20:57:09,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 128 states have (on average 1.6171875) internal successors, (207), 184 states have internal predecessors, (207), 0 states have call successors, (0), 0 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-02 20:57:09,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2022-11-02 20:57:09,830 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 15 [2022-11-02 20:57:09,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:09,830 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2022-11-02 20:57:09,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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-02 20:57:09,831 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2022-11-02 20:57:09,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:57:09,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:09,831 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:09,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:57:09,831 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:09,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:09,832 INFO L85 PathProgramCache]: Analyzing trace with hash -99613104, now seen corresponding path program 1 times [2022-11-02 20:57:09,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:09,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092474856] [2022-11-02 20:57:09,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:09,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:09,945 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-02 20:57:09,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:09,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092474856] [2022-11-02 20:57:09,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092474856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:09,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:09,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:57:09,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606319142] [2022-11-02 20:57:09,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:09,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:57:09,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:09,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:57:09,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:57:09,948 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-02 20:57:10,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:10,147 INFO L93 Difference]: Finished difference Result 276 states and 303 transitions. [2022-11-02 20:57:10,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:57:10,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-11-02 20:57:10,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:10,149 INFO L225 Difference]: With dead ends: 276 [2022-11-02 20:57:10,149 INFO L226 Difference]: Without dead ends: 276 [2022-11-02 20:57:10,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:57:10,150 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 100 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:10,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 582 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:57:10,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-11-02 20:57:10,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 188. [2022-11-02 20:57:10,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 131 states have (on average 1.6030534351145038) internal successors, (210), 187 states have internal predecessors, (210), 0 states have call successors, (0), 0 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-02 20:57:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 210 transitions. [2022-11-02 20:57:10,155 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 210 transitions. Word has length 17 [2022-11-02 20:57:10,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:10,155 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 210 transitions. [2022-11-02 20:57:10,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-02 20:57:10,156 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 210 transitions. [2022-11-02 20:57:10,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:57:10,156 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:10,156 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-02 20:57:10,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:57:10,157 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:10,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:10,157 INFO L85 PathProgramCache]: Analyzing trace with hash -582241035, now seen corresponding path program 1 times [2022-11-02 20:57:10,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:10,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967912361] [2022-11-02 20:57:10,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:10,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:10,400 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-02 20:57:10,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:10,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967912361] [2022-11-02 20:57:10,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967912361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:10,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:10,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:57:10,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695732209] [2022-11-02 20:57:10,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:10,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:57:10,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:10,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:57:10,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:57:10,402 INFO L87 Difference]: Start difference. First operand 188 states and 210 transitions. Second operand has 6 states, 5 states have (on average 3.8) 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-02 20:57:10,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:10,660 INFO L93 Difference]: Finished difference Result 248 states and 263 transitions. [2022-11-02 20:57:10,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:57:10,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) 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-02 20:57:10,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:10,662 INFO L225 Difference]: With dead ends: 248 [2022-11-02 20:57:10,662 INFO L226 Difference]: Without dead ends: 248 [2022-11-02 20:57:10,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:57:10,663 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 488 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:10,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 186 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:57:10,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-11-02 20:57:10,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 211. [2022-11-02 20:57:10,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 154 states have (on average 1.603896103896104) internal successors, (247), 210 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:10,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 247 transitions. [2022-11-02 20:57:10,668 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 247 transitions. Word has length 19 [2022-11-02 20:57:10,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:10,668 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 247 transitions. [2022-11-02 20:57:10,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) 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-02 20:57:10,668 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 247 transitions. [2022-11-02 20:57:10,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:57:10,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:10,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:10,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:57:10,669 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:10,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:10,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1187837214, now seen corresponding path program 1 times [2022-11-02 20:57:10,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:10,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356330554] [2022-11-02 20:57:10,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:10,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:10,719 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-02 20:57:10,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:10,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356330554] [2022-11-02 20:57:10,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356330554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:10,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:10,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:57:10,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456131777] [2022-11-02 20:57:10,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:10,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:57:10,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:10,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:57:10,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:57:10,721 INFO L87 Difference]: Start difference. First operand 211 states and 247 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:10,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:10,856 INFO L93 Difference]: Finished difference Result 243 states and 257 transitions. [2022-11-02 20:57:10,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:57:10,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-02 20:57:10,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:10,859 INFO L225 Difference]: With dead ends: 243 [2022-11-02 20:57:10,860 INFO L226 Difference]: Without dead ends: 243 [2022-11-02 20:57:10,860 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-02 20:57:10,860 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 228 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:10,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 277 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:57:10,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-02 20:57:10,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 209. [2022-11-02 20:57:10,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 153 states have (on average 1.5947712418300655) internal successors, (244), 208 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 244 transitions. [2022-11-02 20:57:10,866 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 244 transitions. Word has length 21 [2022-11-02 20:57:10,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:10,866 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 244 transitions. [2022-11-02 20:57:10,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:10,866 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 244 transitions. [2022-11-02 20:57:10,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:57:10,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:10,867 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:10,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:57:10,867 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:10,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:10,868 INFO L85 PathProgramCache]: Analyzing trace with hash 903845878, now seen corresponding path program 1 times [2022-11-02 20:57:10,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:10,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837737927] [2022-11-02 20:57:10,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:10,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:11,003 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-02 20:57:11,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:11,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837737927] [2022-11-02 20:57:11,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837737927] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:11,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:11,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:57:11,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079464229] [2022-11-02 20:57:11,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:11,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:57:11,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:11,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:57:11,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:57:11,006 INFO L87 Difference]: Start difference. First operand 209 states and 244 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:11,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:11,260 INFO L93 Difference]: Finished difference Result 198 states and 231 transitions. [2022-11-02 20:57:11,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:57:11,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-02 20:57:11,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:11,261 INFO L225 Difference]: With dead ends: 198 [2022-11-02 20:57:11,261 INFO L226 Difference]: Without dead ends: 198 [2022-11-02 20:57:11,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:57:11,262 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 98 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:11,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 427 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:57:11,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-02 20:57:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2022-11-02 20:57:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 153 states have (on average 1.5032679738562091) internal successors, (230), 196 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:11,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 230 transitions. [2022-11-02 20:57:11,269 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 230 transitions. Word has length 23 [2022-11-02 20:57:11,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:11,269 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 230 transitions. [2022-11-02 20:57:11,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:11,270 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 230 transitions. [2022-11-02 20:57:11,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:57:11,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:11,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:11,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:57:11,271 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:11,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:11,272 INFO L85 PathProgramCache]: Analyzing trace with hash 903845879, now seen corresponding path program 1 times [2022-11-02 20:57:11,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:11,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961121659] [2022-11-02 20:57:11,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:11,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:11,490 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-02 20:57:11,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:11,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961121659] [2022-11-02 20:57:11,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961121659] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:11,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:11,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:57:11,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397834659] [2022-11-02 20:57:11,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:11,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:57:11,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:11,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:57:11,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:57:11,492 INFO L87 Difference]: Start difference. First operand 197 states and 230 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:11,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:11,791 INFO L93 Difference]: Finished difference Result 190 states and 223 transitions. [2022-11-02 20:57:11,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:57:11,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-02 20:57:11,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:11,792 INFO L225 Difference]: With dead ends: 190 [2022-11-02 20:57:11,793 INFO L226 Difference]: Without dead ends: 190 [2022-11-02 20:57:11,793 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-02 20:57:11,793 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 41 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:11,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 488 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:57:11,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-02 20:57:11,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 183. [2022-11-02 20:57:11,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 148 states have (on average 1.4527027027027026) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 0 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-02 20:57:11,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 215 transitions. [2022-11-02 20:57:11,798 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 215 transitions. Word has length 23 [2022-11-02 20:57:11,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:11,798 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 215 transitions. [2022-11-02 20:57:11,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:11,798 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 215 transitions. [2022-11-02 20:57:11,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:57:11,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:11,799 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] [2022-11-02 20:57:11,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:57:11,799 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:11,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:11,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1012497526, now seen corresponding path program 1 times [2022-11-02 20:57:11,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:11,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657463708] [2022-11-02 20:57:11,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:11,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:11,898 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-02 20:57:11,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:11,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657463708] [2022-11-02 20:57:11,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657463708] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:11,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:11,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:57:11,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589764584] [2022-11-02 20:57:11,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:11,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:57:11,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:11,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:57:11,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:57:11,900 INFO L87 Difference]: Start difference. First operand 183 states and 215 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:12,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:12,065 INFO L93 Difference]: Finished difference Result 186 states and 219 transitions. [2022-11-02 20:57:12,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:57:12,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-02 20:57:12,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:12,067 INFO L225 Difference]: With dead ends: 186 [2022-11-02 20:57:12,067 INFO L226 Difference]: Without dead ends: 186 [2022-11-02 20:57:12,067 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-02 20:57:12,067 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 38 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:12,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 592 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:57:12,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-11-02 20:57:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 179. [2022-11-02 20:57:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 146 states have (on average 1.4452054794520548) internal successors, (211), 178 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 211 transitions. [2022-11-02 20:57:12,072 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 211 transitions. Word has length 25 [2022-11-02 20:57:12,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:12,072 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 211 transitions. [2022-11-02 20:57:12,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:12,072 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 211 transitions. [2022-11-02 20:57:12,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:57:12,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:12,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:12,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:57:12,073 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:12,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:12,074 INFO L85 PathProgramCache]: Analyzing trace with hash 476921454, now seen corresponding path program 1 times [2022-11-02 20:57:12,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:12,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013668694] [2022-11-02 20:57:12,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:12,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:12,114 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-02 20:57:12,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:12,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013668694] [2022-11-02 20:57:12,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013668694] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:12,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:12,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:12,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808780604] [2022-11-02 20:57:12,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:12,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:12,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:12,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:12,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:12,116 INFO L87 Difference]: Start difference. First operand 179 states and 211 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:12,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:12,126 INFO L93 Difference]: Finished difference Result 252 states and 299 transitions. [2022-11-02 20:57:12,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:12,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-02 20:57:12,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:12,128 INFO L225 Difference]: With dead ends: 252 [2022-11-02 20:57:12,128 INFO L226 Difference]: Without dead ends: 252 [2022-11-02 20:57:12,128 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-02 20:57:12,129 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 50 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:12,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 283 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:12,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-02 20:57:12,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 185. [2022-11-02 20:57:12,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 184 states have internal predecessors, (219), 0 states have call successors, (0), 0 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-02 20:57:12,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 219 transitions. [2022-11-02 20:57:12,134 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 219 transitions. Word has length 27 [2022-11-02 20:57:12,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:12,135 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 219 transitions. [2022-11-02 20:57:12,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:12,135 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2022-11-02 20:57:12,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:57:12,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:12,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:12,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:57:12,136 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:12,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:12,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1899651814, now seen corresponding path program 1 times [2022-11-02 20:57:12,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:12,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089981700] [2022-11-02 20:57:12,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:12,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:12,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:12,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:12,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089981700] [2022-11-02 20:57:12,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089981700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:12,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:12,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:12,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609268404] [2022-11-02 20:57:12,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:12,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:12,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:12,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:12,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:12,197 INFO L87 Difference]: Start difference. First operand 185 states and 219 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-02 20:57:12,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:12,214 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2022-11-02 20:57:12,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:12,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-02 20:57:12,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:12,215 INFO L225 Difference]: With dead ends: 183 [2022-11-02 20:57:12,215 INFO L226 Difference]: Without dead ends: 183 [2022-11-02 20:57:12,216 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-02 20:57:12,216 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 20 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:12,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 254 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:12,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-02 20:57:12,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-11-02 20:57:12,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 151 states have (on average 1.4304635761589404) internal successors, (216), 182 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-02 20:57:12,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 216 transitions. [2022-11-02 20:57:12,220 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 216 transitions. Word has length 28 [2022-11-02 20:57:12,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:12,221 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 216 transitions. [2022-11-02 20:57:12,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 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-02 20:57:12,221 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 216 transitions. [2022-11-02 20:57:12,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:57:12,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:12,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:12,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:57:12,222 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:12,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:12,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1240331581, now seen corresponding path program 1 times [2022-11-02 20:57:12,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:12,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598532471] [2022-11-02 20:57:12,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:12,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:12,540 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-02 20:57:12,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:12,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598532471] [2022-11-02 20:57:12,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598532471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:12,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:12,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:57:12,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44207880] [2022-11-02 20:57:12,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:12,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:57:12,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:12,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:57:12,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:57:12,543 INFO L87 Difference]: Start difference. First operand 183 states and 216 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:13,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:13,015 INFO L93 Difference]: Finished difference Result 308 states and 341 transitions. [2022-11-02 20:57:13,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:57:13,016 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 20:57:13,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:13,018 INFO L225 Difference]: With dead ends: 308 [2022-11-02 20:57:13,018 INFO L226 Difference]: Without dead ends: 308 [2022-11-02 20:57:13,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:57:13,019 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 390 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:13,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 784 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:57:13,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-11-02 20:57:13,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 216. [2022-11-02 20:57:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 215 states have internal predecessors, (254), 0 states have call successors, (0), 0 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-02 20:57:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 254 transitions. [2022-11-02 20:57:13,024 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 254 transitions. Word has length 29 [2022-11-02 20:57:13,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:13,024 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 254 transitions. [2022-11-02 20:57:13,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:13,025 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 254 transitions. [2022-11-02 20:57:13,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:57:13,025 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:13,025 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] [2022-11-02 20:57:13,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:57:13,026 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:13,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:13,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1786976426, now seen corresponding path program 1 times [2022-11-02 20:57:13,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:13,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099221124] [2022-11-02 20:57:13,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:13,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:13,241 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-02 20:57:13,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:13,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099221124] [2022-11-02 20:57:13,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099221124] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:13,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970779847] [2022-11-02 20:57:13,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:13,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:13,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:13,244 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:57:13,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:57:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:13,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-02 20:57:13,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:13,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:13,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:13,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:13,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:57:13,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:13,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:57:13,729 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:57:13,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:57:13,735 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:57:13,738 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:13,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-11-02 20:57:13,749 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-02 20:57:13,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:57:17,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 [2022-11-02 20:57:17,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:57:17,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-11-02 20:57:17,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 [2022-11-02 20:57:17,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:17,947 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-02 20:57:17,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970779847] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:57:17,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:57:17,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 13 [2022-11-02 20:57:17,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014866567] [2022-11-02 20:57:17,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:57:17,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:57:17,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:17,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:57:17,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=122, Unknown=2, NotChecked=0, Total=156 [2022-11-02 20:57:17,950 INFO L87 Difference]: Start difference. First operand 216 states and 254 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-02 20:57:18,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:18,741 INFO L93 Difference]: Finished difference Result 481 states and 540 transitions. [2022-11-02 20:57:18,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:57:18,742 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 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 31 [2022-11-02 20:57:18,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:18,745 INFO L225 Difference]: With dead ends: 481 [2022-11-02 20:57:18,745 INFO L226 Difference]: Without dead ends: 481 [2022-11-02 20:57:18,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=148, Invalid=450, Unknown=2, NotChecked=0, Total=600 [2022-11-02 20:57:18,746 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 812 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:18,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1240 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 428 Invalid, 0 Unknown, 105 Unchecked, 0.4s Time] [2022-11-02 20:57:18,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-11-02 20:57:18,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 251. [2022-11-02 20:57:18,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 219 states have (on average 1.3789954337899544) internal successors, (302), 250 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-02 20:57:18,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 302 transitions. [2022-11-02 20:57:18,754 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 302 transitions. Word has length 31 [2022-11-02 20:57:18,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:18,754 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 302 transitions. [2022-11-02 20:57:18,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-02 20:57:18,754 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 302 transitions. [2022-11-02 20:57:18,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:57:18,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:18,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:18,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-02 20:57:18,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:18,971 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:18,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:18,971 INFO L85 PathProgramCache]: Analyzing trace with hash 883081196, now seen corresponding path program 1 times [2022-11-02 20:57:18,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:18,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721093720] [2022-11-02 20:57:18,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:18,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:19,109 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-02 20:57:19,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:19,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721093720] [2022-11-02 20:57:19,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721093720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:19,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:19,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:57:19,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961137484] [2022-11-02 20:57:19,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:19,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:57:19,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:19,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:57:19,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:57:19,112 INFO L87 Difference]: Start difference. First operand 251 states and 302 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-02 20:57:19,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:19,273 INFO L93 Difference]: Finished difference Result 250 states and 301 transitions. [2022-11-02 20:57:19,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:57:19,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-11-02 20:57:19,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:19,275 INFO L225 Difference]: With dead ends: 250 [2022-11-02 20:57:19,275 INFO L226 Difference]: Without dead ends: 250 [2022-11-02 20:57:19,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:57:19,276 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 4 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:19,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 408 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:57:19,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-11-02 20:57:19,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2022-11-02 20:57:19,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 219 states have (on average 1.3744292237442923) internal successors, (301), 249 states have internal predecessors, (301), 0 states have call successors, (0), 0 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-02 20:57:19,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 301 transitions. [2022-11-02 20:57:19,282 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 301 transitions. Word has length 33 [2022-11-02 20:57:19,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:19,282 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 301 transitions. [2022-11-02 20:57:19,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-02 20:57:19,282 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 301 transitions. [2022-11-02 20:57:19,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:57:19,283 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:19,284 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:19,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:57:19,284 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:19,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:19,284 INFO L85 PathProgramCache]: Analyzing trace with hash 883081197, now seen corresponding path program 1 times [2022-11-02 20:57:19,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:19,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946189081] [2022-11-02 20:57:19,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:19,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:19,483 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-02 20:57:19,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:19,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946189081] [2022-11-02 20:57:19,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946189081] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:19,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:19,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:57:19,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356399180] [2022-11-02 20:57:19,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:19,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:57:19,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:19,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:57:19,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:57:19,487 INFO L87 Difference]: Start difference. First operand 250 states and 301 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-02 20:57:19,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:19,661 INFO L93 Difference]: Finished difference Result 249 states and 300 transitions. [2022-11-02 20:57:19,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:57:19,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-11-02 20:57:19,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:19,663 INFO L225 Difference]: With dead ends: 249 [2022-11-02 20:57:19,663 INFO L226 Difference]: Without dead ends: 249 [2022-11-02 20:57:19,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:57:19,664 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 2 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:19,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 411 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:57:19,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-11-02 20:57:19,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2022-11-02 20:57:19,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 219 states have (on average 1.36986301369863) internal successors, (300), 248 states have internal predecessors, (300), 0 states have call successors, (0), 0 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-02 20:57:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 300 transitions. [2022-11-02 20:57:19,669 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 300 transitions. Word has length 33 [2022-11-02 20:57:19,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:19,669 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 300 transitions. [2022-11-02 20:57:19,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-02 20:57:19,670 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 300 transitions. [2022-11-02 20:57:19,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:57:19,670 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:19,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:19,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:57:19,671 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:19,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:19,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1776374941, now seen corresponding path program 1 times [2022-11-02 20:57:19,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:19,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178847063] [2022-11-02 20:57:19,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:19,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:19,954 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-02 20:57:19,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:19,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178847063] [2022-11-02 20:57:19,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178847063] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:19,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:19,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:57:19,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637602151] [2022-11-02 20:57:19,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:19,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:57:19,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:19,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:57:19,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:57:19,957 INFO L87 Difference]: Start difference. First operand 249 states and 300 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-02 20:57:20,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:20,689 INFO L93 Difference]: Finished difference Result 364 states and 406 transitions. [2022-11-02 20:57:20,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:57:20,692 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-02 20:57:20,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:20,693 INFO L225 Difference]: With dead ends: 364 [2022-11-02 20:57:20,694 INFO L226 Difference]: Without dead ends: 364 [2022-11-02 20:57:20,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:57:20,695 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 491 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:20,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 973 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:57:20,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-11-02 20:57:20,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 250. [2022-11-02 20:57:20,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 222 states have (on average 1.3423423423423424) internal successors, (298), 249 states have internal predecessors, (298), 0 states have call successors, (0), 0 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-02 20:57:20,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 298 transitions. [2022-11-02 20:57:20,700 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 298 transitions. Word has length 34 [2022-11-02 20:57:20,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:20,701 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 298 transitions. [2022-11-02 20:57:20,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-02 20:57:20,701 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 298 transitions. [2022-11-02 20:57:20,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:57:20,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:20,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:20,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:57:20,702 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:20,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:20,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1776374942, now seen corresponding path program 1 times [2022-11-02 20:57:20,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:20,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707205227] [2022-11-02 20:57:20,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:20,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:21,296 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-02 20:57:21,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:21,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707205227] [2022-11-02 20:57:21,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707205227] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:21,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:21,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:57:21,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539146446] [2022-11-02 20:57:21,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:21,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:57:21,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:21,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:57:21,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:57:21,305 INFO L87 Difference]: Start difference. First operand 250 states and 298 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-02 20:57:22,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:22,237 INFO L93 Difference]: Finished difference Result 428 states and 464 transitions. [2022-11-02 20:57:22,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:57:22,237 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-02 20:57:22,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:22,239 INFO L225 Difference]: With dead ends: 428 [2022-11-02 20:57:22,239 INFO L226 Difference]: Without dead ends: 428 [2022-11-02 20:57:22,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:57:22,240 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 739 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:22,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 922 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:57:22,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-11-02 20:57:22,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 256. [2022-11-02 20:57:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 228 states have (on average 1.337719298245614) internal successors, (305), 255 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-02 20:57:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 305 transitions. [2022-11-02 20:57:22,245 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 305 transitions. Word has length 34 [2022-11-02 20:57:22,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:22,246 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 305 transitions. [2022-11-02 20:57:22,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-02 20:57:22,246 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 305 transitions. [2022-11-02 20:57:22,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:57:22,246 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:22,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:22,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:57:22,248 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:22,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:22,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2030948706, now seen corresponding path program 1 times [2022-11-02 20:57:22,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:22,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064455612] [2022-11-02 20:57:22,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:22,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:22,287 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-02 20:57:22,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:22,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064455612] [2022-11-02 20:57:22,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064455612] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:22,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:22,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:22,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807068045] [2022-11-02 20:57:22,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:22,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:22,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:22,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:22,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:22,290 INFO L87 Difference]: Start difference. First operand 256 states and 305 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 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-02 20:57:22,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:22,298 INFO L93 Difference]: Finished difference Result 258 states and 307 transitions. [2022-11-02 20:57:22,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:22,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2022-11-02 20:57:22,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:22,300 INFO L225 Difference]: With dead ends: 258 [2022-11-02 20:57:22,300 INFO L226 Difference]: Without dead ends: 258 [2022-11-02 20:57:22,300 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-02 20:57:22,301 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 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-02 20:57:22,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:22,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-02 20:57:22,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2022-11-02 20:57:22,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 230 states have (on average 1.3347826086956522) internal successors, (307), 257 states have internal predecessors, (307), 0 states have call successors, (0), 0 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-02 20:57:22,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 307 transitions. [2022-11-02 20:57:22,307 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 307 transitions. Word has length 35 [2022-11-02 20:57:22,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:22,307 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 307 transitions. [2022-11-02 20:57:22,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 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-02 20:57:22,308 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 307 transitions. [2022-11-02 20:57:22,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:57:22,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:22,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:22,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:57:22,311 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:22,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:22,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1994309533, now seen corresponding path program 1 times [2022-11-02 20:57:22,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:22,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457198484] [2022-11-02 20:57:22,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:22,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:23,014 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-02 20:57:23,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:23,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457198484] [2022-11-02 20:57:23,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457198484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:23,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:23,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:57:23,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145090267] [2022-11-02 20:57:23,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:23,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:57:23,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:23,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:57:23,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:57:23,016 INFO L87 Difference]: Start difference. First operand 258 states and 307 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-02 20:57:24,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:24,069 INFO L93 Difference]: Finished difference Result 420 states and 456 transitions. [2022-11-02 20:57:24,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:57:24,070 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2022-11-02 20:57:24,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:24,071 INFO L225 Difference]: With dead ends: 420 [2022-11-02 20:57:24,071 INFO L226 Difference]: Without dead ends: 420 [2022-11-02 20:57:24,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2022-11-02 20:57:24,072 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 553 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:24,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1234 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:57:24,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-11-02 20:57:24,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 258. [2022-11-02 20:57:24,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 230 states have (on average 1.3304347826086957) internal successors, (306), 257 states have internal predecessors, (306), 0 states have call successors, (0), 0 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-02 20:57:24,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 306 transitions. [2022-11-02 20:57:24,083 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 306 transitions. Word has length 36 [2022-11-02 20:57:24,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:24,083 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 306 transitions. [2022-11-02 20:57:24,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-02 20:57:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 306 transitions. [2022-11-02 20:57:24,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:57:24,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:24,084 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:24,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:57:24,085 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:24,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:24,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1529477485, now seen corresponding path program 1 times [2022-11-02 20:57:24,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:24,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875214350] [2022-11-02 20:57:24,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:24,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:24,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:57:24,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:24,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875214350] [2022-11-02 20:57:24,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875214350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:24,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:24,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:57:24,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26983015] [2022-11-02 20:57:24,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:24,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:57:24,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:24,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:57:24,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:57:24,260 INFO L87 Difference]: Start difference. First operand 258 states and 306 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-02 20:57:24,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:24,512 INFO L93 Difference]: Finished difference Result 273 states and 321 transitions. [2022-11-02 20:57:24,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:57:24,513 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2022-11-02 20:57:24,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:24,514 INFO L225 Difference]: With dead ends: 273 [2022-11-02 20:57:24,514 INFO L226 Difference]: Without dead ends: 273 [2022-11-02 20:57:24,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:57:24,515 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 49 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:24,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 608 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:57:24,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-11-02 20:57:24,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 267. [2022-11-02 20:57:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 239 states have (on average 1.3179916317991631) internal successors, (315), 266 states have internal predecessors, (315), 0 states have call successors, (0), 0 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-02 20:57:24,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 315 transitions. [2022-11-02 20:57:24,520 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 315 transitions. Word has length 36 [2022-11-02 20:57:24,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:24,520 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 315 transitions. [2022-11-02 20:57:24,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-02 20:57:24,520 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 315 transitions. [2022-11-02 20:57:24,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:57:24,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:24,521 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:24,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:57:24,521 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:24,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:24,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1197350168, now seen corresponding path program 1 times [2022-11-02 20:57:24,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:24,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737739790] [2022-11-02 20:57:24,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:24,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:24,834 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-02 20:57:24,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:24,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737739790] [2022-11-02 20:57:24,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737739790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:24,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:24,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:57:24,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855798054] [2022-11-02 20:57:24,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:24,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:57:24,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:24,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:57:24,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:57:24,837 INFO L87 Difference]: Start difference. First operand 267 states and 315 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-02 20:57:25,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:25,258 INFO L93 Difference]: Finished difference Result 267 states and 315 transitions. [2022-11-02 20:57:25,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:57:25,259 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2022-11-02 20:57:25,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:25,260 INFO L225 Difference]: With dead ends: 267 [2022-11-02 20:57:25,260 INFO L226 Difference]: Without dead ends: 267 [2022-11-02 20:57:25,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:57:25,261 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 78 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:25,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 721 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:57:25,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-11-02 20:57:25,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 266. [2022-11-02 20:57:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 239 states have (on average 1.3138075313807531) internal successors, (314), 265 states have internal predecessors, (314), 0 states have call successors, (0), 0 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-02 20:57:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 314 transitions. [2022-11-02 20:57:25,265 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 314 transitions. Word has length 36 [2022-11-02 20:57:25,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:25,266 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 314 transitions. [2022-11-02 20:57:25,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-02 20:57:25,266 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 314 transitions. [2022-11-02 20:57:25,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:57:25,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:25,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:25,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:57:25,267 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:25,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:25,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1197350169, now seen corresponding path program 1 times [2022-11-02 20:57:25,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:25,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104045493] [2022-11-02 20:57:25,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:25,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:25,765 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-02 20:57:25,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:25,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104045493] [2022-11-02 20:57:25,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104045493] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:25,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:25,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:57:25,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996847184] [2022-11-02 20:57:25,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:25,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:57:25,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:25,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:57:25,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:57:25,768 INFO L87 Difference]: Start difference. First operand 266 states and 314 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-02 20:57:26,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:26,284 INFO L93 Difference]: Finished difference Result 266 states and 314 transitions. [2022-11-02 20:57:26,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:57:26,284 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2022-11-02 20:57:26,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:26,285 INFO L225 Difference]: With dead ends: 266 [2022-11-02 20:57:26,286 INFO L226 Difference]: Without dead ends: 266 [2022-11-02 20:57:26,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:57:26,286 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 72 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:26,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 786 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:57:26,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-11-02 20:57:26,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2022-11-02 20:57:26,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 239 states have (on average 1.3096234309623431) internal successors, (313), 264 states have internal predecessors, (313), 0 states have call successors, (0), 0 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-02 20:57:26,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 313 transitions. [2022-11-02 20:57:26,292 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 313 transitions. Word has length 36 [2022-11-02 20:57:26,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:26,292 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 313 transitions. [2022-11-02 20:57:26,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-02 20:57:26,292 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 313 transitions. [2022-11-02 20:57:26,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:57:26,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:26,293 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:26,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:57:26,293 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:26,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:26,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1824914429, now seen corresponding path program 1 times [2022-11-02 20:57:26,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:26,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525121249] [2022-11-02 20:57:26,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:26,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:26,433 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-02 20:57:26,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:26,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525121249] [2022-11-02 20:57:26,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525121249] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:26,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:26,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:57:26,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998522496] [2022-11-02 20:57:26,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:26,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:57:26,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:26,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:57:26,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:57:26,436 INFO L87 Difference]: Start difference. First operand 265 states and 313 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 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-02 20:57:26,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:26,664 INFO L93 Difference]: Finished difference Result 275 states and 324 transitions. [2022-11-02 20:57:26,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:57:26,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 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 37 [2022-11-02 20:57:26,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:26,666 INFO L225 Difference]: With dead ends: 275 [2022-11-02 20:57:26,666 INFO L226 Difference]: Without dead ends: 275 [2022-11-02 20:57:26,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:57:26,667 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 31 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:26,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 564 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:57:26,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-02 20:57:26,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2022-11-02 20:57:26,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 236 states have (on average 1.305084745762712) internal successors, (308), 260 states have internal predecessors, (308), 0 states have call successors, (0), 0 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-02 20:57:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 308 transitions. [2022-11-02 20:57:26,672 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 308 transitions. Word has length 37 [2022-11-02 20:57:26,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:26,672 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 308 transitions. [2022-11-02 20:57:26,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 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-02 20:57:26,673 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 308 transitions. [2022-11-02 20:57:26,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:57:26,673 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:26,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:26,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:57:26,673 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:26,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:26,674 INFO L85 PathProgramCache]: Analyzing trace with hash -886173384, now seen corresponding path program 1 times [2022-11-02 20:57:26,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:26,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378592742] [2022-11-02 20:57:26,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:26,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:26,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:57:26,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:26,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378592742] [2022-11-02 20:57:26,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378592742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:26,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:26,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:26,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268739511] [2022-11-02 20:57:26,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:26,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:26,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:26,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:26,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:26,711 INFO L87 Difference]: Start difference. First operand 261 states and 308 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 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-02 20:57:26,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:26,749 INFO L93 Difference]: Finished difference Result 274 states and 312 transitions. [2022-11-02 20:57:26,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:26,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-11-02 20:57:26,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:26,751 INFO L225 Difference]: With dead ends: 274 [2022-11-02 20:57:26,751 INFO L226 Difference]: Without dead ends: 274 [2022-11-02 20:57:26,752 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-02 20:57:26,752 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 91 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:26,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 144 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:26,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-11-02 20:57:26,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 262. [2022-11-02 20:57:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 237 states have (on average 1.3037974683544304) internal successors, (309), 261 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 309 transitions. [2022-11-02 20:57:26,758 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 309 transitions. Word has length 38 [2022-11-02 20:57:26,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:26,758 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 309 transitions. [2022-11-02 20:57:26,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 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-02 20:57:26,758 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 309 transitions. [2022-11-02 20:57:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:57:26,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:26,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:57:26,760 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:26,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:26,760 INFO L85 PathProgramCache]: Analyzing trace with hash 196879808, now seen corresponding path program 1 times [2022-11-02 20:57:26,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:26,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310614819] [2022-11-02 20:57:26,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:26,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:27,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:27,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310614819] [2022-11-02 20:57:27,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310614819] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:27,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:27,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:57:27,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584853584] [2022-11-02 20:57:27,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:27,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:57:27,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:27,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:57:27,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:57:27,666 INFO L87 Difference]: Start difference. First operand 262 states and 309 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 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-02 20:57:28,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:28,883 INFO L93 Difference]: Finished difference Result 422 states and 457 transitions. [2022-11-02 20:57:28,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:57:28,884 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 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 39 [2022-11-02 20:57:28,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:28,885 INFO L225 Difference]: With dead ends: 422 [2022-11-02 20:57:28,886 INFO L226 Difference]: Without dead ends: 422 [2022-11-02 20:57:28,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2022-11-02 20:57:28,887 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 818 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:28,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 1059 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:57:28,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-11-02 20:57:28,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 262. [2022-11-02 20:57:28,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 237 states have (on average 1.2995780590717299) internal successors, (308), 261 states have internal predecessors, (308), 0 states have call successors, (0), 0 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-02 20:57:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 308 transitions. [2022-11-02 20:57:28,894 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 308 transitions. Word has length 39 [2022-11-02 20:57:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:28,895 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 308 transitions. [2022-11-02 20:57:28,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 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-02 20:57:28,895 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 308 transitions. [2022-11-02 20:57:28,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:57:28,896 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:28,896 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:28,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:57:28,897 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:28,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:28,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2051878023, now seen corresponding path program 1 times [2022-11-02 20:57:28,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:28,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596311451] [2022-11-02 20:57:28,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:28,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:57:28,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:28,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596311451] [2022-11-02 20:57:28,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596311451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:28,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:28,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:28,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487659810] [2022-11-02 20:57:28,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:28,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:28,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:28,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:28,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:28,949 INFO L87 Difference]: Start difference. First operand 262 states and 308 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-02 20:57:29,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:29,013 INFO L93 Difference]: Finished difference Result 264 states and 309 transitions. [2022-11-02 20:57:29,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:29,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-11-02 20:57:29,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:29,015 INFO L225 Difference]: With dead ends: 264 [2022-11-02 20:57:29,015 INFO L226 Difference]: Without dead ends: 264 [2022-11-02 20:57:29,017 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-02 20:57:29,018 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 82 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:29,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 159 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:57:29,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-11-02 20:57:29,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 260. [2022-11-02 20:57:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 236 states have (on average 1.2923728813559323) internal successors, (305), 259 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-02 20:57:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 305 transitions. [2022-11-02 20:57:29,026 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 305 transitions. Word has length 41 [2022-11-02 20:57:29,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:29,027 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 305 transitions. [2022-11-02 20:57:29,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-02 20:57:29,027 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 305 transitions. [2022-11-02 20:57:29,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:57:29,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:29,028 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] [2022-11-02 20:57:29,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:57:29,029 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:29,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:29,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1173136884, now seen corresponding path program 1 times [2022-11-02 20:57:29,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:29,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325681000] [2022-11-02 20:57:29,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:29,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:29,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:29,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:29,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325681000] [2022-11-02 20:57:29,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325681000] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:29,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421219920] [2022-11-02 20:57:29,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:29,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:29,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:29,315 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:57:29,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:57:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:29,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-02 20:57:29,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:29,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:29,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:29,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:57:29,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:57:29,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:29,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:29,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:57:29,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:57:29,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:57:29,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421219920] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:57:29,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:57:29,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 9 [2022-11-02 20:57:29,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68043617] [2022-11-02 20:57:29,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:57:29,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:57:29,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:29,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:57:29,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:57:29,810 INFO L87 Difference]: Start difference. First operand 260 states and 305 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-02 20:57:30,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:30,295 INFO L93 Difference]: Finished difference Result 352 states and 387 transitions. [2022-11-02 20:57:30,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:57:30,295 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 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 41 [2022-11-02 20:57:30,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:30,297 INFO L225 Difference]: With dead ends: 352 [2022-11-02 20:57:30,297 INFO L226 Difference]: Without dead ends: 352 [2022-11-02 20:57:30,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:57:30,298 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 176 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:30,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 802 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:57:30,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-11-02 20:57:30,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 284. [2022-11-02 20:57:30,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 260 states have (on average 1.3038461538461539) internal successors, (339), 283 states have internal predecessors, (339), 0 states have call successors, (0), 0 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-02 20:57:30,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 339 transitions. [2022-11-02 20:57:30,305 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 339 transitions. Word has length 41 [2022-11-02 20:57:30,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:30,305 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 339 transitions. [2022-11-02 20:57:30,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-02 20:57:30,305 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 339 transitions. [2022-11-02 20:57:30,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:57:30,306 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:30,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:30,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:57:30,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-02 20:57:30,519 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:30,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:30,519 INFO L85 PathProgramCache]: Analyzing trace with hash 816295160, now seen corresponding path program 1 times [2022-11-02 20:57:30,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:30,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961589965] [2022-11-02 20:57:30,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:30,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:57:30,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:30,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961589965] [2022-11-02 20:57:30,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961589965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:30,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:30,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:57:30,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710940291] [2022-11-02 20:57:30,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:30,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:57:30,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:30,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:57:30,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:57:30,800 INFO L87 Difference]: Start difference. First operand 284 states and 339 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 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-02 20:57:31,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:31,212 INFO L93 Difference]: Finished difference Result 348 states and 397 transitions. [2022-11-02 20:57:31,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:57:31,213 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 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-02 20:57:31,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:31,214 INFO L225 Difference]: With dead ends: 348 [2022-11-02 20:57:31,214 INFO L226 Difference]: Without dead ends: 348 [2022-11-02 20:57:31,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:57:31,215 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 405 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:31,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 461 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:57:31,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-11-02 20:57:31,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 291. [2022-11-02 20:57:31,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 267 states have (on average 1.303370786516854) internal successors, (348), 290 states have internal predecessors, (348), 0 states have call successors, (0), 0 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-02 20:57:31,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 348 transitions. [2022-11-02 20:57:31,221 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 348 transitions. Word has length 42 [2022-11-02 20:57:31,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:31,221 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 348 transitions. [2022-11-02 20:57:31,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 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-02 20:57:31,221 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 348 transitions. [2022-11-02 20:57:31,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:57:31,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:31,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:31,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-02 20:57:31,222 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:31,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:31,223 INFO L85 PathProgramCache]: Analyzing trace with hash 816295161, now seen corresponding path program 1 times [2022-11-02 20:57:31,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:31,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649021797] [2022-11-02 20:57:31,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:31,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:31,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:57:31,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:31,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649021797] [2022-11-02 20:57:31,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649021797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:31,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:31,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:57:31,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69775225] [2022-11-02 20:57:31,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:31,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:57:31,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:31,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:57:31,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:57:31,656 INFO L87 Difference]: Start difference. First operand 291 states and 348 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 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-02 20:57:32,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:32,272 INFO L93 Difference]: Finished difference Result 348 states and 397 transitions. [2022-11-02 20:57:32,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:57:32,273 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 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-02 20:57:32,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:32,274 INFO L225 Difference]: With dead ends: 348 [2022-11-02 20:57:32,274 INFO L226 Difference]: Without dead ends: 348 [2022-11-02 20:57:32,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:57:32,275 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 248 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:32,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 632 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:57:32,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-11-02 20:57:32,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 297. [2022-11-02 20:57:32,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 273 states have (on average 1.3003663003663004) internal successors, (355), 296 states have internal predecessors, (355), 0 states have call successors, (0), 0 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-02 20:57:32,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 355 transitions. [2022-11-02 20:57:32,282 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 355 transitions. Word has length 42 [2022-11-02 20:57:32,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:32,282 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 355 transitions. [2022-11-02 20:57:32,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 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-02 20:57:32,283 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 355 transitions. [2022-11-02 20:57:32,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:57:32,283 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:32,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:32,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-02 20:57:32,284 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:32,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:32,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2007506213, now seen corresponding path program 1 times [2022-11-02 20:57:32,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:32,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605824732] [2022-11-02 20:57:32,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:32,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:32,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:57:32,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:32,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605824732] [2022-11-02 20:57:32,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605824732] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:32,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913061778] [2022-11-02 20:57:32,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:32,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:32,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:32,383 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:57:32,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:57:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:32,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-02 20:57:32,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:32,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:57:32,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:57:32,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:57:32,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913061778] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:57:32,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:57:32,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-11-02 20:57:32,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752493388] [2022-11-02 20:57:32,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:57:32,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:57:32,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:32,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:57:32,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:57:32,689 INFO L87 Difference]: Start difference. First operand 297 states and 355 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 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-02 20:57:32,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:32,801 INFO L93 Difference]: Finished difference Result 328 states and 386 transitions. [2022-11-02 20:57:32,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:57:32,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 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 42 [2022-11-02 20:57:32,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:32,803 INFO L225 Difference]: With dead ends: 328 [2022-11-02 20:57:32,803 INFO L226 Difference]: Without dead ends: 304 [2022-11-02 20:57:32,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:57:32,803 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:32,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 1 Unchecked, 0.1s Time] [2022-11-02 20:57:32,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-11-02 20:57:32,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2022-11-02 20:57:32,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 280 states have (on average 1.292857142857143) internal successors, (362), 303 states have internal predecessors, (362), 0 states have call successors, (0), 0 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-02 20:57:32,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 362 transitions. [2022-11-02 20:57:32,811 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 362 transitions. Word has length 42 [2022-11-02 20:57:32,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:32,812 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 362 transitions. [2022-11-02 20:57:32,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 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-02 20:57:32,812 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 362 transitions. [2022-11-02 20:57:32,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:57:32,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:32,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:32,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:57:33,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-02 20:57:33,027 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:33,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:33,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1167718218, now seen corresponding path program 1 times [2022-11-02 20:57:33,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:33,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522664832] [2022-11-02 20:57:33,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:33,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:33,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:33,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:33,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522664832] [2022-11-02 20:57:33,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522664832] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:33,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:33,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:57:33,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140416747] [2022-11-02 20:57:33,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:33,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:33,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:33,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:33,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:33,077 INFO L87 Difference]: Start difference. First operand 304 states and 362 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-02 20:57:33,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:33,092 INFO L93 Difference]: Finished difference Result 458 states and 556 transitions. [2022-11-02 20:57:33,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:33,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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-02 20:57:33,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:33,095 INFO L225 Difference]: With dead ends: 458 [2022-11-02 20:57:33,095 INFO L226 Difference]: Without dead ends: 458 [2022-11-02 20:57:33,095 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-02 20:57:33,096 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 54 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:33,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 318 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:57:33,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-11-02 20:57:33,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 340. [2022-11-02 20:57:33,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 316 states have (on average 1.3259493670886076) internal successors, (419), 339 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:33,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 419 transitions. [2022-11-02 20:57:33,103 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 419 transitions. Word has length 44 [2022-11-02 20:57:33,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:33,104 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 419 transitions. [2022-11-02 20:57:33,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-02 20:57:33,104 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 419 transitions. [2022-11-02 20:57:33,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:57:33,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:33,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:33,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-02 20:57:33,105 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:33,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:33,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1519355336, now seen corresponding path program 1 times [2022-11-02 20:57:33,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:33,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22398822] [2022-11-02 20:57:33,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:33,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:33,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:33,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22398822] [2022-11-02 20:57:33,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22398822] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:33,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:33,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:57:33,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264202312] [2022-11-02 20:57:33,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:33,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:57:33,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:33,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:57:33,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:57:33,433 INFO L87 Difference]: Start difference. First operand 340 states and 419 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-02 20:57:33,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:33,957 INFO L93 Difference]: Finished difference Result 370 states and 439 transitions. [2022-11-02 20:57:33,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:57:33,957 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 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-02 20:57:33,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:33,959 INFO L225 Difference]: With dead ends: 370 [2022-11-02 20:57:33,959 INFO L226 Difference]: Without dead ends: 370 [2022-11-02 20:57:33,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:57:33,960 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 131 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:33,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 514 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:57:33,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-11-02 20:57:33,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 340. [2022-11-02 20:57:33,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 316 states have (on average 1.3227848101265822) internal successors, (418), 339 states have internal predecessors, (418), 0 states have call successors, (0), 0 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-02 20:57:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 418 transitions. [2022-11-02 20:57:33,967 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 418 transitions. Word has length 44 [2022-11-02 20:57:33,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:33,967 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 418 transitions. [2022-11-02 20:57:33,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-02 20:57:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 418 transitions. [2022-11-02 20:57:33,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:57:33,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:33,969 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2022-11-02 20:57:33,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-02 20:57:33,969 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:33,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:33,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1190454621, now seen corresponding path program 1 times [2022-11-02 20:57:33,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:33,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996098800] [2022-11-02 20:57:33,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:33,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:34,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:34,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:34,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996098800] [2022-11-02 20:57:34,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996098800] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:34,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:34,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:57:34,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312462900] [2022-11-02 20:57:34,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:34,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:57:34,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:34,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:57:34,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:57:34,075 INFO L87 Difference]: Start difference. First operand 340 states and 418 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 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-02 20:57:34,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:34,196 INFO L93 Difference]: Finished difference Result 287 states and 330 transitions. [2022-11-02 20:57:34,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:57:34,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 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 46 [2022-11-02 20:57:34,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:34,198 INFO L225 Difference]: With dead ends: 287 [2022-11-02 20:57:34,198 INFO L226 Difference]: Without dead ends: 287 [2022-11-02 20:57:34,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:57:34,199 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 54 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:34,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 504 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:57:34,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-11-02 20:57:34,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 286. [2022-11-02 20:57:34,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 263 states have (on average 1.2509505703422052) internal successors, (329), 285 states have internal predecessors, (329), 0 states have call successors, (0), 0 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-02 20:57:34,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 329 transitions. [2022-11-02 20:57:34,204 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 329 transitions. Word has length 46 [2022-11-02 20:57:34,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:34,205 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 329 transitions. [2022-11-02 20:57:34,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 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-02 20:57:34,205 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 329 transitions. [2022-11-02 20:57:34,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-02 20:57:34,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:34,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:34,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-02 20:57:34,206 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:34,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:34,206 INFO L85 PathProgramCache]: Analyzing trace with hash 120277254, now seen corresponding path program 1 times [2022-11-02 20:57:34,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:34,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873030771] [2022-11-02 20:57:34,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:34,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:34,508 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-02 20:57:34,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:34,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873030771] [2022-11-02 20:57:34,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873030771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:34,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:34,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:57:34,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379461539] [2022-11-02 20:57:34,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:34,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:57:34,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:34,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:57:34,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:57:34,511 INFO L87 Difference]: Start difference. First operand 286 states and 329 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 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-02 20:57:35,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:35,009 INFO L93 Difference]: Finished difference Result 279 states and 317 transitions. [2022-11-02 20:57:35,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:57:35,009 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 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-02 20:57:35,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:35,010 INFO L225 Difference]: With dead ends: 279 [2022-11-02 20:57:35,010 INFO L226 Difference]: Without dead ends: 279 [2022-11-02 20:57:35,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:57:35,011 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 406 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:35,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 639 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:57:35,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-02 20:57:35,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2022-11-02 20:57:35,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 240 states have (on average 1.2666666666666666) internal successors, (304), 262 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-02 20:57:35,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 304 transitions. [2022-11-02 20:57:35,016 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 304 transitions. Word has length 49 [2022-11-02 20:57:35,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:35,016 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 304 transitions. [2022-11-02 20:57:35,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 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-02 20:57:35,017 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 304 transitions. [2022-11-02 20:57:35,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-02 20:57:35,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:35,017 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, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:35,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-02 20:57:35,018 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:35,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:35,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1590511077, now seen corresponding path program 1 times [2022-11-02 20:57:35,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:35,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111744374] [2022-11-02 20:57:35,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:35,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:35,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:57:35,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:35,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111744374] [2022-11-02 20:57:35,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111744374] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:35,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:35,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:57:35,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115385348] [2022-11-02 20:57:35,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:35,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:57:35,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:35,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:57:35,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:57:35,186 INFO L87 Difference]: Start difference. First operand 263 states and 304 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 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-02 20:57:35,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:35,311 INFO L93 Difference]: Finished difference Result 277 states and 318 transitions. [2022-11-02 20:57:35,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:57:35,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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-02 20:57:35,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:35,312 INFO L225 Difference]: With dead ends: 277 [2022-11-02 20:57:35,312 INFO L226 Difference]: Without dead ends: 277 [2022-11-02 20:57:35,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:57:35,313 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 19 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:35,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 474 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:57:35,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-11-02 20:57:35,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 266. [2022-11-02 20:57:35,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 243 states have (on average 1.2592592592592593) internal successors, (306), 265 states have internal predecessors, (306), 0 states have call successors, (0), 0 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-02 20:57:35,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 306 transitions. [2022-11-02 20:57:35,319 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 306 transitions. Word has length 50 [2022-11-02 20:57:35,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:35,319 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 306 transitions. [2022-11-02 20:57:35,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 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-02 20:57:35,320 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 306 transitions. [2022-11-02 20:57:35,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:57:35,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:35,320 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:35,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-02 20:57:35,321 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:35,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:35,321 INFO L85 PathProgramCache]: Analyzing trace with hash -97333738, now seen corresponding path program 1 times [2022-11-02 20:57:35,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:35,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857882784] [2022-11-02 20:57:35,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:35,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:35,657 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-02 20:57:35,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:35,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857882784] [2022-11-02 20:57:35,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857882784] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:35,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256996679] [2022-11-02 20:57:35,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:35,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:35,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:35,659 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:57:35,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:57:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:35,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-02 20:57:35,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:35,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:35,965 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:57:35,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:36,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:36,149 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:57:36,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:36,256 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:57:36,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:36,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:57:36,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-11-02 20:57:36,550 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-02 20:57:36,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:57:37,034 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:37,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:37,045 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:37,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:37,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 [2022-11-02 20:57:41,768 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-02 20:57:41,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256996679] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:57:41,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:57:41,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-11-02 20:57:41,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128112581] [2022-11-02 20:57:41,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:57:41,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-02 20:57:41,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:41,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-02 20:57:41,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=735, Unknown=5, NotChecked=0, Total=870 [2022-11-02 20:57:41,771 INFO L87 Difference]: Start difference. First operand 266 states and 306 transitions. Second operand has 30 states, 29 states have (on average 5.206896551724138) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-02 20:57:42,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:42,777 INFO L93 Difference]: Finished difference Result 550 states and 621 transitions. [2022-11-02 20:57:42,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:57:42,777 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 5.206896551724138) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 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 52 [2022-11-02 20:57:42,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:42,779 INFO L225 Difference]: With dead ends: 550 [2022-11-02 20:57:42,779 INFO L226 Difference]: Without dead ends: 550 [2022-11-02 20:57:42,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=255, Invalid=1146, Unknown=5, NotChecked=0, Total=1406 [2022-11-02 20:57:42,780 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 918 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 1827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 730 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:42,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1601 Invalid, 1827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1034 Invalid, 0 Unknown, 730 Unchecked, 0.7s Time] [2022-11-02 20:57:42,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-11-02 20:57:42,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 312. [2022-11-02 20:57:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 289 states have (on average 1.2560553633217992) internal successors, (363), 311 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:42,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 363 transitions. [2022-11-02 20:57:42,789 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 363 transitions. Word has length 52 [2022-11-02 20:57:42,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:42,789 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 363 transitions. [2022-11-02 20:57:42,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 5.206896551724138) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-02 20:57:42,789 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 363 transitions. [2022-11-02 20:57:42,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:57:42,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:42,795 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:42,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:57:43,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:43,017 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:43,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:43,017 INFO L85 PathProgramCache]: Analyzing trace with hash -97333737, now seen corresponding path program 1 times [2022-11-02 20:57:43,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:43,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315976761] [2022-11-02 20:57:43,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:43,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:43,593 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-02 20:57:43,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:43,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315976761] [2022-11-02 20:57:43,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315976761] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:43,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137886659] [2022-11-02 20:57:43,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:43,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:43,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:43,595 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:57:43,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:57:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:43,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-02 20:57:43,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:43,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:43,871 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:57:43,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:43,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:43,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:43,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:44,077 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:57:44,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:44,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:44,102 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:57:44,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:44,229 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:57:44,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:44,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:44,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:57:44,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-11-02 20:57:44,481 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:57:44,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-11-02 20:57:44,542 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-02 20:57:44,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:57:45,035 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1128 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_73| Int)) (or (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_73|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1128) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_73|))) (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_73|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_73| |c_ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_1129 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_73| Int)) (or (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_73|))) (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_73|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_73| |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2022-11-02 20:57:45,234 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1128 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_73| Int)) (or (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_73|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1128) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_73|))) (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_73|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_73| |c_ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_1129 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_73| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_73|)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_73|) 4)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_73| |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2022-11-02 20:57:45,259 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1128 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_73| Int)) (or (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1129) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_73|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1128) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_73|))) (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_73|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_73| |c_ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_1129 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_73| Int)) (or (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1129) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_73|) 4)) (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_73|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_73| |c_ULTIMATE.start_main_~list~0#1.offset|)))))) is different from false [2022-11-02 20:57:45,296 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:45,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:45,306 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:45,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:45,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 [2022-11-02 20:57:45,358 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:45,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:45,370 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:45,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:45,375 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:57:45,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:45,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:45,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 19 [2022-11-02 20:57:45,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:57:45,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:45,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:45,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 12 [2022-11-02 20:57:45,749 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-02 20:57:45,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137886659] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:57:45,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:57:45,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-02 20:57:45,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330954338] [2022-11-02 20:57:45,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:57:45,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-02 20:57:45,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:45,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-02 20:57:45,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=728, Unknown=3, NotChecked=168, Total=992 [2022-11-02 20:57:45,752 INFO L87 Difference]: Start difference. First operand 312 states and 363 transitions. Second operand has 32 states, 31 states have (on average 4.967741935483871) internal successors, (154), 32 states have internal predecessors, (154), 0 states have call successors, (0), 0 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-02 20:57:48,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:48,259 INFO L93 Difference]: Finished difference Result 445 states and 499 transitions. [2022-11-02 20:57:48,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 20:57:48,259 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.967741935483871) internal successors, (154), 32 states have internal predecessors, (154), 0 states have call successors, (0), 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 52 [2022-11-02 20:57:48,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:48,261 INFO L225 Difference]: With dead ends: 445 [2022-11-02 20:57:48,261 INFO L226 Difference]: Without dead ends: 445 [2022-11-02 20:57:48,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=376, Invalid=2388, Unknown=4, NotChecked=312, Total=3080 [2022-11-02 20:57:48,262 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 682 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 1501 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 2630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1090 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:48,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1717 Invalid, 2630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1501 Invalid, 0 Unknown, 1090 Unchecked, 1.0s Time] [2022-11-02 20:57:48,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2022-11-02 20:57:48,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 329. [2022-11-02 20:57:48,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 306 states have (on average 1.261437908496732) internal successors, (386), 328 states have internal predecessors, (386), 0 states have call successors, (0), 0 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-02 20:57:48,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 386 transitions. [2022-11-02 20:57:48,268 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 386 transitions. Word has length 52 [2022-11-02 20:57:48,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:48,269 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 386 transitions. [2022-11-02 20:57:48,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.967741935483871) internal successors, (154), 32 states have internal predecessors, (154), 0 states have call successors, (0), 0 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-02 20:57:48,269 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 386 transitions. [2022-11-02 20:57:48,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-02 20:57:48,270 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:48,270 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:48,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:57:48,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:48,471 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:48,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:48,471 INFO L85 PathProgramCache]: Analyzing trace with hash 2084299753, now seen corresponding path program 1 times [2022-11-02 20:57:48,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:48,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039208883] [2022-11-02 20:57:48,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:48,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:49,387 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-02 20:57:49,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:49,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039208883] [2022-11-02 20:57:49,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039208883] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:49,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654124098] [2022-11-02 20:57:49,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:49,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:49,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:49,389 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:57:49,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:57:49,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:49,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-02 20:57:49,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:49,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:49,604 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:57:49,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:49,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-02 20:57:49,721 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:57:49,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 35 [2022-11-02 20:57:49,811 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:57:49,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 35 [2022-11-02 20:57:49,946 INFO L356 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2022-11-02 20:57:49,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2022-11-02 20:57:50,022 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-02 20:57:50,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 36 [2022-11-02 20:57:50,450 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:57:50,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 118 treesize of output 100 [2022-11-02 20:57:50,794 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:57:50,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 118 treesize of output 100 [2022-11-02 20:57:51,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 17 [2022-11-02 20:57:51,359 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-02 20:57:51,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:57:51,401 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1236 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1236) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1)) is different from false [2022-11-02 20:57:51,479 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1236 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1236) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1)) is different from false [2022-11-02 20:57:51,618 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1236 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_14| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14| 1) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_14| v_ArrVal_1236) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|) 0)))) is different from false [2022-11-02 20:57:51,674 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1231 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_14| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14| 1) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1231))) (store .cse0 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|))) |v_ULTIMATE.start_main_#t~malloc10#1.base_14| v_ArrVal_1236) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|) 0)))) is different from false [2022-11-02 20:57:53,328 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:53,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 95 treesize of output 66 [2022-11-02 20:57:53,336 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:57:53,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 546 treesize of output 524 [2022-11-02 20:57:53,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 596 treesize of output 564 [2022-11-02 20:57:53,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 548 treesize of output 508 [2022-11-02 20:57:53,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 528 treesize of output 484 [2022-11-02 20:57:53,745 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-02 20:57:53,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654124098] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:57:53,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:57:53,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 17] total 42 [2022-11-02 20:57:53,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100359606] [2022-11-02 20:57:53,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:57:53,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-02 20:57:53,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:53,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-02 20:57:53,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1244, Unknown=32, NotChecked=308, Total=1806 [2022-11-02 20:57:53,748 INFO L87 Difference]: Start difference. First operand 329 states and 386 transitions. Second operand has 43 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 43 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-02 20:57:59,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:59,191 INFO L93 Difference]: Finished difference Result 610 states and 701 transitions. [2022-11-02 20:57:59,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-02 20:57:59,191 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 43 states have internal predecessors, (139), 0 states have call successors, (0), 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 55 [2022-11-02 20:57:59,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:59,193 INFO L225 Difference]: With dead ends: 610 [2022-11-02 20:57:59,193 INFO L226 Difference]: Without dead ends: 610 [2022-11-02 20:57:59,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 1140 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=569, Invalid=3633, Unknown=104, NotChecked=524, Total=4830 [2022-11-02 20:57:59,195 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 572 mSDsluCounter, 2710 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 2862 SdHoareTripleChecker+Invalid, 3113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1975 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:59,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 2862 Invalid, 3113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1098 Invalid, 0 Unknown, 1975 Unchecked, 0.8s Time] [2022-11-02 20:57:59,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-11-02 20:57:59,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 361. [2022-11-02 20:57:59,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 338 states have (on average 1.2455621301775148) internal successors, (421), 360 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:59,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 421 transitions. [2022-11-02 20:57:59,202 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 421 transitions. Word has length 55 [2022-11-02 20:57:59,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:59,203 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 421 transitions. [2022-11-02 20:57:59,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 43 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-02 20:57:59,203 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 421 transitions. [2022-11-02 20:57:59,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-02 20:57:59,204 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:59,204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:59,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:57:59,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-11-02 20:57:59,417 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:57:59,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:59,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2084299754, now seen corresponding path program 1 times [2022-11-02 20:57:59,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:59,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493953069] [2022-11-02 20:57:59,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:59,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:01,735 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-02 20:58:01,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:01,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493953069] [2022-11-02 20:58:01,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493953069] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:01,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716987524] [2022-11-02 20:58:01,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:01,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:01,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:01,737 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:01,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:58:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:01,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-02 20:58:01,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:01,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:58:01,979 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:58:01,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:58:01,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:58:02,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-02 20:58:02,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-02 20:58:02,219 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:58:02,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 54 [2022-11-02 20:58:02,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-02 20:58:02,356 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:58:02,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 54 [2022-11-02 20:58:02,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-02 20:58:02,610 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-11-02 20:58:02,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 20:58:02,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-02 20:58:02,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:58:02,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-02 20:58:02,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:58:02,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:58:03,026 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:58:03,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 49 [2022-11-02 20:58:03,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:58:03,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-11-02 20:58:03,238 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:58:03,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 57 [2022-11-02 20:58:03,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-11-02 20:58:03,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:58:03,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-02 20:58:03,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:58:03,728 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:03,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 21 [2022-11-02 20:58:03,823 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-02 20:58:03,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:04,036 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)))) (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 4))))) is different from false [2022-11-02 20:58:04,093 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)))))) is different from false [2022-11-02 20:58:04,103 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) is different from false [2022-11-02 20:58:04,123 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.offset|))) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (<= (+ 8 (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ 4 (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) is different from false [2022-11-02 20:58:05,928 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_84| Int) (v_ArrVal_1343 (Array Int Int)) (v_ArrVal_1342 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_17| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_17|) 0)) (forall ((v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (<= (+ 8 (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1342))) (store .cse0 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_84| 0))) |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1344) (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1343))) (store .cse2 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_84| |v_ULTIMATE.start_main_#t~malloc10#1.base_17|))) |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_84| |c_ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_84| Int) (v_ArrVal_1342 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_17| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_17|) 0)) (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ 4 (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1342))) (store .cse3 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_84| 0))) |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_84| |c_ULTIMATE.start_main_~list~0#1.offset|)))))) is different from false [2022-11-02 20:58:17,153 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:17,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 184 treesize of output 175 [2022-11-02 20:58:17,163 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:17,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 164 treesize of output 115 [2022-11-02 20:58:17,169 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:58:17,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 624 treesize of output 594 [2022-11-02 20:58:17,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:58:17,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2484 treesize of output 2450 [2022-11-02 20:58:17,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:58:17,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2346 treesize of output 2218 [2022-11-02 20:58:17,237 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:58:17,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2122 treesize of output 1994 [2022-11-02 20:58:17,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:58:17,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1946 treesize of output 1882 [2022-11-02 20:58:17,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:58:17,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1842 treesize of output 1774 [2022-11-02 20:58:17,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:58:17,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1730 treesize of output 1550 [2022-11-02 20:58:17,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:58:17,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1462 treesize of output 1286 [2022-11-02 20:58:19,454 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:19,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 92 treesize of output 83 [2022-11-02 20:58:19,465 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:19,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 72 treesize of output 63 [2022-11-02 20:58:19,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 108 treesize of output 90 [2022-11-02 20:58:19,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:58:19,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 152 treesize of output 146 [2022-11-02 20:58:19,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 98 treesize of output 82 [2022-11-02 20:58:19,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:58:19,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 79 treesize of output 75 [2022-11-02 20:58:19,505 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:58:19,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 106 treesize of output 94 [2022-11-02 20:58:19,511 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:58:19,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 96 treesize of output 84 [2022-11-02 20:58:19,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 83 treesize of output 81 [2022-11-02 20:58:25,875 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-02 20:58:25,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716987524] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:58:25,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:58:25,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 17] total 44 [2022-11-02 20:58:25,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928689792] [2022-11-02 20:58:25,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:58:25,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-02 20:58:25,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:25,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-02 20:58:25,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1383, Unknown=25, NotChecked=400, Total=1980 [2022-11-02 20:58:25,878 INFO L87 Difference]: Start difference. First operand 361 states and 421 transitions. Second operand has 45 states, 44 states have (on average 3.6136363636363638) internal successors, (159), 45 states have internal predecessors, (159), 0 states have call successors, (0), 0 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-02 20:58:38,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:38,393 INFO L93 Difference]: Finished difference Result 689 states and 760 transitions. [2022-11-02 20:58:38,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-11-02 20:58:38,394 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 3.6136363636363638) internal successors, (159), 45 states have internal predecessors, (159), 0 states have call successors, (0), 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 55 [2022-11-02 20:58:38,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:38,396 INFO L225 Difference]: With dead ends: 689 [2022-11-02 20:58:38,396 INFO L226 Difference]: Without dead ends: 689 [2022-11-02 20:58:38,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2259 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=1053, Invalid=7129, Unknown=28, NotChecked=910, Total=9120 [2022-11-02 20:58:38,399 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 1878 mSDsluCounter, 2347 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1878 SdHoareTripleChecker+Valid, 2472 SdHoareTripleChecker+Invalid, 3762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2443 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:38,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1878 Valid, 2472 Invalid, 3762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1149 Invalid, 0 Unknown, 2443 Unchecked, 1.3s Time] [2022-11-02 20:58:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2022-11-02 20:58:38,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 409. [2022-11-02 20:58:38,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 387 states have (on average 1.2118863049095607) internal successors, (469), 408 states have internal predecessors, (469), 0 states have call successors, (0), 0 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-02 20:58:38,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 469 transitions. [2022-11-02 20:58:38,413 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 469 transitions. Word has length 55 [2022-11-02 20:58:38,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:38,414 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 469 transitions. [2022-11-02 20:58:38,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.6136363636363638) internal successors, (159), 45 states have internal predecessors, (159), 0 states have call successors, (0), 0 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-02 20:58:38,414 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 469 transitions. [2022-11-02 20:58:38,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-02 20:58:38,415 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:38,416 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:38,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:38,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:38,631 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:58:38,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:38,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1738644409, now seen corresponding path program 1 times [2022-11-02 20:58:38,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:38,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165865359] [2022-11-02 20:58:38,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:38,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:39,751 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-02 20:58:39,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:39,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165865359] [2022-11-02 20:58:39,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165865359] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:39,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206208740] [2022-11-02 20:58:39,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:39,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:39,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:39,755 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:39,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:58:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:39,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-02 20:58:39,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:39,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:58:39,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-02 20:58:39,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-02 20:58:40,125 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:58:40,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:58:40,213 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-02 20:58:40,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 26 [2022-11-02 20:58:40,237 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-02 20:58:40,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-11-02 20:58:40,609 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:58:40,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 80 treesize of output 70 [2022-11-02 20:58:40,624 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:58:40,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 89 treesize of output 89 [2022-11-02 20:58:40,882 INFO L356 Elim1Store]: treesize reduction 4, result has 94.9 percent of original size [2022-11-02 20:58:40,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 84 treesize of output 140 [2022-11-02 20:58:41,355 INFO L356 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2022-11-02 20:58:41,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 65 [2022-11-02 20:58:41,373 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:58:41,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 113 treesize of output 113 [2022-11-02 20:58:41,687 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:58:41,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 118 treesize of output 106 [2022-11-02 20:58:41,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 105 treesize of output 105 [2022-11-02 20:58:42,000 INFO L356 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2022-11-02 20:58:42,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 162 treesize of output 140 [2022-11-02 20:58:42,015 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:58:42,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 129 treesize of output 129 [2022-11-02 20:58:42,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 113 treesize of output 101 [2022-11-02 20:58:43,810 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:43,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 129 [2022-11-02 20:58:43,825 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:43,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 58 [2022-11-02 20:58:44,221 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-02 20:58:44,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:44,599 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (or (forall ((v_ArrVal_1466 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1466) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) 1)) (forall ((v_ArrVal_1467 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1467) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 0))) (forall ((v_ArrVal_1466 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1466) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))) (or (= .cse1 0) (= (select |c_#valid| .cse1) 1)))))) is different from false [2022-11-02 20:58:44,617 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4))) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_1466 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1466) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 0)))) (or (forall ((v_ArrVal_1466 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1466) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) 1)) (forall ((v_ArrVal_1467 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1467) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 0))))) is different from false [2022-11-02 20:58:44,653 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1464))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) .cse3))) (or (forall ((v_ArrVal_1467 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1465) .cse0 v_ArrVal_1467) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1466 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse2 .cse0 v_ArrVal_1466) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) 1)))))) (forall ((v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse4 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1464))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~end~0#1.base|) .cse3) v_ArrVal_1466)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse4 0) (= (select |c_#valid| .cse4) 1)))))) is different from false [2022-11-02 20:58:44,677 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1464))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) .cse2) v_ArrVal_1466)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 0)))) (forall ((v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1464))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~end~0#1.base|) .cse2))) (or (forall ((v_ArrVal_1466 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse5 .cse6 v_ArrVal_1466) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4)) 1)) (forall ((v_ArrVal_1467 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1465) .cse6 v_ArrVal_1467) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) 0))))))))) is different from false [2022-11-02 20:58:44,731 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:44,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 283 [2022-11-02 20:58:44,995 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse2 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse6 .cse2 |c_ULTIMATE.start_main_#t~malloc13#1.base|)))) (or (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_prenex_6))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) .cse2) v_prenex_5)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (or (= .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) (= .cse0 0)))) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1464))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~end~0#1.base|) .cse2) v_ArrVal_1466)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) |c_ULTIMATE.start_main_~end~0#1.base|))))) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse10 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse6 .cse10 |c_ULTIMATE.start_main_#t~malloc13#1.base|)))) (let ((.cse8 (store .cse11 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1464))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~end~0#1.base|) .cse10))) (or (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1465) .cse7 v_ArrVal_1467) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) 0)) (= (select (select (store .cse8 .cse7 v_ArrVal_1466) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (select (let ((.cse9 (store .cse11 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_prenex_6))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~end~0#1.base|) .cse10) v_prenex_5)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) |c_ULTIMATE.start_main_~end~0#1.base|)))))))) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse15 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse6 .cse15 |c_ULTIMATE.start_main_#t~malloc13#1.base|)))) (let ((.cse12 (select (select (let ((.cse17 (store .cse16 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1464))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~end~0#1.base|) .cse15) v_ArrVal_1466)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (or (= .cse12 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse13 (select (select (let ((.cse14 (store .cse16 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_prenex_6))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~end~0#1.base|) .cse15) v_prenex_5)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (or (= .cse13 |c_ULTIMATE.start_main_~end~0#1.base|) (= .cse12 .cse13) (= .cse13 0))))))))) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse20 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse6 .cse20 |c_ULTIMATE.start_main_#t~malloc13#1.base|)))) (let ((.cse18 (select (select (let ((.cse22 (store .cse21 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_prenex_6))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~end~0#1.base|) .cse20) v_prenex_5)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (or (= .cse18 |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (let ((.cse19 (store .cse21 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1464))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~end~0#1.base|) .cse20) v_ArrVal_1466)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) .cse18) (= .cse18 0)))))) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse27 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse6 .cse27 |c_ULTIMATE.start_main_#t~malloc13#1.base|)))) (let ((.cse29 (store .cse28 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1464))) (let ((.cse23 (select (select .cse29 |c_ULTIMATE.start_main_~end~0#1.base|) .cse27))) (let ((.cse24 (select (select (store .cse29 .cse23 v_ArrVal_1466) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (or (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1465) .cse23 v_ArrVal_1467) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) 0)) (= .cse24 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse25 (select (select (let ((.cse26 (store .cse28 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_prenex_6))) (store .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~end~0#1.base|) .cse27) v_prenex_5)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (or (= .cse25 |c_ULTIMATE.start_main_~end~0#1.base|) (= .cse24 .cse25))))))))))) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse32 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse33 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse6 .cse32 |c_ULTIMATE.start_main_#t~malloc13#1.base|)))) (let ((.cse35 (store .cse33 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1464))) (let ((.cse34 (select (select .cse35 |c_ULTIMATE.start_main_~end~0#1.base|) .cse32))) (let ((.cse30 (select (select (store .cse35 .cse34 v_ArrVal_1466) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (or (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= .cse30 (select (select (let ((.cse31 (store .cse33 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_prenex_6))) (store .cse31 (select (select .cse31 |c_ULTIMATE.start_main_~end~0#1.base|) .cse32) v_prenex_5)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1465) .cse34 v_ArrVal_1467) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) 0)) (= .cse30 |c_ULTIMATE.start_main_~end~0#1.base|)))))))))) is different from false [2022-11-02 20:58:47,775 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:47,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 158 treesize of output 126 [2022-11-02 20:58:47,796 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:47,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 153 treesize of output 126 [2022-11-02 20:58:47,820 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:47,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 121 treesize of output 99 [2022-11-02 20:58:47,865 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:47,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 116 treesize of output 99 [2022-11-02 20:58:54,303 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-11-02 20:58:54,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 64 treesize of output 70 [2022-11-02 20:58:54,348 INFO L356 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2022-11-02 20:58:54,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 116 treesize of output 102 [2022-11-02 20:58:54,367 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:54,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 711 treesize of output 565 [2022-11-02 20:58:54,380 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:58:54,393 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 20:58:54,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 138 treesize of output 116 [2022-11-02 20:58:54,428 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:54,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 554 treesize of output 450 [2022-11-02 20:58:54,449 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:54,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 361 treesize of output 293 [2022-11-02 20:58:54,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 290 treesize of output 250 [2022-11-02 20:58:54,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 42 [2022-11-02 20:58:54,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 52 [2022-11-02 20:58:55,245 INFO L356 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2022-11-02 20:58:55,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 129 treesize of output 102 [2022-11-02 20:58:55,260 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:55,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2152 treesize of output 1708 [2022-11-02 20:58:55,289 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:55,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1672 treesize of output 1172 [2022-11-02 20:58:55,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 740 treesize of output 676 [2022-11-02 20:58:55,337 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:55,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 676 treesize of output 596 [2022-11-02 20:58:55,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 416 treesize of output 384 [2022-11-02 20:58:55,397 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:58:55,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 384 treesize of output 336 [2022-11-02 20:58:56,992 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-02 20:58:56,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206208740] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:58:56,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:58:56,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 19] total 51 [2022-11-02 20:58:56,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293978987] [2022-11-02 20:58:56,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:58:56,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-02 20:58:56,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:56,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-02 20:58:56,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1867, Unknown=18, NotChecked=460, Total=2550 [2022-11-02 20:58:56,994 INFO L87 Difference]: Start difference. First operand 409 states and 469 transitions. Second operand has 51 states, 51 states have (on average 2.9607843137254903) internal successors, (151), 51 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-02 20:59:14,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:14,305 INFO L93 Difference]: Finished difference Result 436 states and 498 transitions. [2022-11-02 20:59:14,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:59:14,306 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.9607843137254903) internal successors, (151), 51 states have internal predecessors, (151), 0 states have call successors, (0), 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 55 [2022-11-02 20:59:14,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:14,307 INFO L225 Difference]: With dead ends: 436 [2022-11-02 20:59:14,307 INFO L226 Difference]: Without dead ends: 436 [2022-11-02 20:59:14,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=372, Invalid=3281, Unknown=27, NotChecked=610, Total=4290 [2022-11-02 20:59:14,309 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 193 mSDsluCounter, 1808 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1921 SdHoareTripleChecker+Invalid, 1856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1399 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:14,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1921 Invalid, 1856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 443 Invalid, 0 Unknown, 1399 Unchecked, 0.4s Time] [2022-11-02 20:59:14,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-11-02 20:59:14,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 430. [2022-11-02 20:59:14,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 408 states have (on average 1.2058823529411764) internal successors, (492), 429 states have internal predecessors, (492), 0 states have call successors, (0), 0 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-02 20:59:14,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 492 transitions. [2022-11-02 20:59:14,317 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 492 transitions. Word has length 55 [2022-11-02 20:59:14,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:14,318 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 492 transitions. [2022-11-02 20:59:14,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.9607843137254903) internal successors, (151), 51 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-02 20:59:14,318 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 492 transitions. [2022-11-02 20:59:14,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 20:59:14,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:14,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:14,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:59:14,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:14,543 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:59:14,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:14,543 INFO L85 PathProgramCache]: Analyzing trace with hash 320505786, now seen corresponding path program 1 times [2022-11-02 20:59:14,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:14,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889885674] [2022-11-02 20:59:14,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:14,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:15,203 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-02 20:59:15,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:15,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889885674] [2022-11-02 20:59:15,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889885674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:59:15,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:59:15,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:59:15,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072655934] [2022-11-02 20:59:15,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:59:15,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:59:15,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:15,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:59:15,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:59:15,205 INFO L87 Difference]: Start difference. First operand 430 states and 492 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-02 20:59:15,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:15,987 INFO L93 Difference]: Finished difference Result 454 states and 506 transitions. [2022-11-02 20:59:15,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:59:15,987 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-11-02 20:59:15,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:15,988 INFO L225 Difference]: With dead ends: 454 [2022-11-02 20:59:15,989 INFO L226 Difference]: Without dead ends: 454 [2022-11-02 20:59:15,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:59:15,989 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 256 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:15,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 699 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:59:15,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-11-02 20:59:15,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 430. [2022-11-02 20:59:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 408 states have (on average 1.2034313725490196) internal successors, (491), 429 states have internal predecessors, (491), 0 states have call successors, (0), 0 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-02 20:59:15,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 491 transitions. [2022-11-02 20:59:15,997 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 491 transitions. Word has length 56 [2022-11-02 20:59:15,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:15,997 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 491 transitions. [2022-11-02 20:59:15,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-02 20:59:15,998 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 491 transitions. [2022-11-02 20:59:15,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-02 20:59:15,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:15,998 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:15,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-02 20:59:15,999 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-02 20:59:15,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:15,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1557310441, now seen corresponding path program 1 times [2022-11-02 20:59:16,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:16,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041334854] [2022-11-02 20:59:16,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:16,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:17,760 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-02 20:59:17,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:17,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041334854] [2022-11-02 20:59:17,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041334854] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:59:17,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401460781] [2022-11-02 20:59:17,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:17,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:17,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:59:17,762 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:59:17,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc25084d-8c02-401a-8d56-7f91a306759a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:59:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:17,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-02 20:59:17,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:17,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:59:17,993 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:59:17,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:59:18,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-02 20:59:18,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-02 20:59:18,178 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:59:18,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2022-11-02 20:59:18,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-02 20:59:18,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:59:18,294 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-02 20:59:18,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 84 treesize of output 56 [2022-11-02 20:59:18,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2022-11-02 20:59:18,636 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-11-02 20:59:18,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 20:59:18,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:18,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:18,731 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:59:18,734 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:59:18,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 61 [2022-11-02 20:59:18,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:18,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-02 20:59:19,089 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:59:19,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 72 treesize of output 68 [2022-11-02 20:59:19,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:19,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2022-11-02 20:59:19,341 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:59:19,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 79 treesize of output 76 [2022-11-02 20:59:19,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2022-11-02 20:59:20,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:20,154 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:59:20,161 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-02 20:59:20,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 45 [2022-11-02 20:59:20,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:20,177 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:59:20,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 21 [2022-11-02 20:59:20,182 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-02 20:59:20,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:59:20,422 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1611))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1610) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 4)) 0)) (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1610))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1611) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (+ (select (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 4))) 0)))) is different from false [2022-11-02 20:59:20,479 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1610))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1611) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 4))) 0)) (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1611))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1610) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 4)) 0)))) is different from false [2022-11-02 20:59:20,497 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1610))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1611) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 4))) 0)) (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1611))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1610) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 4)) 0)))) is different from false [2022-11-02 20:59:20,520 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) (.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.offset|)))) (and (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1611))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (+ 4 (select (select (store .cse3 |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1610) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) 0)) (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (let ((.cse4 (store .cse3 |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1610))) (select (select .cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1611) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (+ 4 (select (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) 0)))) is different from false [2022-11-02 20:59:28,261 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:59:28,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 612 treesize of output 523 [2022-11-02 20:59:28,271 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:59:28,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 512 treesize of output 323 [2022-11-02 20:59:28,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:59:28,722 INFO L356 Elim1Store]: treesize reduction 288, result has 35.9 percent of original size [2022-11-02 20:59:28,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 1314600 treesize of output 1215011 [2022-11-02 20:59:30,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:30,299 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:59:30,730 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:59:30,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7636680 treesize of output 7144766 [2022-11-02 20:59:48,530 WARN L234 SmtUtils]: Spent 17.79s on a formula simplification that was a NOOP. DAG size: 2658 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 20:59:49,751 INFO L356 Elim1Store]: treesize reduction 244, result has 52.3 percent of original size [2022-11-02 20:59:49,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7144214 treesize of output 5745760 [2022-11-02 21:00:08,052 WARN L234 SmtUtils]: Spent 18.29s on a formula simplification that was a NOOP. DAG size: 2689 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 21:00:08,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:00:08,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:00:08,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:00:09,603 INFO L356 Elim1Store]: treesize reduction 338, result has 46.9 percent of original size [2022-11-02 21:00:09,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 7177220 treesize of output 6042754