./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b 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_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-01-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN --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 652acbc8fb2d659424086f7ee4bd5fc2f45ff1d49f46cde68db4fdee1ed0638e --- 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-6b4ec56 [2022-11-20 12:17:29,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:17:29,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:17:29,135 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:17:29,136 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:17:29,137 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:17:29,139 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:17:29,140 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:17:29,142 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:17:29,143 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:17:29,145 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:17:29,146 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:17:29,146 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:17:29,148 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:17:29,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:17:29,150 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:17:29,156 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:17:29,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:17:29,159 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:17:29,161 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:17:29,166 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:17:29,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:17:29,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:17:29,172 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:17:29,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:17:29,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:17:29,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:17:29,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:17:29,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:17:29,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:17:29,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:17:29,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:17:29,193 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:17:29,194 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:17:29,196 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:17:29,196 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:17:29,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:17:29,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:17:29,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:17:29,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:17:29,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:17:29,203 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 12:17:29,231 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:17:29,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:17:29,232 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:17:29,232 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:17:29,233 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:17:29,234 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:17:29,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:17:29,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:17:29,235 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:17:29,236 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:17:29,237 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:17:29,237 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 12:17:29,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:17:29,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:17:29,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:17:29,238 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 12:17:29,239 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 12:17:29,239 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 12:17:29,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:17:29,239 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 12:17:29,240 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:17:29,240 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:17:29,240 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:17:29,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:17:29,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:17:29,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:17:29,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:17:29,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:17:29,243 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:17:29,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:17:29,243 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_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/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_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN 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 -> 652acbc8fb2d659424086f7ee4bd5fc2f45ff1d49f46cde68db4fdee1ed0638e [2022-11-20 12:17:29,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:17:29,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:17:29,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:17:29,550 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:17:29,551 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:17:29,552 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/forester-heap/dll-01-2.i [2022-11-20 12:17:32,618 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:17:32,915 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:17:32,915 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i [2022-11-20 12:17:32,940 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/data/46e3af7b3/c8c821991af6478d8e70c5eb977bc661/FLAGec6fce743 [2022-11-20 12:17:32,962 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/data/46e3af7b3/c8c821991af6478d8e70c5eb977bc661 [2022-11-20 12:17:32,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:17:32,966 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:17:32,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:17:32,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:17:32,976 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:17:32,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:17:32" (1/1) ... [2022-11-20 12:17:32,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11436814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:17:32, skipping insertion in model container [2022-11-20 12:17:32,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:17:32" (1/1) ... [2022-11-20 12:17:32,986 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:17:33,028 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:17:33,317 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[22080,22093] [2022-11-20 12:17:33,338 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[22353,22366] [2022-11-20 12:17:33,343 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[22587,22600] [2022-11-20 12:17:33,344 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[22657,22670] [2022-11-20 12:17:33,350 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[22924,22937] [2022-11-20 12:17:33,354 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[23032,23045] [2022-11-20 12:17:33,359 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[23263,23276] [2022-11-20 12:17:33,361 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[23343,23356] [2022-11-20 12:17:33,362 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[23422,23435] [2022-11-20 12:17:33,364 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[23512,23525] [2022-11-20 12:17:33,371 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[23690,23703] [2022-11-20 12:17:33,373 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[23768,23781] [2022-11-20 12:17:33,376 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[23845,23858] [2022-11-20 12:17:33,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:17:33,400 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:17:33,453 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[22080,22093] [2022-11-20 12:17:33,455 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[22353,22366] [2022-11-20 12:17:33,457 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[22587,22600] [2022-11-20 12:17:33,458 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[22657,22670] [2022-11-20 12:17:33,461 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[22924,22937] [2022-11-20 12:17:33,462 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[23032,23045] [2022-11-20 12:17:33,467 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[23263,23276] [2022-11-20 12:17:33,469 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[23343,23356] [2022-11-20 12:17:33,469 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[23422,23435] [2022-11-20 12:17:33,470 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[23512,23525] [2022-11-20 12:17:33,472 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[23690,23703] [2022-11-20 12:17:33,480 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[23768,23781] [2022-11-20 12:17:33,482 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/sv-benchmarks/c/forester-heap/dll-01-2.i[23845,23858] [2022-11-20 12:17:33,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:17:33,516 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:17:33,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:17:33 WrapperNode [2022-11-20 12:17:33,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:17:33,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:17:33,518 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:17:33,518 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:17:33,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:17:33" (1/1) ... [2022-11-20 12:17:33,543 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:17:33" (1/1) ... [2022-11-20 12:17:33,589 INFO L138 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 231 [2022-11-20 12:17:33,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:17:33,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:17:33,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:17:33,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:17:33,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:17:33" (1/1) ... [2022-11-20 12:17:33,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:17:33" (1/1) ... [2022-11-20 12:17:33,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:17:33" (1/1) ... [2022-11-20 12:17:33,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:17:33" (1/1) ... [2022-11-20 12:17:33,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:17:33" (1/1) ... [2022-11-20 12:17:33,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:17:33" (1/1) ... [2022-11-20 12:17:33,660 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:17:33" (1/1) ... [2022-11-20 12:17:33,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:17:33" (1/1) ... [2022-11-20 12:17:33,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:17:33,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:17:33,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:17:33,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:17:33,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:17:33" (1/1) ... [2022-11-20 12:17:33,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:17:33,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:17:33,719 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:17:33,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:17:33,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 12:17:33,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:17:33,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 12:17:33,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 12:17:33,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:17:33,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:17:33,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:17:33,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:17:33,885 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:17:33,887 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:17:34,618 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:17:34,625 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:17:34,626 INFO L300 CfgBuilder]: Removed 30 assume(true) statements. [2022-11-20 12:17:34,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:17:34 BoogieIcfgContainer [2022-11-20 12:17:34,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:17:34,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:17:34,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:17:34,634 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:17:34,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:17:32" (1/3) ... [2022-11-20 12:17:34,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dacb407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:17:34, skipping insertion in model container [2022-11-20 12:17:34,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:17:33" (2/3) ... [2022-11-20 12:17:34,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dacb407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:17:34, skipping insertion in model container [2022-11-20 12:17:34,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:17:34" (3/3) ... [2022-11-20 12:17:34,638 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2022-11-20 12:17:34,665 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:17:34,666 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 86 error locations. [2022-11-20 12:17:34,730 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:17:34,738 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;@3384ec5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:17:34,739 INFO L358 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2022-11-20 12:17:34,745 INFO L276 IsEmpty]: Start isEmpty. Operand has 203 states, 116 states have (on average 2.1982758620689653) internal successors, (255), 202 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:34,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 12:17:34,751 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:34,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 12:17:34,753 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:34,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:34,762 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-20 12:17:34,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:34,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629083561] [2022-11-20 12:17:34,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:34,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:35,021 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-20 12:17:35,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:35,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629083561] [2022-11-20 12:17:35,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629083561] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:35,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:35,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:17:35,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344155750] [2022-11-20 12:17:35,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:35,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:17:35,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:35,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:17:35,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:17:35,078 INFO L87 Difference]: Start difference. First operand has 203 states, 116 states have (on average 2.1982758620689653) internal successors, (255), 202 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-20 12:17:35,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:35,322 INFO L93 Difference]: Finished difference Result 201 states and 210 transitions. [2022-11-20 12:17:35,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:17:35,324 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-20 12:17:35,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:35,334 INFO L225 Difference]: With dead ends: 201 [2022-11-20 12:17:35,334 INFO L226 Difference]: Without dead ends: 197 [2022-11-20 12:17:35,347 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-20 12:17:35,350 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 191 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:35,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 124 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:17:35,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-20 12:17:35,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2022-11-20 12:17:35,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 117 states have (on average 1.7435897435897436) internal successors, (204), 192 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:35,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 204 transitions. [2022-11-20 12:17:35,421 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 204 transitions. Word has length 3 [2022-11-20 12:17:35,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:35,422 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 204 transitions. [2022-11-20 12:17:35,422 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-20 12:17:35,422 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 204 transitions. [2022-11-20 12:17:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 12:17:35,422 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:35,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 12:17:35,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:17:35,423 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:35,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:35,424 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-20 12:17:35,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:35,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049942131] [2022-11-20 12:17:35,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:35,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:35,553 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-20 12:17:35,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:35,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049942131] [2022-11-20 12:17:35,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049942131] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:35,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:35,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:17:35,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100812839] [2022-11-20 12:17:35,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:35,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:17:35,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:35,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:17:35,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:17:35,563 INFO L87 Difference]: Start difference. First operand 193 states and 204 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-20 12:17:35,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:35,839 INFO L93 Difference]: Finished difference Result 222 states and 232 transitions. [2022-11-20 12:17:35,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:17:35,840 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-20 12:17:35,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:35,842 INFO L225 Difference]: With dead ends: 222 [2022-11-20 12:17:35,845 INFO L226 Difference]: Without dead ends: 222 [2022-11-20 12:17:35,845 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-20 12:17:35,846 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 181 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:35,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 149 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:17:35,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-11-20 12:17:35,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2022-11-20 12:17:35,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 134 states have (on average 1.671641791044776) internal successors, (224), 201 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:35,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 224 transitions. [2022-11-20 12:17:35,863 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 224 transitions. Word has length 3 [2022-11-20 12:17:35,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:35,864 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 224 transitions. [2022-11-20 12:17:35,864 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-20 12:17:35,865 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 224 transitions. [2022-11-20 12:17:35,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 12:17:35,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:35,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 12:17:35,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:17:35,866 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:35,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:35,872 INFO L85 PathProgramCache]: Analyzing trace with hash 889446311, now seen corresponding path program 1 times [2022-11-20 12:17:35,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:35,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11032607] [2022-11-20 12:17:35,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:35,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:35,914 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-20 12:17:35,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:35,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11032607] [2022-11-20 12:17:35,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11032607] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:35,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:35,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:17:35,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998008780] [2022-11-20 12:17:35,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:35,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:17:35,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:35,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:17:35,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:17:35,918 INFO L87 Difference]: Start difference. First operand 202 states and 224 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:35,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:35,970 INFO L93 Difference]: Finished difference Result 217 states and 227 transitions. [2022-11-20 12:17:35,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:17:35,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-20 12:17:35,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:35,972 INFO L225 Difference]: With dead ends: 217 [2022-11-20 12:17:35,973 INFO L226 Difference]: Without dead ends: 217 [2022-11-20 12:17:35,973 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-20 12:17:35,974 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 177 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:35,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 204 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:17:35,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-11-20 12:17:35,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2022-11-20 12:17:35,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 199 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:35,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 221 transitions. [2022-11-20 12:17:35,983 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 221 transitions. Word has length 6 [2022-11-20 12:17:35,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:35,984 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 221 transitions. [2022-11-20 12:17:35,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:35,984 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2022-11-20 12:17:35,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 12:17:35,985 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:35,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:17:35,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:17:35,985 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:35,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:35,986 INFO L85 PathProgramCache]: Analyzing trace with hash 2020777177, now seen corresponding path program 1 times [2022-11-20 12:17:35,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:35,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471783568] [2022-11-20 12:17:35,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:35,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:36,241 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-20 12:17:36,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:36,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471783568] [2022-11-20 12:17:36,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471783568] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:36,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:36,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:17:36,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000789753] [2022-11-20 12:17:36,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:36,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:17:36,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:36,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:17:36,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:17:36,245 INFO L87 Difference]: Start difference. First operand 200 states and 221 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:36,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:36,480 INFO L93 Difference]: Finished difference Result 199 states and 220 transitions. [2022-11-20 12:17:36,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:17:36,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 12:17:36,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:36,482 INFO L225 Difference]: With dead ends: 199 [2022-11-20 12:17:36,482 INFO L226 Difference]: Without dead ends: 199 [2022-11-20 12:17:36,483 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-20 12:17:36,484 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 5 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:36,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 539 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:17:36,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-11-20 12:17:36,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2022-11-20 12:17:36,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 198 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:36,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 220 transitions. [2022-11-20 12:17:36,493 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 220 transitions. Word has length 12 [2022-11-20 12:17:36,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:36,494 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 220 transitions. [2022-11-20 12:17:36,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:36,494 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 220 transitions. [2022-11-20 12:17:36,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 12:17:36,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:36,495 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:17:36,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:17:36,495 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:36,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:36,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2020777178, now seen corresponding path program 1 times [2022-11-20 12:17:36,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:36,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105080710] [2022-11-20 12:17:36,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:36,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:36,751 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-20 12:17:36,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:36,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105080710] [2022-11-20 12:17:36,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105080710] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:36,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:36,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:17:36,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960700433] [2022-11-20 12:17:36,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:36,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:17:36,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:36,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:17:36,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:17:36,757 INFO L87 Difference]: Start difference. First operand 199 states and 220 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:37,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:37,032 INFO L93 Difference]: Finished difference Result 198 states and 219 transitions. [2022-11-20 12:17:37,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:17:37,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 12:17:37,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:37,039 INFO L225 Difference]: With dead ends: 198 [2022-11-20 12:17:37,039 INFO L226 Difference]: Without dead ends: 198 [2022-11-20 12:17:37,039 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-20 12:17:37,042 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 3 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:37,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 548 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:17:37,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-20 12:17:37,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-11-20 12:17:37,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 197 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-20 12:17:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 219 transitions. [2022-11-20 12:17:37,056 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 219 transitions. Word has length 12 [2022-11-20 12:17:37,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:37,057 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 219 transitions. [2022-11-20 12:17:37,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:37,057 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2022-11-20 12:17:37,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 12:17:37,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:37,058 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:17:37,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:17:37,058 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:37,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:37,059 INFO L85 PathProgramCache]: Analyzing trace with hash 373192235, now seen corresponding path program 1 times [2022-11-20 12:17:37,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:37,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853928261] [2022-11-20 12:17:37,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:37,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:37,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-20 12:17:37,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:37,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853928261] [2022-11-20 12:17:37,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853928261] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:37,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:37,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:17:37,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412263403] [2022-11-20 12:17:37,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:37,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:17:37,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:37,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:17:37,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:17:37,113 INFO L87 Difference]: Start difference. First operand 198 states and 219 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-20 12:17:37,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:37,123 INFO L93 Difference]: Finished difference Result 199 states and 220 transitions. [2022-11-20 12:17:37,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:17:37,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-20 12:17:37,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:37,125 INFO L225 Difference]: With dead ends: 199 [2022-11-20 12:17:37,125 INFO L226 Difference]: Without dead ends: 199 [2022-11-20 12:17:37,126 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-20 12:17:37,130 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 368 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-20 12:17:37,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 368 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:17:37,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-11-20 12:17:37,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2022-11-20 12:17:37,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 134 states have (on average 1.6417910447761195) internal successors, (220), 198 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:37,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 220 transitions. [2022-11-20 12:17:37,141 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 220 transitions. Word has length 14 [2022-11-20 12:17:37,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:37,141 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 220 transitions. [2022-11-20 12:17:37,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-20 12:17:37,142 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 220 transitions. [2022-11-20 12:17:37,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 12:17:37,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:37,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:17:37,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:17:37,143 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:37,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:37,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1583692102, now seen corresponding path program 1 times [2022-11-20 12:17:37,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:37,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205708831] [2022-11-20 12:17:37,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:37,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:37,394 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-20 12:17:37,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:37,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205708831] [2022-11-20 12:17:37,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205708831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:37,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:37,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:17:37,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405533423] [2022-11-20 12:17:37,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:37,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:17:37,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:37,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:17:37,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:17:37,397 INFO L87 Difference]: Start difference. First operand 199 states and 220 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 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-20 12:17:37,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:37,743 INFO L93 Difference]: Finished difference Result 198 states and 219 transitions. [2022-11-20 12:17:37,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:17:37,744 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 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-20 12:17:37,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:37,745 INFO L225 Difference]: With dead ends: 198 [2022-11-20 12:17:37,745 INFO L226 Difference]: Without dead ends: 198 [2022-11-20 12:17:37,745 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-20 12:17:37,746 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 178 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:37,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 456 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:17:37,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-20 12:17:37,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-11-20 12:17:37,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 134 states have (on average 1.6343283582089552) internal successors, (219), 197 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-20 12:17:37,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 219 transitions. [2022-11-20 12:17:37,752 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 219 transitions. Word has length 15 [2022-11-20 12:17:37,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:37,752 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 219 transitions. [2022-11-20 12:17:37,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 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-20 12:17:37,752 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2022-11-20 12:17:37,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 12:17:37,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:37,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:17:37,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:17:37,754 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:37,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:37,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1583692101, now seen corresponding path program 1 times [2022-11-20 12:17:37,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:37,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728485635] [2022-11-20 12:17:37,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:37,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:38,067 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-20 12:17:38,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:38,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728485635] [2022-11-20 12:17:38,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728485635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:38,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:38,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:17:38,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363383374] [2022-11-20 12:17:38,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:38,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:17:38,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:38,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:17:38,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:17:38,070 INFO L87 Difference]: Start difference. First operand 198 states and 219 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 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-20 12:17:38,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:38,596 INFO L93 Difference]: Finished difference Result 197 states and 218 transitions. [2022-11-20 12:17:38,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:17:38,597 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 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-20 12:17:38,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:38,598 INFO L225 Difference]: With dead ends: 197 [2022-11-20 12:17:38,598 INFO L226 Difference]: Without dead ends: 197 [2022-11-20 12:17:38,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:17:38,599 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 172 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:38,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 577 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:17:38,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-20 12:17:38,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2022-11-20 12:17:38,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 134 states have (on average 1.626865671641791) internal successors, (218), 196 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2022-11-20 12:17:38,603 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 15 [2022-11-20 12:17:38,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:38,603 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2022-11-20 12:17:38,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 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-20 12:17:38,604 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2022-11-20 12:17:38,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 12:17:38,604 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:38,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:17:38,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:17:38,604 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:38,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:38,605 INFO L85 PathProgramCache]: Analyzing trace with hash -2137878992, now seen corresponding path program 1 times [2022-11-20 12:17:38,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:38,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973723632] [2022-11-20 12:17:38,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:38,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:38,785 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-20 12:17:38,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:38,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973723632] [2022-11-20 12:17:38,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973723632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:38,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:38,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:17:38,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689430677] [2022-11-20 12:17:38,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:38,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:17:38,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:38,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:17:38,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:17:38,789 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:39,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:39,072 INFO L93 Difference]: Finished difference Result 289 states and 316 transitions. [2022-11-20 12:17:39,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:17:39,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 12:17:39,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:39,074 INFO L225 Difference]: With dead ends: 289 [2022-11-20 12:17:39,074 INFO L226 Difference]: Without dead ends: 289 [2022-11-20 12:17:39,074 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-20 12:17:39,075 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 200 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:39,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 651 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:17:39,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-11-20 12:17:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 194. [2022-11-20 12:17:39,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 132 states have (on average 1.628787878787879) internal successors, (215), 193 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-20 12:17:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 215 transitions. [2022-11-20 12:17:39,079 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 215 transitions. Word has length 16 [2022-11-20 12:17:39,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:39,080 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 215 transitions. [2022-11-20 12:17:39,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:39,080 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 215 transitions. [2022-11-20 12:17:39,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 12:17:39,080 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:39,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:17:39,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:17:39,081 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:39,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:39,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1339025717, now seen corresponding path program 1 times [2022-11-20 12:17:39,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:39,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027339576] [2022-11-20 12:17:39,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:39,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:39,240 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-20 12:17:39,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:39,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027339576] [2022-11-20 12:17:39,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027339576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:39,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:39,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:17:39,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936564227] [2022-11-20 12:17:39,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:39,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:17:39,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:39,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:17:39,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:17:39,243 INFO L87 Difference]: Start difference. First operand 194 states and 215 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:39,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:39,419 INFO L93 Difference]: Finished difference Result 290 states and 316 transitions. [2022-11-20 12:17:39,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:17:39,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 12:17:39,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:39,422 INFO L225 Difference]: With dead ends: 290 [2022-11-20 12:17:39,422 INFO L226 Difference]: Without dead ends: 290 [2022-11-20 12:17:39,422 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-20 12:17:39,423 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 102 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:39,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 614 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:17:39,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-11-20 12:17:39,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 197. [2022-11-20 12:17:39,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 135 states have (on average 1.614814814814815) internal successors, (218), 196 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:39,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2022-11-20 12:17:39,429 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 18 [2022-11-20 12:17:39,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:39,430 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2022-11-20 12:17:39,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:39,430 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2022-11-20 12:17:39,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 12:17:39,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:39,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:17:39,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:17:39,432 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:39,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:39,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1029802310, now seen corresponding path program 1 times [2022-11-20 12:17:39,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:39,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437018983] [2022-11-20 12:17:39,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:39,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:39,550 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-20 12:17:39,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:39,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437018983] [2022-11-20 12:17:39,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437018983] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:39,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:39,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:17:39,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308714609] [2022-11-20 12:17:39,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:39,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:17:39,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:39,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:17:39,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:17:39,552 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:39,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:39,723 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2022-11-20 12:17:39,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:17:39,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 12:17:39,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:39,724 INFO L225 Difference]: With dead ends: 191 [2022-11-20 12:17:39,724 INFO L226 Difference]: Without dead ends: 191 [2022-11-20 12:17:39,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-20 12:17:39,725 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 258 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:39,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 118 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:17:39,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-20 12:17:39,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187. [2022-11-20 12:17:39,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 186 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:39,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 208 transitions. [2022-11-20 12:17:39,729 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 208 transitions. Word has length 20 [2022-11-20 12:17:39,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:39,729 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 208 transitions. [2022-11-20 12:17:39,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:39,730 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 208 transitions. [2022-11-20 12:17:39,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 12:17:39,730 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:39,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:17:39,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 12:17:39,733 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:39,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:39,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1029802309, now seen corresponding path program 1 times [2022-11-20 12:17:39,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:39,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401118010] [2022-11-20 12:17:39,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:39,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:39,933 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-20 12:17:39,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:39,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401118010] [2022-11-20 12:17:39,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401118010] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:39,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:39,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:17:39,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515580208] [2022-11-20 12:17:39,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:39,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:17:39,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:39,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:17:39,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:17:39,936 INFO L87 Difference]: Start difference. First operand 187 states and 208 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:40,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:40,287 INFO L93 Difference]: Finished difference Result 248 states and 262 transitions. [2022-11-20 12:17:40,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:17:40,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 12:17:40,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:40,289 INFO L225 Difference]: With dead ends: 248 [2022-11-20 12:17:40,289 INFO L226 Difference]: Without dead ends: 248 [2022-11-20 12:17:40,289 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-20 12:17:40,290 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 452 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:40,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 255 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:17:40,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-11-20 12:17:40,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 211. [2022-11-20 12:17:40,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 210 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:40,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 246 transitions. [2022-11-20 12:17:40,296 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 246 transitions. Word has length 20 [2022-11-20 12:17:40,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:40,296 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 246 transitions. [2022-11-20 12:17:40,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:40,296 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 246 transitions. [2022-11-20 12:17:40,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 12:17:40,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:40,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:17:40,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 12:17:40,297 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:40,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:40,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1797484881, now seen corresponding path program 1 times [2022-11-20 12:17:40,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:40,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059623106] [2022-11-20 12:17:40,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:40,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:40,377 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-20 12:17:40,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:40,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059623106] [2022-11-20 12:17:40,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059623106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:40,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:40,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:17:40,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137994511] [2022-11-20 12:17:40,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:40,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:17:40,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:40,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:17:40,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:17:40,380 INFO L87 Difference]: Start difference. First operand 211 states and 246 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:40,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:40,520 INFO L93 Difference]: Finished difference Result 243 states and 256 transitions. [2022-11-20 12:17:40,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:17:40,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 12:17:40,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:40,521 INFO L225 Difference]: With dead ends: 243 [2022-11-20 12:17:40,522 INFO L226 Difference]: Without dead ends: 243 [2022-11-20 12:17:40,522 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-20 12:17:40,522 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 235 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:40,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 273 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:17:40,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-20 12:17:40,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 209. [2022-11-20 12:17:40,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 160 states have (on average 1.51875) internal successors, (243), 208 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 243 transitions. [2022-11-20 12:17:40,528 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 243 transitions. Word has length 22 [2022-11-20 12:17:40,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:40,529 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 243 transitions. [2022-11-20 12:17:40,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:40,529 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 243 transitions. [2022-11-20 12:17:40,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 12:17:40,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:40,530 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-20 12:17:40,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 12:17:40,530 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:40,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:40,531 INFO L85 PathProgramCache]: Analyzing trace with hash 110847663, now seen corresponding path program 1 times [2022-11-20 12:17:40,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:40,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482016172] [2022-11-20 12:17:40,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:40,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:40,647 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-20 12:17:40,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:40,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482016172] [2022-11-20 12:17:40,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482016172] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:40,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:40,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:17:40,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303555156] [2022-11-20 12:17:40,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:40,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:17:40,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:40,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:17:40,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:17:40,649 INFO L87 Difference]: Start difference. First operand 209 states and 243 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-20 12:17:40,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:40,861 INFO L93 Difference]: Finished difference Result 208 states and 241 transitions. [2022-11-20 12:17:40,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:17:40,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-20 12:17:40,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:40,862 INFO L225 Difference]: With dead ends: 208 [2022-11-20 12:17:40,863 INFO L226 Difference]: Without dead ends: 208 [2022-11-20 12:17:40,863 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-20 12:17:40,863 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 10 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:40,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 469 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:17:40,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-11-20 12:17:40,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2022-11-20 12:17:40,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 160 states have (on average 1.50625) internal successors, (241), 207 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:40,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 241 transitions. [2022-11-20 12:17:40,868 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 241 transitions. Word has length 23 [2022-11-20 12:17:40,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:40,869 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 241 transitions. [2022-11-20 12:17:40,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-20 12:17:40,869 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 241 transitions. [2022-11-20 12:17:40,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 12:17:40,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:40,869 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-20 12:17:40,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 12:17:40,870 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:40,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:40,870 INFO L85 PathProgramCache]: Analyzing trace with hash 110847664, now seen corresponding path program 1 times [2022-11-20 12:17:40,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:40,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773040155] [2022-11-20 12:17:40,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:40,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:41,075 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-20 12:17:41,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:41,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773040155] [2022-11-20 12:17:41,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773040155] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:41,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:41,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:17:41,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667060906] [2022-11-20 12:17:41,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:41,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:17:41,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:41,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:17:41,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:17:41,077 INFO L87 Difference]: Start difference. First operand 208 states and 241 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-20 12:17:41,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:41,335 INFO L93 Difference]: Finished difference Result 207 states and 239 transitions. [2022-11-20 12:17:41,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:17:41,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-20 12:17:41,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:41,338 INFO L225 Difference]: With dead ends: 207 [2022-11-20 12:17:41,338 INFO L226 Difference]: Without dead ends: 207 [2022-11-20 12:17:41,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:17:41,339 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 5 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:41,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 458 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:17:41,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-11-20 12:17:41,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-11-20 12:17:41,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 160 states have (on average 1.49375) internal successors, (239), 206 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:41,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 239 transitions. [2022-11-20 12:17:41,345 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 239 transitions. Word has length 23 [2022-11-20 12:17:41,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:41,345 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 239 transitions. [2022-11-20 12:17:41,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-20 12:17:41,345 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 239 transitions. [2022-11-20 12:17:41,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 12:17:41,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:41,346 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-20 12:17:41,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 12:17:41,346 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:41,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:41,347 INFO L85 PathProgramCache]: Analyzing trace with hash -398547279, now seen corresponding path program 1 times [2022-11-20 12:17:41,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:41,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536473401] [2022-11-20 12:17:41,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:41,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:41,605 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-20 12:17:41,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:41,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536473401] [2022-11-20 12:17:41,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536473401] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:41,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:41,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:17:41,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122781263] [2022-11-20 12:17:41,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:41,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:17:41,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:41,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:17:41,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:17:41,608 INFO L87 Difference]: Start difference. First operand 207 states and 239 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:42,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:42,041 INFO L93 Difference]: Finished difference Result 206 states and 238 transitions. [2022-11-20 12:17:42,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:17:42,042 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 12:17:42,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:42,043 INFO L225 Difference]: With dead ends: 206 [2022-11-20 12:17:42,043 INFO L226 Difference]: Without dead ends: 206 [2022-11-20 12:17:42,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-20 12:17:42,044 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 254 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:42,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 434 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:17:42,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-20 12:17:42,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-11-20 12:17:42,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 160 states have (on average 1.4875) internal successors, (238), 205 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 238 transitions. [2022-11-20 12:17:42,049 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 238 transitions. Word has length 27 [2022-11-20 12:17:42,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:42,049 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 238 transitions. [2022-11-20 12:17:42,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:42,050 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 238 transitions. [2022-11-20 12:17:42,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 12:17:42,050 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:42,051 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-20 12:17:42,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 12:17:42,051 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:42,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:42,052 INFO L85 PathProgramCache]: Analyzing trace with hash -398547278, now seen corresponding path program 1 times [2022-11-20 12:17:42,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:42,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850745136] [2022-11-20 12:17:42,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:42,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:42,413 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-20 12:17:42,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:42,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850745136] [2022-11-20 12:17:42,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850745136] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:42,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:42,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:17:42,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505312813] [2022-11-20 12:17:42,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:42,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:17:42,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:42,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:17:42,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:17:42,416 INFO L87 Difference]: Start difference. First operand 206 states and 238 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:43,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:43,003 INFO L93 Difference]: Finished difference Result 198 states and 230 transitions. [2022-11-20 12:17:43,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 12:17:43,004 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 12:17:43,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:43,005 INFO L225 Difference]: With dead ends: 198 [2022-11-20 12:17:43,005 INFO L226 Difference]: Without dead ends: 198 [2022-11-20 12:17:43,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-11-20 12:17:43,006 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 270 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:43,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 413 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:17:43,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-20 12:17:43,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 188. [2022-11-20 12:17:43,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 187 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-20 12:17:43,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 219 transitions. [2022-11-20 12:17:43,010 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 219 transitions. Word has length 27 [2022-11-20 12:17:43,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:43,010 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 219 transitions. [2022-11-20 12:17:43,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:43,010 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 219 transitions. [2022-11-20 12:17:43,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 12:17:43,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:43,011 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-20 12:17:43,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 12:17:43,011 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:43,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:43,012 INFO L85 PathProgramCache]: Analyzing trace with hash 329779259, now seen corresponding path program 1 times [2022-11-20 12:17:43,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:43,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546061680] [2022-11-20 12:17:43,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:43,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:43,053 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-20 12:17:43,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:43,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546061680] [2022-11-20 12:17:43,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546061680] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:43,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:43,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:17:43,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188455234] [2022-11-20 12:17:43,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:43,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:17:43,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:43,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:17:43,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:17:43,056 INFO L87 Difference]: Start difference. First operand 188 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-20 12:17:43,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:43,067 INFO L93 Difference]: Finished difference Result 262 states and 307 transitions. [2022-11-20 12:17:43,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:17:43,067 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-20 12:17:43,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:43,069 INFO L225 Difference]: With dead ends: 262 [2022-11-20 12:17:43,069 INFO L226 Difference]: Without dead ends: 262 [2022-11-20 12:17:43,069 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-20 12:17:43,071 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 52 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 303 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-20 12:17:43,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 303 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:17:43,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-20 12:17:43,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 194. [2022-11-20 12:17:43,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 158 states have (on average 1.4367088607594938) internal successors, (227), 193 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:43,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 227 transitions. [2022-11-20 12:17:43,076 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 227 transitions. Word has length 28 [2022-11-20 12:17:43,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:43,076 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 227 transitions. [2022-11-20 12:17:43,076 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-20 12:17:43,077 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 227 transitions. [2022-11-20 12:17:43,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 12:17:43,078 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:43,078 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-20 12:17:43,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 12:17:43,078 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:43,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:43,079 INFO L85 PathProgramCache]: Analyzing trace with hash -751842895, now seen corresponding path program 1 times [2022-11-20 12:17:43,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:43,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179942307] [2022-11-20 12:17:43,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:43,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:43,185 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-20 12:17:43,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:43,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179942307] [2022-11-20 12:17:43,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179942307] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:43,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:43,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:17:43,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613858705] [2022-11-20 12:17:43,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:43,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:17:43,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:43,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:17:43,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:17:43,188 INFO L87 Difference]: Start difference. First operand 194 states and 227 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 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-20 12:17:43,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:43,350 INFO L93 Difference]: Finished difference Result 199 states and 233 transitions. [2022-11-20 12:17:43,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:17:43,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 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-20 12:17:43,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:43,352 INFO L225 Difference]: With dead ends: 199 [2022-11-20 12:17:43,352 INFO L226 Difference]: Without dead ends: 199 [2022-11-20 12:17:43,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:17:43,353 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 360 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:43,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 232 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:17:43,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-11-20 12:17:43,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 190. [2022-11-20 12:17:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 156 states have (on average 1.4294871794871795) internal successors, (223), 189 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 223 transitions. [2022-11-20 12:17:43,357 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 223 transitions. Word has length 29 [2022-11-20 12:17:43,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:43,357 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 223 transitions. [2022-11-20 12:17:43,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 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-20 12:17:43,358 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 223 transitions. [2022-11-20 12:17:43,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 12:17:43,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:43,358 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-20 12:17:43,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 12:17:43,359 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:43,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:43,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1633211075, now seen corresponding path program 1 times [2022-11-20 12:17:43,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:43,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308805474] [2022-11-20 12:17:43,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:43,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:43,395 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-20 12:17:43,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:43,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308805474] [2022-11-20 12:17:43,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308805474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:43,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:43,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:17:43,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238615172] [2022-11-20 12:17:43,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:43,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:17:43,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:43,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:17:43,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:17:43,397 INFO L87 Difference]: Start difference. First operand 190 states and 223 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:43,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:43,415 INFO L93 Difference]: Finished difference Result 188 states and 220 transitions. [2022-11-20 12:17:43,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:17:43,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-20 12:17:43,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:43,417 INFO L225 Difference]: With dead ends: 188 [2022-11-20 12:17:43,417 INFO L226 Difference]: Without dead ends: 188 [2022-11-20 12:17:43,418 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-20 12:17:43,418 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 20 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 266 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-20 12:17:43,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 266 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:17:43,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-11-20 12:17:43,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2022-11-20 12:17:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 187 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 220 transitions. [2022-11-20 12:17:43,423 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 220 transitions. Word has length 29 [2022-11-20 12:17:43,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:43,423 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 220 transitions. [2022-11-20 12:17:43,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 220 transitions. [2022-11-20 12:17:43,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 12:17:43,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:43,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:17:43,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 12:17:43,425 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:43,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:43,426 INFO L85 PathProgramCache]: Analyzing trace with hash -910059888, now seen corresponding path program 1 times [2022-11-20 12:17:43,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:43,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877724104] [2022-11-20 12:17:43,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:43,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:43,704 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-20 12:17:43,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:43,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877724104] [2022-11-20 12:17:43,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877724104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:43,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:43,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:17:43,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293984557] [2022-11-20 12:17:43,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:43,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:17:43,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:43,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:17:43,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:17:43,711 INFO L87 Difference]: Start difference. First operand 188 states and 220 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:44,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:44,155 INFO L93 Difference]: Finished difference Result 291 states and 320 transitions. [2022-11-20 12:17:44,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:17:44,156 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-20 12:17:44,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:44,157 INFO L225 Difference]: With dead ends: 291 [2022-11-20 12:17:44,158 INFO L226 Difference]: Without dead ends: 291 [2022-11-20 12:17:44,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-20 12:17:44,159 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 461 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:44,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 710 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:17:44,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-11-20 12:17:44,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 200. [2022-11-20 12:17:44,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 167 states have (on average 1.3952095808383234) internal successors, (233), 199 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:44,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 233 transitions. [2022-11-20 12:17:44,166 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 233 transitions. Word has length 30 [2022-11-20 12:17:44,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:44,166 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 233 transitions. [2022-11-20 12:17:44,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:44,167 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 233 transitions. [2022-11-20 12:17:44,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 12:17:44,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:44,168 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] [2022-11-20 12:17:44,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 12:17:44,169 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:44,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:44,169 INFO L85 PathProgramCache]: Analyzing trace with hash 2071508259, now seen corresponding path program 1 times [2022-11-20 12:17:44,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:44,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695221112] [2022-11-20 12:17:44,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:44,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:44,456 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-20 12:17:44,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:44,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695221112] [2022-11-20 12:17:44,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695221112] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:17:44,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016724258] [2022-11-20 12:17:44,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:44,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:17:44,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:17:44,461 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:17:44,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:17:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:44,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-20 12:17:44,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:17:44,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 12:17:44,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 12:17:44,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:17:44,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 12:17:44,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:17:44,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 12:17:44,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:17:44,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 12:17:44,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:17:44,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 12:17:44,983 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:17:44,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 12:17:44,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:17:44,994 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:17:44,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-11-20 12:17:45,004 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-20 12:17:45,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:17:45,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-20 12:17:45,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-11-20 12:17:45,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-20 12:17:45,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:17:45,723 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-20 12:17:45,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016724258] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:17:45,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:17:45,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2022-11-20 12:17:45,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906115541] [2022-11-20 12:17:45,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:17:45,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 12:17:45,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:45,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 12:17:45,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:17:45,726 INFO L87 Difference]: Start difference. First operand 200 states and 233 transitions. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:46,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:46,182 INFO L93 Difference]: Finished difference Result 294 states and 323 transitions. [2022-11-20 12:17:46,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:17:46,183 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-20 12:17:46,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:46,184 INFO L225 Difference]: With dead ends: 294 [2022-11-20 12:17:46,185 INFO L226 Difference]: Without dead ends: 294 [2022-11-20 12:17:46,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-11-20 12:17:46,185 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 426 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:46,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 809 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 371 Invalid, 0 Unknown, 47 Unchecked, 0.3s Time] [2022-11-20 12:17:46,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-11-20 12:17:46,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 228. [2022-11-20 12:17:46,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 195 states have (on average 1.405128205128205) internal successors, (274), 227 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:46,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 274 transitions. [2022-11-20 12:17:46,191 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 274 transitions. Word has length 32 [2022-11-20 12:17:46,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:46,191 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 274 transitions. [2022-11-20 12:17:46,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:46,192 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 274 transitions. [2022-11-20 12:17:46,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-20 12:17:46,192 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:46,192 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-20 12:17:46,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 12:17:46,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:17:46,404 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:46,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:46,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1393921825, now seen corresponding path program 1 times [2022-11-20 12:17:46,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:46,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624635751] [2022-11-20 12:17:46,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:46,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:46,763 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-20 12:17:46,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:46,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624635751] [2022-11-20 12:17:46,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624635751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:46,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:46,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 12:17:46,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974459991] [2022-11-20 12:17:46,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:46,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 12:17:46,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:46,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 12:17:46,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:17:46,767 INFO L87 Difference]: Start difference. First operand 228 states and 274 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 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-20 12:17:47,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:47,420 INFO L93 Difference]: Finished difference Result 334 states and 372 transitions. [2022-11-20 12:17:47,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 12:17:47,421 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 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-20 12:17:47,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:47,422 INFO L225 Difference]: With dead ends: 334 [2022-11-20 12:17:47,422 INFO L226 Difference]: Without dead ends: 334 [2022-11-20 12:17:47,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-11-20 12:17:47,423 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 506 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:47,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 769 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 12:17:47,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-11-20 12:17:47,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 229. [2022-11-20 12:17:47,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 198 states have (on average 1.3737373737373737) internal successors, (272), 228 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 272 transitions. [2022-11-20 12:17:47,428 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 272 transitions. Word has length 35 [2022-11-20 12:17:47,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:47,429 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 272 transitions. [2022-11-20 12:17:47,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 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-20 12:17:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 272 transitions. [2022-11-20 12:17:47,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-20 12:17:47,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:47,429 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-20 12:17:47,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 12:17:47,430 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:47,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:47,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1393921826, now seen corresponding path program 1 times [2022-11-20 12:17:47,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:47,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259780952] [2022-11-20 12:17:47,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:47,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:48,075 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-20 12:17:48,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:48,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259780952] [2022-11-20 12:17:48,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259780952] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:48,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:48,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 12:17:48,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881886870] [2022-11-20 12:17:48,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:48,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 12:17:48,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:48,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 12:17:48,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:17:48,077 INFO L87 Difference]: Start difference. First operand 229 states and 272 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 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-20 12:17:49,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:49,093 INFO L93 Difference]: Finished difference Result 408 states and 438 transitions. [2022-11-20 12:17:49,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 12:17:49,094 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 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-20 12:17:49,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:49,096 INFO L225 Difference]: With dead ends: 408 [2022-11-20 12:17:49,096 INFO L226 Difference]: Without dead ends: 408 [2022-11-20 12:17:49,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2022-11-20 12:17:49,097 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 465 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:49,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1009 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 12:17:49,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-11-20 12:17:49,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 235. [2022-11-20 12:17:49,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 204 states have (on average 1.3676470588235294) internal successors, (279), 234 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:49,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 279 transitions. [2022-11-20 12:17:49,103 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 279 transitions. Word has length 35 [2022-11-20 12:17:49,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:49,104 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 279 transitions. [2022-11-20 12:17:49,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 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-20 12:17:49,104 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 279 transitions. [2022-11-20 12:17:49,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 12:17:49,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:49,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] [2022-11-20 12:17:49,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-20 12:17:49,105 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:49,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:49,105 INFO L85 PathProgramCache]: Analyzing trace with hash -470914463, now seen corresponding path program 1 times [2022-11-20 12:17:49,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:49,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146627576] [2022-11-20 12:17:49,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:49,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:49,967 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-20 12:17:49,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:49,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146627576] [2022-11-20 12:17:49,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146627576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:49,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:49,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 12:17:49,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830320297] [2022-11-20 12:17:49,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:49,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 12:17:49,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:49,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 12:17:49,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:17:49,969 INFO L87 Difference]: Start difference. First operand 235 states and 279 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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-20 12:17:51,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:51,483 INFO L93 Difference]: Finished difference Result 338 states and 368 transitions. [2022-11-20 12:17:51,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 12:17:51,483 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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-20 12:17:51,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:51,486 INFO L225 Difference]: With dead ends: 338 [2022-11-20 12:17:51,486 INFO L226 Difference]: Without dead ends: 338 [2022-11-20 12:17:51,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=259, Invalid=1001, Unknown=0, NotChecked=0, Total=1260 [2022-11-20 12:17:51,487 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 611 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:51,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 1002 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 12:17:51,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-11-20 12:17:51,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 235. [2022-11-20 12:17:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 204 states have (on average 1.3627450980392157) internal successors, (278), 234 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:51,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 278 transitions. [2022-11-20 12:17:51,499 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 278 transitions. Word has length 37 [2022-11-20 12:17:51,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:51,500 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 278 transitions. [2022-11-20 12:17:51,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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-20 12:17:51,501 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 278 transitions. [2022-11-20 12:17:51,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 12:17:51,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:51,501 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-20 12:17:51,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-20 12:17:51,502 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:51,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:51,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2012362969, now seen corresponding path program 1 times [2022-11-20 12:17:51,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:51,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033777023] [2022-11-20 12:17:51,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:51,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:51,673 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-20 12:17:51,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:51,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033777023] [2022-11-20 12:17:51,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033777023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:51,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:51,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:17:51,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341595364] [2022-11-20 12:17:51,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:51,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:17:51,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:51,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:17:51,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:17:51,677 INFO L87 Difference]: Start difference. First operand 235 states and 278 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 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-20 12:17:51,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:51,843 INFO L93 Difference]: Finished difference Result 234 states and 277 transitions. [2022-11-20 12:17:51,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:17:51,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 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-20 12:17:51,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:51,844 INFO L225 Difference]: With dead ends: 234 [2022-11-20 12:17:51,844 INFO L226 Difference]: Without dead ends: 234 [2022-11-20 12:17:51,845 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-20 12:17:51,845 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 5 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:51,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 418 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:17:51,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-11-20 12:17:51,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2022-11-20 12:17:51,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 204 states have (on average 1.357843137254902) internal successors, (277), 233 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:51,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 277 transitions. [2022-11-20 12:17:51,850 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 277 transitions. Word has length 37 [2022-11-20 12:17:51,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:51,850 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 277 transitions. [2022-11-20 12:17:51,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 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-20 12:17:51,852 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 277 transitions. [2022-11-20 12:17:51,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 12:17:51,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:51,853 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-20 12:17:51,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-20 12:17:51,853 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:51,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:51,854 INFO L85 PathProgramCache]: Analyzing trace with hash -2012362968, now seen corresponding path program 1 times [2022-11-20 12:17:51,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:51,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715808418] [2022-11-20 12:17:51,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:51,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:52,096 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-20 12:17:52,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:52,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715808418] [2022-11-20 12:17:52,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715808418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:52,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:52,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:17:52,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005971044] [2022-11-20 12:17:52,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:52,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:17:52,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:52,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:17:52,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:17:52,099 INFO L87 Difference]: Start difference. First operand 234 states and 277 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 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-20 12:17:52,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:52,296 INFO L93 Difference]: Finished difference Result 233 states and 276 transitions. [2022-11-20 12:17:52,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:17:52,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 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-20 12:17:52,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:52,298 INFO L225 Difference]: With dead ends: 233 [2022-11-20 12:17:52,298 INFO L226 Difference]: Without dead ends: 233 [2022-11-20 12:17:52,298 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-20 12:17:52,299 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 3 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:52,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 412 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:17:52,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-11-20 12:17:52,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2022-11-20 12:17:52,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 204 states have (on average 1.3529411764705883) internal successors, (276), 232 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:52,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 276 transitions. [2022-11-20 12:17:52,303 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 276 transitions. Word has length 37 [2022-11-20 12:17:52,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:52,304 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 276 transitions. [2022-11-20 12:17:52,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 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-20 12:17:52,304 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 276 transitions. [2022-11-20 12:17:52,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 12:17:52,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:52,304 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-20 12:17:52,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-20 12:17:52,305 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:52,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:52,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1939172976, now seen corresponding path program 1 times [2022-11-20 12:17:52,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:52,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843299099] [2022-11-20 12:17:52,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:52,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:52,482 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-20 12:17:52,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:52,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843299099] [2022-11-20 12:17:52,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843299099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:52,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:52,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:17:52,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217299772] [2022-11-20 12:17:52,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:52,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:17:52,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:52,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:17:52,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:17:52,485 INFO L87 Difference]: Start difference. First operand 233 states and 276 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-20 12:17:52,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:52,735 INFO L93 Difference]: Finished difference Result 256 states and 299 transitions. [2022-11-20 12:17:52,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:17:52,736 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-20 12:17:52,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:52,737 INFO L225 Difference]: With dead ends: 256 [2022-11-20 12:17:52,737 INFO L226 Difference]: Without dead ends: 256 [2022-11-20 12:17:52,737 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-20 12:17:52,738 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 67 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:52,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 535 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:17:52,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-11-20 12:17:52,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 242. [2022-11-20 12:17:52,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 213 states have (on average 1.3380281690140845) internal successors, (285), 241 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:52,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 285 transitions. [2022-11-20 12:17:52,743 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 285 transitions. Word has length 37 [2022-11-20 12:17:52,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:52,743 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 285 transitions. [2022-11-20 12:17:52,743 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-20 12:17:52,743 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 285 transitions. [2022-11-20 12:17:52,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 12:17:52,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:52,744 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-20 12:17:52,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-20 12:17:52,744 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:52,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:52,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1413983143, now seen corresponding path program 1 times [2022-11-20 12:17:52,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:52,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795610234] [2022-11-20 12:17:52,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:52,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:52,784 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-20 12:17:52,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:52,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795610234] [2022-11-20 12:17:52,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795610234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:52,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:52,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:17:52,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911957893] [2022-11-20 12:17:52,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:52,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:17:52,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:52,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:17:52,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:17:52,787 INFO L87 Difference]: Start difference. First operand 242 states and 285 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:52,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:52,797 INFO L93 Difference]: Finished difference Result 243 states and 286 transitions. [2022-11-20 12:17:52,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:17:52,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-20 12:17:52,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:52,798 INFO L225 Difference]: With dead ends: 243 [2022-11-20 12:17:52,799 INFO L226 Difference]: Without dead ends: 243 [2022-11-20 12:17:52,799 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-20 12:17:52,800 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 286 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-20 12:17:52,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:17:52,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-20 12:17:52,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2022-11-20 12:17:52,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 214 states have (on average 1.3364485981308412) internal successors, (286), 242 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:52,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 286 transitions. [2022-11-20 12:17:52,821 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 286 transitions. Word has length 39 [2022-11-20 12:17:52,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:52,821 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 286 transitions. [2022-11-20 12:17:52,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:52,823 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 286 transitions. [2022-11-20 12:17:52,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 12:17:52,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:52,824 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-20 12:17:52,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-20 12:17:52,824 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:52,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:52,825 INFO L85 PathProgramCache]: Analyzing trace with hash -404838824, now seen corresponding path program 1 times [2022-11-20 12:17:52,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:52,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778336160] [2022-11-20 12:17:52,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:52,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:52,873 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-20 12:17:52,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:52,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778336160] [2022-11-20 12:17:52,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778336160] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:52,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:52,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:17:52,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175650528] [2022-11-20 12:17:52,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:52,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:17:52,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:52,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:17:52,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:17:52,877 INFO L87 Difference]: Start difference. First operand 243 states and 286 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:52,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:52,927 INFO L93 Difference]: Finished difference Result 256 states and 290 transitions. [2022-11-20 12:17:52,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:17:52,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-20 12:17:52,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:52,929 INFO L225 Difference]: With dead ends: 256 [2022-11-20 12:17:52,929 INFO L226 Difference]: Without dead ends: 256 [2022-11-20 12:17:52,929 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-20 12:17:52,930 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 99 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:52,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 152 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:17:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-11-20 12:17:52,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 244. [2022-11-20 12:17:52,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 215 states have (on average 1.3348837209302327) internal successors, (287), 243 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 287 transitions. [2022-11-20 12:17:52,936 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 287 transitions. Word has length 39 [2022-11-20 12:17:52,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:52,936 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 287 transitions. [2022-11-20 12:17:52,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:52,953 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 287 transitions. [2022-11-20 12:17:52,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 12:17:52,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:52,954 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] [2022-11-20 12:17:52,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-20 12:17:52,954 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:52,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:52,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1645380794, now seen corresponding path program 1 times [2022-11-20 12:17:52,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:52,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890951773] [2022-11-20 12:17:52,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:52,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:53,827 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-20 12:17:53,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:53,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890951773] [2022-11-20 12:17:53,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890951773] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:53,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:53,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 12:17:53,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171130321] [2022-11-20 12:17:53,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:53,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 12:17:53,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:53,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 12:17:53,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:17:53,830 INFO L87 Difference]: Start difference. First operand 244 states and 287 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:54,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:54,986 INFO L93 Difference]: Finished difference Result 409 states and 439 transitions. [2022-11-20 12:17:54,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 12:17:54,986 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-20 12:17:54,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:54,988 INFO L225 Difference]: With dead ends: 409 [2022-11-20 12:17:54,988 INFO L226 Difference]: Without dead ends: 409 [2022-11-20 12:17:54,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2022-11-20 12:17:54,989 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 486 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:54,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 1193 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 12:17:54,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-11-20 12:17:54,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 244. [2022-11-20 12:17:54,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 215 states have (on average 1.330232558139535) internal successors, (286), 243 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:54,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 286 transitions. [2022-11-20 12:17:54,994 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 286 transitions. Word has length 40 [2022-11-20 12:17:54,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:54,995 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 286 transitions. [2022-11-20 12:17:54,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:54,995 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 286 transitions. [2022-11-20 12:17:54,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 12:17:54,996 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:54,996 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] [2022-11-20 12:17:54,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-20 12:17:54,996 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:54,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:54,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1151553849, now seen corresponding path program 1 times [2022-11-20 12:17:54,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:54,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041608014] [2022-11-20 12:17:54,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:54,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:55,510 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-20 12:17:55,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:55,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041608014] [2022-11-20 12:17:55,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041608014] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:55,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:55,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-20 12:17:55,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362887076] [2022-11-20 12:17:55,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:55,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 12:17:55,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:55,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 12:17:55,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:17:55,513 INFO L87 Difference]: Start difference. First operand 244 states and 286 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:56,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:56,212 INFO L93 Difference]: Finished difference Result 243 states and 285 transitions. [2022-11-20 12:17:56,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 12:17:56,213 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-20 12:17:56,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:56,214 INFO L225 Difference]: With dead ends: 243 [2022-11-20 12:17:56,214 INFO L226 Difference]: Without dead ends: 243 [2022-11-20 12:17:56,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2022-11-20 12:17:56,215 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 207 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:56,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 766 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 12:17:56,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-20 12:17:56,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2022-11-20 12:17:56,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 215 states have (on average 1.3255813953488371) internal successors, (285), 242 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 285 transitions. [2022-11-20 12:17:56,223 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 285 transitions. Word has length 40 [2022-11-20 12:17:56,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:56,223 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 285 transitions. [2022-11-20 12:17:56,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:56,223 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 285 transitions. [2022-11-20 12:17:56,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 12:17:56,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:56,224 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] [2022-11-20 12:17:56,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-20 12:17:56,224 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:56,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:56,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1151553848, now seen corresponding path program 1 times [2022-11-20 12:17:56,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:56,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134093072] [2022-11-20 12:17:56,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:56,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:56,886 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-20 12:17:56,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:56,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134093072] [2022-11-20 12:17:56,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134093072] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:56,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:56,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-20 12:17:56,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718649911] [2022-11-20 12:17:56,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:56,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 12:17:56,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:56,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 12:17:56,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:17:56,888 INFO L87 Difference]: Start difference. First operand 243 states and 285 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:57,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:57,532 INFO L93 Difference]: Finished difference Result 242 states and 284 transitions. [2022-11-20 12:17:57,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 12:17:57,533 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-20 12:17:57,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:57,536 INFO L225 Difference]: With dead ends: 242 [2022-11-20 12:17:57,538 INFO L226 Difference]: Without dead ends: 242 [2022-11-20 12:17:57,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2022-11-20 12:17:57,541 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 205 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:57,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 618 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:17:57,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-11-20 12:17:57,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-11-20 12:17:57,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 215 states have (on average 1.3209302325581396) internal successors, (284), 241 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:57,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 284 transitions. [2022-11-20 12:17:57,559 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 284 transitions. Word has length 40 [2022-11-20 12:17:57,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:57,560 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 284 transitions. [2022-11-20 12:17:57,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:57,560 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 284 transitions. [2022-11-20 12:17:57,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 12:17:57,561 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:57,561 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-20 12:17:57,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-20 12:17:57,561 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:57,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:57,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1626494914, now seen corresponding path program 1 times [2022-11-20 12:17:57,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:57,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017930794] [2022-11-20 12:17:57,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:57,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:57,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-20 12:17:57,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:57,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017930794] [2022-11-20 12:17:57,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017930794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:57,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:57,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:17:57,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825459002] [2022-11-20 12:17:57,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:57,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:17:57,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:57,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:17:57,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:17:57,737 INFO L87 Difference]: Start difference. First operand 242 states and 284 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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-20 12:17:57,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:57,977 INFO L93 Difference]: Finished difference Result 252 states and 296 transitions. [2022-11-20 12:17:57,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:17:57,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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-20 12:17:57,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:57,979 INFO L225 Difference]: With dead ends: 252 [2022-11-20 12:17:57,979 INFO L226 Difference]: Without dead ends: 252 [2022-11-20 12:17:57,979 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-20 12:17:57,980 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 34 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:57,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 449 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:17:57,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-20 12:17:57,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 239. [2022-11-20 12:17:57,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 213 states have (on average 1.3192488262910798) internal successors, (281), 238 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:57,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 281 transitions. [2022-11-20 12:17:57,984 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 281 transitions. Word has length 41 [2022-11-20 12:17:57,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:57,984 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 281 transitions. [2022-11-20 12:17:57,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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-20 12:17:57,985 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 281 transitions. [2022-11-20 12:17:57,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-20 12:17:57,985 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:57,985 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-20 12:17:57,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-20 12:17:57,985 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:57,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:57,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1357177023, now seen corresponding path program 1 times [2022-11-20 12:17:57,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:57,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820735018] [2022-11-20 12:17:57,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:57,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:58,033 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-20 12:17:58,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:58,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820735018] [2022-11-20 12:17:58,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820735018] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:58,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:58,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:17:58,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738945644] [2022-11-20 12:17:58,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:58,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:17:58,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:58,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:17:58,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:17:58,035 INFO L87 Difference]: Start difference. First operand 239 states and 281 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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-20 12:17:58,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:58,100 INFO L93 Difference]: Finished difference Result 249 states and 290 transitions. [2022-11-20 12:17:58,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:17:58,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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-20 12:17:58,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:58,102 INFO L225 Difference]: With dead ends: 249 [2022-11-20 12:17:58,102 INFO L226 Difference]: Without dead ends: 249 [2022-11-20 12:17:58,103 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-20 12:17:58,104 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 91 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:58,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 170 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:17:58,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-11-20 12:17:58,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 237. [2022-11-20 12:17:58,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 212 states have (on average 1.3113207547169812) internal successors, (278), 236 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:58,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 278 transitions. [2022-11-20 12:17:58,110 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 278 transitions. Word has length 42 [2022-11-20 12:17:58,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:58,110 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 278 transitions. [2022-11-20 12:17:58,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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-20 12:17:58,111 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 278 transitions. [2022-11-20 12:17:58,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-20 12:17:58,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:58,112 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:17:58,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-20 12:17:58,112 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:58,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:58,112 INFO L85 PathProgramCache]: Analyzing trace with hash -284774687, now seen corresponding path program 1 times [2022-11-20 12:17:58,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:58,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831132155] [2022-11-20 12:17:58,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:58,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:58,459 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-20 12:17:58,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:58,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831132155] [2022-11-20 12:17:58,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831132155] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:17:58,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558671706] [2022-11-20 12:17:58,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:58,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:17:58,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:17:58,462 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:17:58,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 12:17:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:58,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-20 12:17:58,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:17:58,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 12:17:58,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 12:17:58,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 12:17:58,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 12:17:58,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 12:17:58,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 12:17:58,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 12:17:58,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 12:17:58,836 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-20 12:17:58,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:17:58,988 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-20 12:17:58,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558671706] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:17:58,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:17:58,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-20 12:17:58,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270606617] [2022-11-20 12:17:58,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:17:58,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:17:58,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:58,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:17:58,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:17:58,990 INFO L87 Difference]: Start difference. First operand 237 states and 278 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:59,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:17:59,297 INFO L93 Difference]: Finished difference Result 290 states and 324 transitions. [2022-11-20 12:17:59,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:17:59,298 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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-20 12:17:59,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:17:59,299 INFO L225 Difference]: With dead ends: 290 [2022-11-20 12:17:59,299 INFO L226 Difference]: Without dead ends: 290 [2022-11-20 12:17:59,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:17:59,300 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 78 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:17:59,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 547 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:17:59,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-11-20 12:17:59,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 259. [2022-11-20 12:17:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 234 states have (on average 1.3205128205128205) internal successors, (309), 258 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-20 12:17:59,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 309 transitions. [2022-11-20 12:17:59,305 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 309 transitions. Word has length 42 [2022-11-20 12:17:59,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:17:59,305 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 309 transitions. [2022-11-20 12:17:59,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:17:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 309 transitions. [2022-11-20 12:17:59,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 12:17:59,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:17:59,307 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] [2022-11-20 12:17:59,320 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:17:59,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-20 12:17:59,513 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:17:59,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:17:59,514 INFO L85 PathProgramCache]: Analyzing trace with hash -877180804, now seen corresponding path program 1 times [2022-11-20 12:17:59,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:17:59,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541563896] [2022-11-20 12:17:59,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:17:59,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:17:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:17:59,797 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-20 12:17:59,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:17:59,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541563896] [2022-11-20 12:17:59,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541563896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:17:59,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:17:59,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:17:59,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57123032] [2022-11-20 12:17:59,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:17:59,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:17:59,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:17:59,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:17:59,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:17:59,803 INFO L87 Difference]: Start difference. First operand 259 states and 309 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:00,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:18:00,318 INFO L93 Difference]: Finished difference Result 306 states and 343 transitions. [2022-11-20 12:18:00,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 12:18:00,318 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-20 12:18:00,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:18:00,319 INFO L225 Difference]: With dead ends: 306 [2022-11-20 12:18:00,319 INFO L226 Difference]: Without dead ends: 306 [2022-11-20 12:18:00,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-11-20 12:18:00,320 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 363 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:18:00,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 578 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:18:00,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-20 12:18:00,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 259. [2022-11-20 12:18:00,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 234 states have (on average 1.3162393162393162) internal successors, (308), 258 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-20 12:18:00,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 308 transitions. [2022-11-20 12:18:00,325 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 308 transitions. Word has length 43 [2022-11-20 12:18:00,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:18:00,326 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 308 transitions. [2022-11-20 12:18:00,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:00,326 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 308 transitions. [2022-11-20 12:18:00,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 12:18:00,331 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:18:00,331 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] [2022-11-20 12:18:00,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-20 12:18:00,332 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:18:00,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:18:00,332 INFO L85 PathProgramCache]: Analyzing trace with hash -877180803, now seen corresponding path program 1 times [2022-11-20 12:18:00,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:18:00,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330385341] [2022-11-20 12:18:00,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:18:00,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:18:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:18:00,802 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-20 12:18:00,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:18:00,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330385341] [2022-11-20 12:18:00,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330385341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:18:00,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:18:00,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:18:00,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737871139] [2022-11-20 12:18:00,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:18:00,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:18:00,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:18:00,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:18:00,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:18:00,804 INFO L87 Difference]: Start difference. First operand 259 states and 308 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:01,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:18:01,430 INFO L93 Difference]: Finished difference Result 306 states and 342 transitions. [2022-11-20 12:18:01,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 12:18:01,431 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-20 12:18:01,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:18:01,432 INFO L225 Difference]: With dead ends: 306 [2022-11-20 12:18:01,432 INFO L226 Difference]: Without dead ends: 306 [2022-11-20 12:18:01,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-11-20 12:18:01,433 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 257 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:18:01,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 600 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 12:18:01,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-20 12:18:01,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 259. [2022-11-20 12:18:01,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 234 states have (on average 1.3034188034188035) internal successors, (305), 258 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-20 12:18:01,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 305 transitions. [2022-11-20 12:18:01,438 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 305 transitions. Word has length 43 [2022-11-20 12:18:01,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:18:01,439 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 305 transitions. [2022-11-20 12:18:01,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:01,439 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 305 transitions. [2022-11-20 12:18:01,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 12:18:01,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:18:01,440 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] [2022-11-20 12:18:01,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-20 12:18:01,440 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:18:01,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:18:01,441 INFO L85 PathProgramCache]: Analyzing trace with hash -238079422, now seen corresponding path program 1 times [2022-11-20 12:18:01,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:18:01,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880722103] [2022-11-20 12:18:01,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:18:01,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:18:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:18:01,540 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-20 12:18:01,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:18:01,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880722103] [2022-11-20 12:18:01,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880722103] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:18:01,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521086203] [2022-11-20 12:18:01,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:18:01,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:18:01,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:18:01,543 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:18:01,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 12:18:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:18:01,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 12:18:01,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:18:01,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 12:18:01,811 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-20 12:18:01,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:18:01,893 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-20 12:18:01,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521086203] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:18:01,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:18:01,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-11-20 12:18:01,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775808411] [2022-11-20 12:18:01,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:18:01,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:18:01,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:18:01,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:18:01,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:18:01,895 INFO L87 Difference]: Start difference. First operand 259 states and 305 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:02,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:18:02,047 INFO L93 Difference]: Finished difference Result 290 states and 336 transitions. [2022-11-20 12:18:02,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:18:02,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-20 12:18:02,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:18:02,048 INFO L225 Difference]: With dead ends: 290 [2022-11-20 12:18:02,048 INFO L226 Difference]: Without dead ends: 266 [2022-11-20 12:18:02,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 83 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-20 12:18:02,049 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:18:02,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 1 Unchecked, 0.1s Time] [2022-11-20 12:18:02,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-11-20 12:18:02,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-11-20 12:18:02,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 241 states have (on average 1.2946058091286308) internal successors, (312), 265 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:02,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 312 transitions. [2022-11-20 12:18:02,055 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 312 transitions. Word has length 43 [2022-11-20 12:18:02,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:18:02,055 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 312 transitions. [2022-11-20 12:18:02,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:02,055 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 312 transitions. [2022-11-20 12:18:02,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-20 12:18:02,056 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:18:02,056 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] [2022-11-20 12:18:02,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 12:18:02,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-20 12:18:02,257 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:18:02,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:18:02,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1157151236, now seen corresponding path program 1 times [2022-11-20 12:18:02,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:18:02,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610395128] [2022-11-20 12:18:02,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:18:02,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:18:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:18:02,625 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-20 12:18:02,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:18:02,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610395128] [2022-11-20 12:18:02,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610395128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:18:02,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:18:02,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:18:02,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824805625] [2022-11-20 12:18:02,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:18:02,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:18:02,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:18:02,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:18:02,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:18:02,627 INFO L87 Difference]: Start difference. First operand 266 states and 312 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:03,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:18:03,131 INFO L93 Difference]: Finished difference Result 291 states and 325 transitions. [2022-11-20 12:18:03,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:18:03,131 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-20 12:18:03,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:18:03,133 INFO L225 Difference]: With dead ends: 291 [2022-11-20 12:18:03,133 INFO L226 Difference]: Without dead ends: 291 [2022-11-20 12:18:03,133 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-20 12:18:03,134 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 177 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:18:03,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 464 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:18:03,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-11-20 12:18:03,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 265. [2022-11-20 12:18:03,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 240 states have (on average 1.2916666666666667) internal successors, (310), 264 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 310 transitions. [2022-11-20 12:18:03,140 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 310 transitions. Word has length 45 [2022-11-20 12:18:03,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:18:03,141 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 310 transitions. [2022-11-20 12:18:03,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:03,141 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 310 transitions. [2022-11-20 12:18:03,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-20 12:18:03,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:18:03,142 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] [2022-11-20 12:18:03,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-20 12:18:03,142 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:18:03,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:18:03,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1529922318, now seen corresponding path program 1 times [2022-11-20 12:18:03,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:18:03,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322518346] [2022-11-20 12:18:03,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:18:03,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:18:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:18:03,200 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-20 12:18:03,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:18:03,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322518346] [2022-11-20 12:18:03,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322518346] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:18:03,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:18:03,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:18:03,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142041796] [2022-11-20 12:18:03,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:18:03,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:18:03,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:18:03,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:18:03,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:18:03,205 INFO L87 Difference]: Start difference. First operand 265 states and 310 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:03,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:18:03,219 INFO L93 Difference]: Finished difference Result 405 states and 481 transitions. [2022-11-20 12:18:03,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:18:03,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-20 12:18:03,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:18:03,221 INFO L225 Difference]: With dead ends: 405 [2022-11-20 12:18:03,222 INFO L226 Difference]: Without dead ends: 405 [2022-11-20 12:18:03,222 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-20 12:18:03,223 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 56 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 313 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-20 12:18:03,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 313 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:18:03,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-11-20 12:18:03,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 302. [2022-11-20 12:18:03,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 277 states have (on average 1.3285198555956679) internal successors, (368), 301 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:03,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 368 transitions. [2022-11-20 12:18:03,232 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 368 transitions. Word has length 45 [2022-11-20 12:18:03,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:18:03,233 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 368 transitions. [2022-11-20 12:18:03,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:03,233 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 368 transitions. [2022-11-20 12:18:03,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-20 12:18:03,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:18:03,234 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, 1] [2022-11-20 12:18:03,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-20 12:18:03,234 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:18:03,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:18:03,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1376244065, now seen corresponding path program 1 times [2022-11-20 12:18:03,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:18:03,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948005045] [2022-11-20 12:18:03,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:18:03,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:18:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:18:03,346 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-20 12:18:03,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:18:03,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948005045] [2022-11-20 12:18:03,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948005045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:18:03,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:18:03,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:18:03,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116815347] [2022-11-20 12:18:03,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:18:03,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:18:03,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:18:03,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:18:03,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:18:03,349 INFO L87 Difference]: Start difference. First operand 302 states and 368 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:03,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:18:03,482 INFO L93 Difference]: Finished difference Result 249 states and 280 transitions. [2022-11-20 12:18:03,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:18:03,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-11-20 12:18:03,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:18:03,484 INFO L225 Difference]: With dead ends: 249 [2022-11-20 12:18:03,484 INFO L226 Difference]: Without dead ends: 249 [2022-11-20 12:18:03,485 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-20 12:18:03,485 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 56 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:18:03,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 524 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:18:03,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-11-20 12:18:03,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2022-11-20 12:18:03,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 225 states have (on average 1.2444444444444445) internal successors, (280), 248 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:03,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 280 transitions. [2022-11-20 12:18:03,491 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 280 transitions. Word has length 47 [2022-11-20 12:18:03,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:18:03,491 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 280 transitions. [2022-11-20 12:18:03,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:03,492 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 280 transitions. [2022-11-20 12:18:03,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-20 12:18:03,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:18:03,492 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] [2022-11-20 12:18:03,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-20 12:18:03,493 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:18:03,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:18:03,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1538447444, now seen corresponding path program 1 times [2022-11-20 12:18:03,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:18:03,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980948241] [2022-11-20 12:18:03,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:18:03,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:18:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:18:03,806 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-20 12:18:03,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:18:03,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980948241] [2022-11-20 12:18:03,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980948241] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:18:03,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:18:03,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 12:18:03,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018834817] [2022-11-20 12:18:03,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:18:03,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 12:18:03,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:18:03,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 12:18:03,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:18:03,810 INFO L87 Difference]: Start difference. First operand 249 states and 280 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:04,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:18:04,341 INFO L93 Difference]: Finished difference Result 238 states and 263 transitions. [2022-11-20 12:18:04,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:18:04,342 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 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-20 12:18:04,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:18:04,343 INFO L225 Difference]: With dead ends: 238 [2022-11-20 12:18:04,343 INFO L226 Difference]: Without dead ends: 238 [2022-11-20 12:18:04,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-11-20 12:18:04,344 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 480 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:18:04,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 573 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:18:04,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-11-20 12:18:04,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 226. [2022-11-20 12:18:04,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 202 states have (on average 1.2623762376237624) internal successors, (255), 225 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:04,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 255 transitions. [2022-11-20 12:18:04,349 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 255 transitions. Word has length 50 [2022-11-20 12:18:04,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:18:04,349 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 255 transitions. [2022-11-20 12:18:04,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:04,350 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 255 transitions. [2022-11-20 12:18:04,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-20 12:18:04,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:18:04,351 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] [2022-11-20 12:18:04,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-20 12:18:04,351 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:18:04,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:18:04,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1188819543, now seen corresponding path program 1 times [2022-11-20 12:18:04,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:18:04,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684172017] [2022-11-20 12:18:04,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:18:04,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:18:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:18:04,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:18:04,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:18:04,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684172017] [2022-11-20 12:18:04,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684172017] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:18:04,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:18:04,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:18:04,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600857960] [2022-11-20 12:18:04,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:18:04,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:18:04,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:18:04,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:18:04,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:18:04,516 INFO L87 Difference]: Start difference. First operand 226 states and 255 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:04,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:18:04,652 INFO L93 Difference]: Finished difference Result 240 states and 270 transitions. [2022-11-20 12:18:04,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:18:04,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 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-20 12:18:04,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:18:04,655 INFO L225 Difference]: With dead ends: 240 [2022-11-20 12:18:04,655 INFO L226 Difference]: Without dead ends: 240 [2022-11-20 12:18:04,655 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-20 12:18:04,656 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 19 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:18:04,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 491 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:18:04,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-11-20 12:18:04,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 229. [2022-11-20 12:18:04,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 205 states have (on average 1.2585365853658537) internal successors, (258), 228 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:04,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 258 transitions. [2022-11-20 12:18:04,660 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 258 transitions. Word has length 52 [2022-11-20 12:18:04,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:18:04,660 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 258 transitions. [2022-11-20 12:18:04,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:04,660 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 258 transitions. [2022-11-20 12:18:04,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-20 12:18:04,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:18:04,661 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] [2022-11-20 12:18:04,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-20 12:18:04,661 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:18:04,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:18:04,662 INFO L85 PathProgramCache]: Analyzing trace with hash 426433170, now seen corresponding path program 1 times [2022-11-20 12:18:04,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:18:04,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130879975] [2022-11-20 12:18:04,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:18:04,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:18:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:18:05,903 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-20 12:18:05,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:18:05,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130879975] [2022-11-20 12:18:05,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130879975] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:18:05,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124286213] [2022-11-20 12:18:05,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:18:05,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:18:05,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:18:05,907 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:18:05,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 12:18:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:18:06,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-20 12:18:06,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:18:06,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 12:18:06,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 12:18:06,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 12:18:06,368 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 12:18:06,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 12:18:06,466 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-20 12:18:06,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-11-20 12:18:06,492 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 12:18:06,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 12:18:06,702 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:18:06,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 50 [2022-11-20 12:18:06,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-11-20 12:18:07,059 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:18:07,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 70 [2022-11-20 12:18:07,077 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:18:07,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 89 [2022-11-20 12:18:07,414 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:18:07,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 70 [2022-11-20 12:18:07,429 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:18:07,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 89 [2022-11-20 12:18:08,054 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:18:08,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 43 [2022-11-20 12:18:08,066 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:18:08,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2022-11-20 12:18:08,341 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-20 12:18:08,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:18:08,694 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_1482 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 0)))) (or (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1482 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) 1))))) is different from false [2022-11-20 12:18:08,804 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (or (forall ((v_ArrVal_1482 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) 1)) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 0))) (forall ((v_ArrVal_1482 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))) (or (= .cse1 0) (= (select |c_#valid| .cse1) 1)))))) is different from false [2022-11-20 12:18:08,952 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1478))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1479) .cse0 v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1482 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse2 .cse0 v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) 1)))))) (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (let ((.cse3 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1478))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse3 0) (= (select |c_#valid| .cse3) 1)))))) is different from false [2022-11-20 12:18:08,977 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse2 (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_1478 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1478))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))) (or (= .cse0 0) (= (select |c_#valid| .cse0) 1)))) (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1478))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1479) .cse4 v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1482 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse5 .cse4 v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) 1)))))))) is different from false [2022-11-20 12:18:09,024 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |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_1478))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1482 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse0 .cse1 v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) 1)) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store (store (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|) |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.offset|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1479) .cse1 v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 0)))))) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (let ((.cse4 (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse3 |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_1478))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))) (or (= .cse4 0) (= (select |c_#valid| .cse4) 1)))))) is different from false [2022-11-20 12:18:09,783 INFO L321 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-11-20 12:18:09,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 54 [2022-11-20 12:18:09,808 INFO L321 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2022-11-20 12:18:09,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 75 [2022-11-20 12:18:09,823 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:18:09,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 187 [2022-11-20 12:18:09,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2022-11-20 12:18:09,850 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:18:09,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 96 [2022-11-20 12:18:09,867 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-20 12:18:09,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 156 [2022-11-20 12:18:09,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2022-11-20 12:18:09,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-11-20 12:18:09,973 INFO L321 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2022-11-20 12:18:09,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 75 [2022-11-20 12:18:09,985 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:18:09,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 542 treesize of output 374 [2022-11-20 12:18:09,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 347 treesize of output 315 [2022-11-20 12:18:10,028 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:18:10,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 315 treesize of output 285 [2022-11-20 12:18:24,631 WARN L233 SmtUtils]: Spent 14.04s on a formula simplification. DAG size of input: 40 DAG size of output: 13 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:18:24,665 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-20 12:18:24,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124286213] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:18:24,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:18:24,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 15] total 45 [2022-11-20 12:18:24,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436031105] [2022-11-20 12:18:24,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:18:24,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-20 12:18:24,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:18:24,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-20 12:18:24,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1358, Unknown=10, NotChecked=400, Total=1980 [2022-11-20 12:18:24,668 INFO L87 Difference]: Start difference. First operand 229 states and 258 transitions. Second operand has 45 states, 45 states have (on average 3.5555555555555554) internal successors, (160), 45 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:27,079 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 8)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (select .cse2 |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= (select .cse0 |c_ULTIMATE.start_main_~list~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= .cse1 0) (= |c_ULTIMATE.start_main_#t~malloc10#1.offset| 0) (= (select .cse2 .cse3) 0) (= (select .cse4 .cse3) 0) (= (select .cse0 .cse5) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc10#1.base|) 1) (not (<= (+ |c_ULTIMATE.start_main_~list~0#1.offset| 1) |c_ULTIMATE.start_main_~end~0#1.offset|)) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |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_1478))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1482 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse6 .cse7 v_ArrVal_1482) |c_ULTIMATE.start_main_~list~0#1.base|) .cse5)) 1)) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.offset|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1479) .cse7 v_ArrVal_1483) |c_ULTIMATE.start_main_~list~0#1.base|) .cse5) 0)))))) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (let ((.cse8 (select (select (let ((.cse9 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse4 |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_1478))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1482)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse5))) (or (= .cse8 0) (= (select |c_#valid| .cse8) 1)))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) (= |c_ULTIMATE.start_main_~end~0#1.offset| 0) (= (select .cse4 .cse5) 0) (= .cse1 |c_ULTIMATE.start_main_#t~malloc10#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse5) 0) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)))) is different from false [2022-11-20 12:18:30,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:18:30,604 INFO L93 Difference]: Finished difference Result 354 states and 388 transitions. [2022-11-20 12:18:30,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 12:18:30,605 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.5555555555555554) internal successors, (160), 45 states have internal predecessors, (160), 0 states have call successors, (0), 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 54 [2022-11-20 12:18:30,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:18:30,607 INFO L225 Difference]: With dead ends: 354 [2022-11-20 12:18:30,607 INFO L226 Difference]: Without dead ends: 354 [2022-11-20 12:18:30,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=448, Invalid=2757, Unknown=11, NotChecked=690, Total=3906 [2022-11-20 12:18:30,609 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 515 mSDsluCounter, 1959 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 2063 SdHoareTripleChecker+Invalid, 2466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1295 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-20 12:18:30,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 2063 Invalid, 2466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1137 Invalid, 0 Unknown, 1295 Unchecked, 1.7s Time] [2022-11-20 12:18:30,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-11-20 12:18:30,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 259. [2022-11-20 12:18:30,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 235 states have (on average 1.2340425531914894) internal successors, (290), 258 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:30,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 290 transitions. [2022-11-20 12:18:30,630 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 290 transitions. Word has length 54 [2022-11-20 12:18:30,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:18:30,630 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 290 transitions. [2022-11-20 12:18:30,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.5555555555555554) internal successors, (160), 45 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:30,631 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 290 transitions. [2022-11-20 12:18:30,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 12:18:30,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:18:30,633 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, 1, 1, 1, 1] [2022-11-20 12:18:30,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 12:18:30,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-11-20 12:18:30,840 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:18:30,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:18:30,841 INFO L85 PathProgramCache]: Analyzing trace with hash -2048851803, now seen corresponding path program 1 times [2022-11-20 12:18:30,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:18:30,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735748554] [2022-11-20 12:18:30,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:18:30,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:18:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:18:31,944 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-20 12:18:31,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:18:31,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735748554] [2022-11-20 12:18:31,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735748554] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:18:31,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691354618] [2022-11-20 12:18:31,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:18:31,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:18:31,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:18:31,947 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:18:31,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 12:18:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:18:32,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-20 12:18:32,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:18:32,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 12:18:32,389 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 12:18:32,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 12:18:32,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 12:18:32,655 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:18:32,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-20 12:18:32,875 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:18:32,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-20 12:18:33,036 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:18:33,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-20 12:18:33,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:18:33,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-20 12:18:33,610 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-20 12:18:33,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:18:36,905 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:18:36,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2022-11-20 12:18:36,923 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:18:36,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 131 [2022-11-20 12:18:36,956 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:18:36,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 114 [2022-11-20 12:18:36,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2022-11-20 12:18:43,438 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-20 12:18:43,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691354618] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:18:43,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:18:43,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 34 [2022-11-20 12:18:43,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101953540] [2022-11-20 12:18:43,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:18:43,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-20 12:18:43,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:18:43,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-20 12:18:43,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=989, Unknown=26, NotChecked=0, Total=1190 [2022-11-20 12:18:43,441 INFO L87 Difference]: Start difference. First operand 259 states and 290 transitions. Second operand has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:48,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:18:48,756 INFO L93 Difference]: Finished difference Result 729 states and 794 transitions. [2022-11-20 12:18:48,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-20 12:18:48,756 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-11-20 12:18:48,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:18:48,759 INFO L225 Difference]: With dead ends: 729 [2022-11-20 12:18:48,759 INFO L226 Difference]: Without dead ends: 729 [2022-11-20 12:18:48,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 95 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1538 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=931, Invalid=3599, Unknown=26, NotChecked=0, Total=4556 [2022-11-20 12:18:48,760 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 1941 mSDsluCounter, 2019 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1941 SdHoareTripleChecker+Valid, 2141 SdHoareTripleChecker+Invalid, 2763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1489 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-20 12:18:48,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1941 Valid, 2141 Invalid, 2763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1120 Invalid, 0 Unknown, 1489 Unchecked, 1.9s Time] [2022-11-20 12:18:48,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2022-11-20 12:18:48,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 319. [2022-11-20 12:18:48,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 295 states have (on average 1.2271186440677966) internal successors, (362), 318 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-20 12:18:48,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 362 transitions. [2022-11-20 12:18:48,769 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 362 transitions. Word has length 56 [2022-11-20 12:18:48,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:18:48,770 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 362 transitions. [2022-11-20 12:18:48,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:18:48,770 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 362 transitions. [2022-11-20 12:18:48,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 12:18:48,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:18:48,771 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, 1, 1, 1, 1] [2022-11-20 12:18:48,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 12:18:48,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-11-20 12:18:48,981 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:18:48,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:18:48,982 INFO L85 PathProgramCache]: Analyzing trace with hash -2048851802, now seen corresponding path program 1 times [2022-11-20 12:18:48,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:18:48,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785474623] [2022-11-20 12:18:48,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:18:48,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:18:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:18:49,853 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-20 12:18:49,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:18:49,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785474623] [2022-11-20 12:18:49,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785474623] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:18:49,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232547617] [2022-11-20 12:18:49,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:18:49,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:18:49,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:18:49,855 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:18:49,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 12:18:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:18:50,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-20 12:18:50,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:18:50,399 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-20 12:18:50,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-20 12:18:50,456 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-20 12:18:50,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2022-11-20 12:18:50,826 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-20 12:18:50,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 78 [2022-11-20 12:18:50,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:18:50,848 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-20 12:18:50,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 50 [2022-11-20 12:18:51,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:18:51,882 INFO L321 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2022-11-20 12:18:51,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 76 [2022-11-20 12:18:51,891 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:18:51,903 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:18:51,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 59 [2022-11-20 12:18:52,303 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-20 12:18:52,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:18:53,581 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:18:53,581 INFO L350 Elim1Store]: Elim1 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 158 treesize of output 204 [2022-11-20 12:19:20,987 WARN L233 SmtUtils]: Spent 16.90s on a formula simplification. DAG size of input: 103 DAG size of output: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:19:27,084 WARN L233 SmtUtils]: Spent 5.13s on a formula simplification. DAG size of input: 75 DAG size of output: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:19:31,959 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:19:31,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 553 treesize of output 444 [2022-11-20 12:19:32,099 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:19:32,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 869 treesize of output 678 [2022-11-20 12:19:50,027 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-20 12:19:50,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232547617] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:19:50,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:19:50,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 32 [2022-11-20 12:19:50,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906557359] [2022-11-20 12:19:50,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:19:50,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-20 12:19:50,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:19:50,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-20 12:19:50,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=947, Unknown=1, NotChecked=0, Total=1056 [2022-11-20 12:19:50,030 INFO L87 Difference]: Start difference. First operand 319 states and 362 transitions. Second operand has 33 states, 32 states have (on average 5.1875) internal successors, (166), 33 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:19:57,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:19:57,041 INFO L93 Difference]: Finished difference Result 499 states and 536 transitions. [2022-11-20 12:19:57,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-20 12:19:57,041 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 5.1875) internal successors, (166), 33 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-11-20 12:19:57,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:19:57,043 INFO L225 Difference]: With dead ends: 499 [2022-11-20 12:19:57,043 INFO L226 Difference]: Without dead ends: 499 [2022-11-20 12:19:57,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 97 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 41.8s TimeCoverageRelationStatistics Valid=717, Invalid=3704, Unknown=1, NotChecked=0, Total=4422 [2022-11-20 12:19:57,045 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 1471 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1471 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 2261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 507 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:19:57,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1471 Valid, 1652 Invalid, 2261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1654 Invalid, 0 Unknown, 507 Unchecked, 2.5s Time] [2022-11-20 12:19:57,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-11-20 12:19:57,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 349. [2022-11-20 12:19:57,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 325 states have (on average 1.2338461538461538) internal successors, (401), 348 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:19:57,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 401 transitions. [2022-11-20 12:19:57,067 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 401 transitions. Word has length 56 [2022-11-20 12:19:57,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:19:57,068 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 401 transitions. [2022-11-20 12:19:57,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 5.1875) internal successors, (166), 33 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:19:57,068 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 401 transitions. [2022-11-20 12:19:57,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 12:19:57,069 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:19:57,069 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, 1] [2022-11-20 12:19:57,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 12:19:57,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-11-20 12:19:57,277 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:19:57,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:19:57,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1627380482, now seen corresponding path program 1 times [2022-11-20 12:19:57,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:19:57,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636917807] [2022-11-20 12:19:57,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:19:57,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:19:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:19:58,637 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-20 12:19:58,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:19:58,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636917807] [2022-11-20 12:19:58,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636917807] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:19:58,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851642674] [2022-11-20 12:19:58,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:19:58,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:19:58,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:19:58,643 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:19:58,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 12:19:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:19:58,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-20 12:19:58,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:20:00,069 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:20:00,134 INFO L321 Elim1Store]: treesize reduction 69, result has 26.6 percent of original size [2022-11-20 12:20:00,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 65 [2022-11-20 12:20:00,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:20:00,168 INFO L321 Elim1Store]: treesize reduction 57, result has 10.9 percent of original size [2022-11-20 12:20:00,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 35 [2022-11-20 12:20:00,184 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-20 12:20:00,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:20:01,091 INFO L321 Elim1Store]: treesize reduction 8, result has 92.2 percent of original size [2022-11-20 12:20:01,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 142 [2022-11-20 12:20:01,239 INFO L321 Elim1Store]: treesize reduction 22, result has 70.7 percent of original size [2022-11-20 12:20:01,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 127 [2022-11-20 12:20:01,875 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-20 12:20:01,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851642674] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:20:01,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:20:01,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 31 [2022-11-20 12:20:01,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145376885] [2022-11-20 12:20:01,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:20:01,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-20 12:20:01,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:20:01,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-20 12:20:01,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2022-11-20 12:20:01,878 INFO L87 Difference]: Start difference. First operand 349 states and 401 transitions. Second operand has 31 states, 31 states have (on average 5.161290322580645) internal successors, (160), 31 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:05,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:20:05,941 INFO L93 Difference]: Finished difference Result 458 states and 528 transitions. [2022-11-20 12:20:05,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-20 12:20:05,941 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 5.161290322580645) internal successors, (160), 31 states have internal predecessors, (160), 0 states have call successors, (0), 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 57 [2022-11-20 12:20:05,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:20:05,943 INFO L225 Difference]: With dead ends: 458 [2022-11-20 12:20:05,943 INFO L226 Difference]: Without dead ends: 458 [2022-11-20 12:20:05,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=546, Invalid=2646, Unknown=0, NotChecked=0, Total=3192 [2022-11-20 12:20:05,944 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 623 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:20:05,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1537 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1392 Invalid, 0 Unknown, 175 Unchecked, 2.2s Time] [2022-11-20 12:20:05,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-11-20 12:20:05,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 410. [2022-11-20 12:20:05,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 386 states have (on average 1.2590673575129534) internal successors, (486), 409 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:05,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 486 transitions. [2022-11-20 12:20:05,953 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 486 transitions. Word has length 57 [2022-11-20 12:20:05,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:20:05,953 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 486 transitions. [2022-11-20 12:20:05,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.161290322580645) internal successors, (160), 31 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:05,954 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 486 transitions. [2022-11-20 12:20:05,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 12:20:05,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:20:05,955 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, 1, 1] [2022-11-20 12:20:05,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 12:20:06,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-11-20 12:20:06,161 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:20:06,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:20:06,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1135767587, now seen corresponding path program 1 times [2022-11-20 12:20:06,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:20:06,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664218258] [2022-11-20 12:20:06,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:20:06,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:20:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:20:07,627 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-20 12:20:07,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:20:07,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664218258] [2022-11-20 12:20:07,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664218258] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:20:07,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885800513] [2022-11-20 12:20:07,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:20:07,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:20:07,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:20:07,629 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:20:07,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 12:20:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:20:07,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-20 12:20:07,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:20:07,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 12:20:07,969 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 12:20:07,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 12:20:08,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 12:20:08,204 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:20:08,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-11-20 12:20:08,330 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:20:08,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-11-20 12:20:08,573 INFO L321 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2022-11-20 12:20:08,573 INFO L350 Elim1Store]: Elim1 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-20 12:20:08,721 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-20 12:20:08,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2022-11-20 12:20:09,161 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:20:09,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 79 [2022-11-20 12:20:09,807 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:20:09,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 100 [2022-11-20 12:20:10,267 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:20:10,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 100 [2022-11-20 12:20:10,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-11-20 12:20:11,293 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-20 12:20:11,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:20:11,387 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1882 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1882) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1)) is different from false [2022-11-20 12:20:11,755 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1880))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1882)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1)) is different from false [2022-11-20 12:20:11,770 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (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_1880))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1882)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1)) is different from false [2022-11-20 12:20:11,939 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1882 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_18| Int) (v_ArrVal_1880 (Array Int Int))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_18| 1) (select (select (let ((.cse0 (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|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_18|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_18| v_ArrVal_1880))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1882)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_18|) 0)))) is different from false [2022-11-20 12:20:11,966 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1882 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_18| Int) (v_ArrVal_1880 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_18|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_18| 1) (select (select (let ((.cse0 (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_18|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_18| v_ArrVal_1880))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1882)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1))) is different from false [2022-11-20 12:20:12,079 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1876 (Array Int Int)) (v_ArrVal_1882 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_18| Int) (v_ArrVal_1880 (Array Int Int))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_18| 1) (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1876))) (store .cse1 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_18|))) |v_ULTIMATE.start_main_#t~malloc10#1.base_18| v_ArrVal_1880))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1882)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_18|) 0)))) is different from false [2022-11-20 12:20:21,746 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:20:21,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 183 treesize of output 114 [2022-11-20 12:20:21,755 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:20:21,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 472 treesize of output 458 [2022-11-20 12:20:21,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 490 treesize of output 474 [2022-11-20 12:20:21,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 446 treesize of output 414 [2022-11-20 12:20:21,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 442 treesize of output 414 [2022-11-20 12:20:21,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 380 treesize of output 356 [2022-11-20 12:20:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 12:20:30,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885800513] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:20:30,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:20:30,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 19] total 45 [2022-11-20 12:20:30,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569607259] [2022-11-20 12:20:30,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:20:30,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-20 12:20:30,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:20:30,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-20 12:20:30,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1306, Unknown=51, NotChecked=486, Total=2070 [2022-11-20 12:20:30,519 INFO L87 Difference]: Start difference. First operand 410 states and 486 transitions. Second operand has 46 states, 45 states have (on average 3.311111111111111) internal successors, (149), 46 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:37,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:20:37,854 INFO L93 Difference]: Finished difference Result 453 states and 525 transitions. [2022-11-20 12:20:37,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 12:20:37,855 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 3.311111111111111) internal successors, (149), 46 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-11-20 12:20:37,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:20:37,856 INFO L225 Difference]: With dead ends: 453 [2022-11-20 12:20:37,856 INFO L226 Difference]: Without dead ends: 453 [2022-11-20 12:20:37,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 95 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=402, Invalid=2223, Unknown=51, NotChecked=630, Total=3306 [2022-11-20 12:20:37,858 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 213 mSDsluCounter, 2729 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 2281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1784 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-20 12:20:37,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 2890 Invalid, 2281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 480 Invalid, 0 Unknown, 1784 Unchecked, 2.7s Time] [2022-11-20 12:20:37,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-11-20 12:20:37,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 410. [2022-11-20 12:20:37,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 386 states have (on average 1.2564766839378239) internal successors, (485), 409 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:37,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 485 transitions. [2022-11-20 12:20:37,868 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 485 transitions. Word has length 59 [2022-11-20 12:20:37,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:20:37,869 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 485 transitions. [2022-11-20 12:20:37,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 3.311111111111111) internal successors, (149), 46 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:20:37,869 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 485 transitions. [2022-11-20 12:20:37,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 12:20:37,870 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:20:37,871 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, 1, 1] [2022-11-20 12:20:37,882 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-20 12:20:38,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:20:38,079 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-20 12:20:38,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:20:38,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1135767588, now seen corresponding path program 1 times [2022-11-20 12:20:38,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:20:38,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510354954] [2022-11-20 12:20:38,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:20:38,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:20:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:20:42,599 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-20 12:20:42,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:20:42,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510354954] [2022-11-20 12:20:42,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510354954] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:20:42,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209529314] [2022-11-20 12:20:42,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:20:42,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:20:42,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:20:42,601 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:20:42,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14069e3b-017b-4429-844b-044c1aa980aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 12:20:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:20:42,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-20 12:20:42,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:20:42,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 12:20:42,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 12:20:43,314 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:20:43,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 12:20:43,469 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 12:20:43,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 12:20:43,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 12:20:43,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 12:20:44,669 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:20:44,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2022-11-20 12:20:44,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-20 12:20:45,453 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:20:45,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2022-11-20 12:20:45,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-20 12:20:46,756 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-11-20 12:20:46,756 INFO L350 Elim1Store]: Elim1 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-20 12:20:46,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 28 [2022-11-20 12:20:47,298 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 12:20:47,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 12:20:47,433 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-20 12:20:47,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2022-11-20 12:20:49,005 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:20:49,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 87 [2022-11-20 12:20:49,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-11-20 12:20:51,120 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:20:51,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 107 [2022-11-20 12:20:51,192 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:20:51,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 134 [2022-11-20 12:20:52,744 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:20:52,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 107 [2022-11-20 12:20:52,815 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:20:52,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 134 [2022-11-20 12:20:55,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-11-20 12:20:55,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-11-20 12:20:56,171 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-20 12:20:56,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:20:57,561 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_2025 (Array Int Int)) (v_ArrVal_2024 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2025) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2024) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)))) (forall ((v_ArrVal_2025 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2025) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)))))) is different from false [2022-11-20 12:20:57,812 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_2025 (Array Int Int)) (v_ArrVal_2024 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_2025) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_2024) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)))) (forall ((v_ArrVal_2025 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_2025) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 8))))) is different from false [2022-11-20 12:20:57,857 WARN L837 $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| 8))) (and (forall ((v_ArrVal_2025 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2025) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_2025 (Array Int Int)) (v_ArrVal_2024 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2025) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2024) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) is different from false [2022-11-20 12:20:57,931 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_2025 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2021 (Array Int Int)) (v_ArrVal_2020 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2021))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2020) .cse0 v_ArrVal_2025) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2024) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2025 (Array Int Int)) (v_ArrVal_2021 (Array Int Int)) (v_ArrVal_2020 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2020) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2021) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_2025) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 8))))) is different from false [2022-11-20 12:20:57,979 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.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_2025 (Array Int Int)) (v_ArrVal_2021 (Array Int Int)) (v_ArrVal_2020 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2020) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2021) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_2025) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_2025 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2021 (Array Int Int)) (v_ArrVal_2020 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2021))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2020) .cse2 v_ArrVal_2025) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2024) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))))) is different from false [2022-11-20 12:20:58,072 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse1 (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_2025 (Array Int Int)) (v_ArrVal_2021 (Array Int Int)) (v_ArrVal_2020 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse0 |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.offset|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_2020) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |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_2021) |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_2025) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)))) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_2025 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2021 (Array Int Int)) (v_ArrVal_2020 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |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_2021))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse0 |ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.offset|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_2020) .cse3 v_ArrVal_2025) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_2024) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)))))))) is different from false [2022-11-20 12:21:35,913 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:21:35,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 171 [2022-11-20 12:21:35,945 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:21:35,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 111 [2022-11-20 12:21:35,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:21:35,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 524 treesize of output 446 [2022-11-20 12:21:35,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:21:35,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 640 treesize of output 622 [2022-11-20 12:21:36,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 614 treesize of output 534 [2022-11-20 12:21:36,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 654 treesize of output 606 [2022-11-20 12:21:36,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 610 treesize of output 574 [2022-11-20 12:21:36,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 554 treesize of output 538 [2022-11-20 12:21:36,498 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:21:36,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 360 treesize of output 351 [2022-11-20 12:21:36,528 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:21:36,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 340 treesize of output 211 [2022-11-20 12:21:36,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:21:36,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2262 treesize of output 2176 [2022-11-20 12:21:36,604 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:21:36,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9394 treesize of output 9264 [2022-11-20 12:21:36,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9256 treesize of output 8744 [2022-11-20 12:21:36,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10184 treesize of output 9928 [2022-11-20 12:21:36,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12808 treesize of output 12296 [2022-11-20 12:21:36,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13744 treesize of output 13484 [2022-11-20 12:21:36,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15016 treesize of output 14504 [2022-11-20 12:21:37,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12328 treesize of output 11664 [2022-11-20 12:21:37,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10968 treesize of output 10300