./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-01-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/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 ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 11:38:44,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:38:44,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:38:44,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:38:44,333 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:38:44,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:38:44,340 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:38:44,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:38:44,347 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:38:44,348 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:38:44,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:38:44,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:38:44,352 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:38:44,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:38:44,359 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:38:44,362 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:38:44,363 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:38:44,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:38:44,366 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:38:44,368 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:38:44,390 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:38:44,391 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:38:44,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:38:44,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:38:44,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:38:44,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:38:44,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:38:44,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:38:44,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:38:44,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:38:44,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:38:44,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:38:44,407 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:38:44,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:38:44,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:38:44,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:38:44,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:38:44,413 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:38:44,413 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:38:44,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:38:44,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:38:44,417 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 11:38:44,448 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:38:44,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:38:44,457 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:38:44,458 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:38:44,458 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:38:44,459 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:38:44,459 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:38:44,460 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:38:44,460 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:38:44,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:38:44,461 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:38:44,461 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 11:38:44,461 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:38:44,462 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:38:44,462 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:38:44,462 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 11:38:44,462 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 11:38:44,462 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 11:38:44,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:38:44,463 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 11:38:44,463 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:38:44,463 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:38:44,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:38:44,463 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:38:44,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:38:44,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:38:44,464 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:38:44,464 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:38:44,464 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:38:44,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:38:44,465 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/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 -> ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d [2022-11-20 11:38:44,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:38:44,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:38:44,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:38:44,801 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:38:44,801 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:38:44,803 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/forester-heap/sll-01-1.i [2022-11-20 11:38:47,854 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:38:48,194 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:38:48,195 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i [2022-11-20 11:38:48,213 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/data/280acc127/879668eefad34452843164a10b71bf38/FLAGfac5dee4b [2022-11-20 11:38:48,234 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/data/280acc127/879668eefad34452843164a10b71bf38 [2022-11-20 11:38:48,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:38:48,240 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:38:48,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:38:48,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:38:48,251 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:38:48,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:38:48" (1/1) ... [2022-11-20 11:38:48,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a1c6eb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:48, skipping insertion in model container [2022-11-20 11:38:48,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:38:48" (1/1) ... [2022-11-20 11:38:48,261 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:38:48,314 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:38:48,729 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[22034,22047] [2022-11-20 11:38:48,748 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[22307,22320] [2022-11-20 11:38:48,751 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[22516,22529] [2022-11-20 11:38:48,753 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[22586,22599] [2022-11-20 11:38:48,757 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[22853,22866] [2022-11-20 11:38:48,760 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[22961,22974] [2022-11-20 11:38:48,765 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[23192,23205] [2022-11-20 11:38:48,767 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[23272,23285] [2022-11-20 11:38:48,768 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[23351,23364] [2022-11-20 11:38:48,771 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[23441,23454] [2022-11-20 11:38:48,775 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[23619,23632] [2022-11-20 11:38:48,776 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[23697,23710] [2022-11-20 11:38:48,778 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[23774,23787] [2022-11-20 11:38:48,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:38:48,800 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:38:48,849 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[22034,22047] [2022-11-20 11:38:48,852 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[22307,22320] [2022-11-20 11:38:48,853 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[22516,22529] [2022-11-20 11:38:48,854 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[22586,22599] [2022-11-20 11:38:48,856 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[22853,22866] [2022-11-20 11:38:48,857 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[22961,22974] [2022-11-20 11:38:48,859 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[23192,23205] [2022-11-20 11:38:48,860 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[23272,23285] [2022-11-20 11:38:48,861 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[23351,23364] [2022-11-20 11:38:48,862 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[23441,23454] [2022-11-20 11:38:48,863 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[23619,23632] [2022-11-20 11:38:48,864 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[23697,23710] [2022-11-20 11:38:48,864 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_678cd960-3d31-4fa3-8c42-3d88a2e67c08/sv-benchmarks/c/forester-heap/sll-01-1.i[23774,23787] [2022-11-20 11:38:48,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:38:48,891 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:38:48,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:48 WrapperNode [2022-11-20 11:38:48,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:38:48,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:38:48,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:38:48,893 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:38:48,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:48" (1/1) ... [2022-11-20 11:38:48,912 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:48" (1/1) ... [2022-11-20 11:38:48,942 INFO L138 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 227 [2022-11-20 11:38:48,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:38:48,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:38:48,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:38:48,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:38:48,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:48" (1/1) ... [2022-11-20 11:38:48,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:48" (1/1) ... [2022-11-20 11:38:48,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:48" (1/1) ... [2022-11-20 11:38:48,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:48" (1/1) ... [2022-11-20 11:38:48,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:48" (1/1) ... [2022-11-20 11:38:48,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:48" (1/1) ... [2022-11-20 11:38:48,979 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:48" (1/1) ... [2022-11-20 11:38:48,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:48" (1/1) ... [2022-11-20 11:38:48,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:38:48,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:38:48,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:38:48,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:38:48,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:48" (1/1) ... [2022-11-20 11:38:48,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:38:49,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:38:49,019 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:38:49,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:38:49,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 11:38:49,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:38:49,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 11:38:49,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 11:38:49,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:38:49,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:38:49,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:38:49,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:38:49,196 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:38:49,199 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:38:49,845 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:38:49,853 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:38:49,853 INFO L300 CfgBuilder]: Removed 30 assume(true) statements. [2022-11-20 11:38:49,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:38:49 BoogieIcfgContainer [2022-11-20 11:38:49,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:38:49,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:38:49,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:38:49,862 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:38:49,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:38:48" (1/3) ... [2022-11-20 11:38:49,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f67ec32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:38:49, skipping insertion in model container [2022-11-20 11:38:49,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:48" (2/3) ... [2022-11-20 11:38:49,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f67ec32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:38:49, skipping insertion in model container [2022-11-20 11:38:49,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:38:49" (3/3) ... [2022-11-20 11:38:49,865 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2022-11-20 11:38:49,885 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:38:49,885 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 78 error locations. [2022-11-20 11:38:49,934 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:38:49,941 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;@1befcfe5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:38:49,941 INFO L358 AbstractCegarLoop]: Starting to check reachability of 78 error locations. [2022-11-20 11:38:49,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 190 states, 111 states have (on average 2.18018018018018) internal successors, (242), 189 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:49,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 11:38:49,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:49,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 11:38:49,956 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:38:49,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:49,963 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-20 11:38:49,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:49,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754336286] [2022-11-20 11:38:49,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:49,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:38:50,236 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 11:38:50,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:38:50,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754336286] [2022-11-20 11:38:50,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754336286] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:38:50,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:38:50,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:38:50,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657627309] [2022-11-20 11:38:50,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:38:50,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:38:50,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:38:50,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:38:50,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:38:50,342 INFO L87 Difference]: Start difference. First operand has 190 states, 111 states have (on average 2.18018018018018) internal successors, (242), 189 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:50,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:38:50,583 INFO L93 Difference]: Finished difference Result 192 states and 201 transitions. [2022-11-20 11:38:50,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:38:50,585 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 11:38:50,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:38:50,595 INFO L225 Difference]: With dead ends: 192 [2022-11-20 11:38:50,596 INFO L226 Difference]: Without dead ends: 188 [2022-11-20 11:38:50,597 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 11:38:50,601 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 182 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:38:50,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 119 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:38:50,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-11-20 11:38:50,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 183. [2022-11-20 11:38:50,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 113 states have (on average 1.7256637168141593) internal successors, (195), 182 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:50,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 195 transitions. [2022-11-20 11:38:50,676 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 195 transitions. Word has length 3 [2022-11-20 11:38:50,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:38:50,677 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 195 transitions. [2022-11-20 11:38:50,677 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 11:38:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2022-11-20 11:38:50,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 11:38:50,678 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:50,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 11:38:50,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:38:50,681 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:38:50,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:50,683 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-20 11:38:50,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:50,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131196238] [2022-11-20 11:38:50,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:50,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:38:50,790 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 11:38:50,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:38:50,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131196238] [2022-11-20 11:38:50,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131196238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:38:50,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:38:50,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:38:50,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17779465] [2022-11-20 11:38:50,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:38:50,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:38:50,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:38:50,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:38:50,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:38:50,795 INFO L87 Difference]: Start difference. First operand 183 states and 195 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:50,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:38:50,933 INFO L93 Difference]: Finished difference Result 213 states and 224 transitions. [2022-11-20 11:38:50,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:38:50,934 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 11:38:50,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:38:50,935 INFO L225 Difference]: With dead ends: 213 [2022-11-20 11:38:50,935 INFO L226 Difference]: Without dead ends: 213 [2022-11-20 11:38:50,935 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 11:38:50,937 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 172 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:38:50,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 145 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:38:50,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-20 11:38:50,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 193. [2022-11-20 11:38:50,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 130 states have (on average 1.6615384615384616) internal successors, (216), 192 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 216 transitions. [2022-11-20 11:38:50,947 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 216 transitions. Word has length 3 [2022-11-20 11:38:50,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:38:50,948 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 216 transitions. [2022-11-20 11:38:50,948 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 11:38:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 216 transitions. [2022-11-20 11:38:50,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 11:38:50,949 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:50,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 11:38:50,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:38:50,950 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:38:50,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:50,950 INFO L85 PathProgramCache]: Analyzing trace with hash 28691969, now seen corresponding path program 1 times [2022-11-20 11:38:50,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:50,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263671143] [2022-11-20 11:38:50,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:50,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:38:50,984 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 11:38:50,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:38:50,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263671143] [2022-11-20 11:38:50,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263671143] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:38:50,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:38:50,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:38:50,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116373542] [2022-11-20 11:38:50,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:38:50,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:38:50,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:38:50,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:38:50,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:38:50,987 INFO L87 Difference]: Start difference. First operand 193 states and 216 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:51,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:38:51,027 INFO L93 Difference]: Finished difference Result 208 states and 219 transitions. [2022-11-20 11:38:51,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:38:51,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-20 11:38:51,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:38:51,029 INFO L225 Difference]: With dead ends: 208 [2022-11-20 11:38:51,029 INFO L226 Difference]: Without dead ends: 208 [2022-11-20 11:38:51,030 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 11:38:51,031 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 169 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:38:51,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 196 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:38:51,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-11-20 11:38:51,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2022-11-20 11:38:51,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 129 states have (on average 1.6511627906976745) internal successors, (213), 190 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 213 transitions. [2022-11-20 11:38:51,041 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 213 transitions. Word has length 5 [2022-11-20 11:38:51,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:38:51,042 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 213 transitions. [2022-11-20 11:38:51,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:51,042 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 213 transitions. [2022-11-20 11:38:51,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:38:51,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:51,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:38:51,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:38:51,044 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:38:51,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:51,044 INFO L85 PathProgramCache]: Analyzing trace with hash -618617197, now seen corresponding path program 1 times [2022-11-20 11:38:51,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:51,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787223942] [2022-11-20 11:38:51,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:51,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:38:51,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 11:38:51,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:38:51,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787223942] [2022-11-20 11:38:51,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787223942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:38:51,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:38:51,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:38:51,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409701366] [2022-11-20 11:38:51,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:38:51,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:38:51,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:38:51,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:38:51,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:38:51,243 INFO L87 Difference]: Start difference. First operand 191 states and 213 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:51,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:38:51,441 INFO L93 Difference]: Finished difference Result 190 states and 212 transitions. [2022-11-20 11:38:51,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:38:51,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 11:38:51,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:38:51,443 INFO L225 Difference]: With dead ends: 190 [2022-11-20 11:38:51,443 INFO L226 Difference]: Without dead ends: 190 [2022-11-20 11:38:51,443 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 11:38:51,444 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 5 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:38:51,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 518 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:38:51,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-20 11:38:51,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-11-20 11:38:51,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 129 states have (on average 1.6434108527131783) internal successors, (212), 189 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:51,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2022-11-20 11:38:51,453 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 11 [2022-11-20 11:38:51,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:38:51,453 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2022-11-20 11:38:51,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:51,454 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2022-11-20 11:38:51,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:38:51,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:51,455 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:38:51,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:38:51,455 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:38:51,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:51,456 INFO L85 PathProgramCache]: Analyzing trace with hash -618617196, now seen corresponding path program 1 times [2022-11-20 11:38:51,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:51,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410913490] [2022-11-20 11:38:51,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:51,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:38:51,776 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 11:38:51,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:38:51,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410913490] [2022-11-20 11:38:51,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410913490] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:38:51,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:38:51,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:38:51,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265557456] [2022-11-20 11:38:51,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:38:51,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:38:51,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:38:51,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:38:51,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:38:51,779 INFO L87 Difference]: Start difference. First operand 190 states and 212 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:52,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:38:52,013 INFO L93 Difference]: Finished difference Result 189 states and 211 transitions. [2022-11-20 11:38:52,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:38:52,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 11:38:52,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:38:52,015 INFO L225 Difference]: With dead ends: 189 [2022-11-20 11:38:52,015 INFO L226 Difference]: Without dead ends: 189 [2022-11-20 11:38:52,015 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 11:38:52,016 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 3 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:38:52,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 529 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:38:52,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-11-20 11:38:52,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-11-20 11:38:52,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 129 states have (on average 1.6356589147286822) internal successors, (211), 188 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:52,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 211 transitions. [2022-11-20 11:38:52,023 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 211 transitions. Word has length 11 [2022-11-20 11:38:52,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:38:52,024 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 211 transitions. [2022-11-20 11:38:52,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:52,024 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 211 transitions. [2022-11-20 11:38:52,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 11:38:52,025 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:52,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:38:52,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 11:38:52,025 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:38:52,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:52,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2054096635, now seen corresponding path program 1 times [2022-11-20 11:38:52,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:52,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813059011] [2022-11-20 11:38:52,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:52,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:38:52,052 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 11:38:52,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:38:52,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813059011] [2022-11-20 11:38:52,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813059011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:38:52,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:38:52,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:38:52,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367493626] [2022-11-20 11:38:52,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:38:52,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:38:52,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:38:52,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:38:52,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:38:52,055 INFO L87 Difference]: Start difference. First operand 189 states and 211 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:52,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:38:52,066 INFO L93 Difference]: Finished difference Result 190 states and 212 transitions. [2022-11-20 11:38:52,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:38:52,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 11:38:52,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:38:52,068 INFO L225 Difference]: With dead ends: 190 [2022-11-20 11:38:52,068 INFO L226 Difference]: Without dead ends: 190 [2022-11-20 11:38:52,068 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 11:38:52,069 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:38:52,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 348 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:38:52,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-20 11:38:52,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-11-20 11:38:52,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 130 states have (on average 1.6307692307692307) internal successors, (212), 189 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:52,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2022-11-20 11:38:52,075 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 13 [2022-11-20 11:38:52,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:38:52,075 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2022-11-20 11:38:52,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:52,076 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2022-11-20 11:38:52,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 11:38:52,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:52,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:38:52,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 11:38:52,077 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:38:52,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:52,077 INFO L85 PathProgramCache]: Analyzing trace with hash 479764253, now seen corresponding path program 1 times [2022-11-20 11:38:52,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:52,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296178857] [2022-11-20 11:38:52,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:52,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:38:52,298 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 11:38:52,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:38:52,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296178857] [2022-11-20 11:38:52,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296178857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:38:52,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:38:52,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:38:52,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520920257] [2022-11-20 11:38:52,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:38:52,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:38:52,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:38:52,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:38:52,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:38:52,302 INFO L87 Difference]: Start difference. First operand 190 states and 212 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:52,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:38:52,639 INFO L93 Difference]: Finished difference Result 190 states and 211 transitions. [2022-11-20 11:38:52,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:38:52,639 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 11:38:52,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:38:52,640 INFO L225 Difference]: With dead ends: 190 [2022-11-20 11:38:52,641 INFO L226 Difference]: Without dead ends: 190 [2022-11-20 11:38:52,642 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 11:38:52,643 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 171 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:38:52,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 441 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:38:52,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-20 11:38:52,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2022-11-20 11:38:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 130 states have (on average 1.623076923076923) internal successors, (211), 188 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 211 transitions. [2022-11-20 11:38:52,649 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 211 transitions. Word has length 14 [2022-11-20 11:38:52,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:38:52,650 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 211 transitions. [2022-11-20 11:38:52,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:52,651 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 211 transitions. [2022-11-20 11:38:52,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 11:38:52,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:52,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:38:52,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 11:38:52,652 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:38:52,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:52,653 INFO L85 PathProgramCache]: Analyzing trace with hash 479764254, now seen corresponding path program 1 times [2022-11-20 11:38:52,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:52,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255860151] [2022-11-20 11:38:52,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:52,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:38:52,979 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 11:38:52,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:38:52,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255860151] [2022-11-20 11:38:52,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255860151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:38:52,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:38:52,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:38:52,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487812109] [2022-11-20 11:38:52,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:38:52,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:38:52,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:38:52,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:38:52,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:38:52,986 INFO L87 Difference]: Start difference. First operand 189 states and 211 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:53,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:38:53,405 INFO L93 Difference]: Finished difference Result 189 states and 210 transitions. [2022-11-20 11:38:53,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:38:53,405 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 11:38:53,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:38:53,406 INFO L225 Difference]: With dead ends: 189 [2022-11-20 11:38:53,406 INFO L226 Difference]: Without dead ends: 189 [2022-11-20 11:38:53,407 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 11:38:53,407 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 165 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:38:53,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 479 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:38:53,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-11-20 11:38:53,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2022-11-20 11:38:53,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 130 states have (on average 1.6153846153846154) internal successors, (210), 187 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:53,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 210 transitions. [2022-11-20 11:38:53,411 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 210 transitions. Word has length 14 [2022-11-20 11:38:53,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:38:53,412 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 210 transitions. [2022-11-20 11:38:53,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:53,412 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 210 transitions. [2022-11-20 11:38:53,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 11:38:53,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:53,412 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:38:53,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 11:38:53,413 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:38:53,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:53,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1699725866, now seen corresponding path program 1 times [2022-11-20 11:38:53,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:53,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112007898] [2022-11-20 11:38:53,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:53,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:38:53,585 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 11:38:53,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:38:53,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112007898] [2022-11-20 11:38:53,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112007898] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:38:53,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:38:53,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:38:53,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266797325] [2022-11-20 11:38:53,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:38:53,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:38:53,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:38:53,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:38:53,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:38:53,588 INFO L87 Difference]: Start difference. First operand 188 states and 210 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:53,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:38:53,855 INFO L93 Difference]: Finished difference Result 275 states and 303 transitions. [2022-11-20 11:38:53,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 11:38:53,856 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 11:38:53,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:38:53,857 INFO L225 Difference]: With dead ends: 275 [2022-11-20 11:38:53,857 INFO L226 Difference]: Without dead ends: 275 [2022-11-20 11:38:53,858 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 11:38:53,860 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 194 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:38:53,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 699 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:38:53,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-20 11:38:53,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 185. [2022-11-20 11:38:53,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 128 states have (on average 1.6171875) internal successors, (207), 184 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:53,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2022-11-20 11:38:53,868 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 15 [2022-11-20 11:38:53,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:38:53,868 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2022-11-20 11:38:53,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:53,870 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2022-11-20 11:38:53,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 11:38:53,870 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:53,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:38:53,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 11:38:53,872 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:38:53,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:53,874 INFO L85 PathProgramCache]: Analyzing trace with hash -99613104, now seen corresponding path program 1 times [2022-11-20 11:38:53,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:53,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575136988] [2022-11-20 11:38:53,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:53,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:38:53,988 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 11:38:53,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:38:53,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575136988] [2022-11-20 11:38:53,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575136988] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:38:53,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:38:53,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:38:53,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165620595] [2022-11-20 11:38:53,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:38:53,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:38:53,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:38:53,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:38:53,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:38:53,991 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:54,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:38:54,135 INFO L93 Difference]: Finished difference Result 276 states and 303 transitions. [2022-11-20 11:38:54,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:38:54,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 11:38:54,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:38:54,137 INFO L225 Difference]: With dead ends: 276 [2022-11-20 11:38:54,137 INFO L226 Difference]: Without dead ends: 276 [2022-11-20 11:38:54,138 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 11:38:54,138 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 100 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:38:54,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 582 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:38:54,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-11-20 11:38:54,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 188. [2022-11-20 11:38:54,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 131 states have (on average 1.6030534351145038) internal successors, (210), 187 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:54,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 210 transitions. [2022-11-20 11:38:54,144 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 210 transitions. Word has length 17 [2022-11-20 11:38:54,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:38:54,144 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 210 transitions. [2022-11-20 11:38:54,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:54,144 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 210 transitions. [2022-11-20 11:38:54,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 11:38:54,145 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:54,145 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:38:54,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 11:38:54,146 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:38:54,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:54,146 INFO L85 PathProgramCache]: Analyzing trace with hash -582241035, now seen corresponding path program 1 times [2022-11-20 11:38:54,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:54,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821739941] [2022-11-20 11:38:54,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:54,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:38:54,291 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 11:38:54,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:38:54,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821739941] [2022-11-20 11:38:54,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821739941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:38:54,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:38:54,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:38:54,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71734634] [2022-11-20 11:38:54,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:38:54,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:38:54,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:38:54,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:38:54,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:38:54,295 INFO L87 Difference]: Start difference. First operand 188 states and 210 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:54,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:38:54,561 INFO L93 Difference]: Finished difference Result 248 states and 263 transitions. [2022-11-20 11:38:54,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:38:54,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 11:38:54,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:38:54,562 INFO L225 Difference]: With dead ends: 248 [2022-11-20 11:38:54,563 INFO L226 Difference]: Without dead ends: 248 [2022-11-20 11:38:54,563 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 11:38:54,564 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 491 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:38:54,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 186 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:38:54,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-11-20 11:38:54,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 211. [2022-11-20 11:38:54,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 154 states have (on average 1.603896103896104) internal successors, (247), 210 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 247 transitions. [2022-11-20 11:38:54,569 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 247 transitions. Word has length 19 [2022-11-20 11:38:54,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:38:54,570 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 247 transitions. [2022-11-20 11:38:54,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:54,570 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 247 transitions. [2022-11-20 11:38:54,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 11:38:54,570 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:54,571 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:38:54,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 11:38:54,571 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:38:54,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:54,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1187837214, now seen corresponding path program 1 times [2022-11-20 11:38:54,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:54,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401578281] [2022-11-20 11:38:54,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:54,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:38:54,611 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 11:38:54,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:38:54,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401578281] [2022-11-20 11:38:54,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401578281] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:38:54,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:38:54,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:38:54,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908909686] [2022-11-20 11:38:54,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:38:54,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:38:54,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:38:54,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:38:54,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:38:54,614 INFO L87 Difference]: Start difference. First operand 211 states and 247 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:54,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:38:54,743 INFO L93 Difference]: Finished difference Result 243 states and 257 transitions. [2022-11-20 11:38:54,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:38:54,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-20 11:38:54,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:38:54,747 INFO L225 Difference]: With dead ends: 243 [2022-11-20 11:38:54,747 INFO L226 Difference]: Without dead ends: 243 [2022-11-20 11:38:54,747 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 11:38:54,748 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 229 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:38:54,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 277 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:38:54,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-20 11:38:54,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 209. [2022-11-20 11:38:54,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 153 states have (on average 1.5947712418300655) internal successors, (244), 208 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:54,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 244 transitions. [2022-11-20 11:38:54,755 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 244 transitions. Word has length 21 [2022-11-20 11:38:54,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:38:54,756 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 244 transitions. [2022-11-20 11:38:54,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:54,757 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 244 transitions. [2022-11-20 11:38:54,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 11:38:54,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:54,771 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 11:38:54,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 11:38:54,771 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:38:54,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:54,772 INFO L85 PathProgramCache]: Analyzing trace with hash 903845878, now seen corresponding path program 1 times [2022-11-20 11:38:54,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:54,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19441869] [2022-11-20 11:38:54,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:54,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:38:54,875 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 11:38:54,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:38:54,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19441869] [2022-11-20 11:38:54,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19441869] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:38:54,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:38:54,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:38:54,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147124817] [2022-11-20 11:38:54,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:38:54,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:38:54,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:38:54,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:38:54,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:38:54,878 INFO L87 Difference]: Start difference. First operand 209 states and 244 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:55,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:38:55,123 INFO L93 Difference]: Finished difference Result 198 states and 231 transitions. [2022-11-20 11:38:55,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:38:55,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-20 11:38:55,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:38:55,125 INFO L225 Difference]: With dead ends: 198 [2022-11-20 11:38:55,125 INFO L226 Difference]: Without dead ends: 198 [2022-11-20 11:38:55,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:38:55,126 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 98 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:38:55,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 427 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:38:55,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-20 11:38:55,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2022-11-20 11:38:55,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 153 states have (on average 1.5032679738562091) internal successors, (230), 196 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:55,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 230 transitions. [2022-11-20 11:38:55,130 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 230 transitions. Word has length 23 [2022-11-20 11:38:55,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:38:55,131 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 230 transitions. [2022-11-20 11:38:55,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:55,131 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 230 transitions. [2022-11-20 11:38:55,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 11:38:55,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:55,132 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 11:38:55,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 11:38:55,132 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:38:55,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:55,133 INFO L85 PathProgramCache]: Analyzing trace with hash 903845879, now seen corresponding path program 1 times [2022-11-20 11:38:55,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:55,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040615325] [2022-11-20 11:38:55,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:55,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:38:55,325 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 11:38:55,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:38:55,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040615325] [2022-11-20 11:38:55,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040615325] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:38:55,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:38:55,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:38:55,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124369969] [2022-11-20 11:38:55,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:38:55,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:38:55,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:38:55,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:38:55,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:38:55,327 INFO L87 Difference]: Start difference. First operand 197 states and 230 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:55,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:38:55,619 INFO L93 Difference]: Finished difference Result 190 states and 223 transitions. [2022-11-20 11:38:55,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:38:55,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-20 11:38:55,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:38:55,621 INFO L225 Difference]: With dead ends: 190 [2022-11-20 11:38:55,621 INFO L226 Difference]: Without dead ends: 190 [2022-11-20 11:38:55,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:38:55,621 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 41 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:38:55,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 488 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:38:55,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-20 11:38:55,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 183. [2022-11-20 11:38:55,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 148 states have (on average 1.4527027027027026) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:55,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 215 transitions. [2022-11-20 11:38:55,626 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 215 transitions. Word has length 23 [2022-11-20 11:38:55,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:38:55,626 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 215 transitions. [2022-11-20 11:38:55,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:55,626 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 215 transitions. [2022-11-20 11:38:55,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 11:38:55,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:55,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:38:55,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 11:38:55,627 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:38:55,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:55,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1012497526, now seen corresponding path program 1 times [2022-11-20 11:38:55,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:55,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606911147] [2022-11-20 11:38:55,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:55,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:38:55,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:38:55,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:38:55,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606911147] [2022-11-20 11:38:55,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606911147] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:38:55,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:38:55,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:38:55,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497063558] [2022-11-20 11:38:55,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:38:55,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:38:55,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:38:55,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:38:55,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:38:55,760 INFO L87 Difference]: Start difference. First operand 183 states and 215 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:55,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:38:55,926 INFO L93 Difference]: Finished difference Result 186 states and 219 transitions. [2022-11-20 11:38:55,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:38:55,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-20 11:38:55,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:38:55,928 INFO L225 Difference]: With dead ends: 186 [2022-11-20 11:38:55,928 INFO L226 Difference]: Without dead ends: 186 [2022-11-20 11:38:55,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:38:55,929 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 38 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:38:55,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 592 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:38:55,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-11-20 11:38:55,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 179. [2022-11-20 11:38:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 146 states have (on average 1.4452054794520548) internal successors, (211), 178 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:55,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 211 transitions. [2022-11-20 11:38:55,933 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 211 transitions. Word has length 25 [2022-11-20 11:38:55,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:38:55,933 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 211 transitions. [2022-11-20 11:38:55,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:55,933 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 211 transitions. [2022-11-20 11:38:55,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 11:38:55,934 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:55,934 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 11:38:55,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 11:38:55,934 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:38:55,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:55,935 INFO L85 PathProgramCache]: Analyzing trace with hash 476921454, now seen corresponding path program 1 times [2022-11-20 11:38:55,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:55,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335507462] [2022-11-20 11:38:55,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:55,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:38:55,969 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 11:38:55,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:38:55,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335507462] [2022-11-20 11:38:55,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335507462] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:38:55,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:38:55,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:38:55,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241584152] [2022-11-20 11:38:55,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:38:55,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:38:55,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:38:55,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:38:55,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:38:55,971 INFO L87 Difference]: Start difference. First operand 179 states and 211 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:55,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:38:55,981 INFO L93 Difference]: Finished difference Result 252 states and 299 transitions. [2022-11-20 11:38:55,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:38:55,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 11:38:55,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:38:55,984 INFO L225 Difference]: With dead ends: 252 [2022-11-20 11:38:55,984 INFO L226 Difference]: Without dead ends: 252 [2022-11-20 11:38:55,984 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 11:38:55,985 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 50 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:38:55,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 283 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:38:55,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-20 11:38:55,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 185. [2022-11-20 11:38:55,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 184 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:55,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 219 transitions. [2022-11-20 11:38:55,989 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 219 transitions. Word has length 27 [2022-11-20 11:38:55,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:38:55,990 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 219 transitions. [2022-11-20 11:38:55,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:55,990 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2022-11-20 11:38:55,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 11:38:55,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:55,991 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 11:38:55,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 11:38:55,991 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:38:55,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:55,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1899651814, now seen corresponding path program 1 times [2022-11-20 11:38:55,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:55,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232116087] [2022-11-20 11:38:55,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:55,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:38:56,027 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 11:38:56,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:38:56,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232116087] [2022-11-20 11:38:56,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232116087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:38:56,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:38:56,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:38:56,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675532078] [2022-11-20 11:38:56,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:38:56,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:38:56,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:38:56,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:38:56,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:38:56,031 INFO L87 Difference]: Start difference. First operand 185 states and 219 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:56,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:38:56,048 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2022-11-20 11:38:56,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:38:56,049 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 11:38:56,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:38:56,050 INFO L225 Difference]: With dead ends: 183 [2022-11-20 11:38:56,050 INFO L226 Difference]: Without dead ends: 183 [2022-11-20 11:38:56,050 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 11:38:56,051 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 20 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:38:56,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 254 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:38:56,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-20 11:38:56,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-11-20 11:38:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 151 states have (on average 1.4304635761589404) internal successors, (216), 182 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:56,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 216 transitions. [2022-11-20 11:38:56,055 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 216 transitions. Word has length 28 [2022-11-20 11:38:56,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:38:56,055 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 216 transitions. [2022-11-20 11:38:56,055 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 11:38:56,055 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 216 transitions. [2022-11-20 11:38:56,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 11:38:56,056 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:56,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] [2022-11-20 11:38:56,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 11:38:56,056 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:38:56,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:56,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1240331581, now seen corresponding path program 1 times [2022-11-20 11:38:56,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:56,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338169800] [2022-11-20 11:38:56,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:56,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:38:56,372 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 11:38:56,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:38:56,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338169800] [2022-11-20 11:38:56,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338169800] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:38:56,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:38:56,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 11:38:56,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788550365] [2022-11-20 11:38:56,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:38:56,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 11:38:56,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:38:56,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 11:38:56,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:38:56,374 INFO L87 Difference]: Start difference. First operand 183 states and 216 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:56,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:38:56,877 INFO L93 Difference]: Finished difference Result 308 states and 341 transitions. [2022-11-20 11:38:56,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 11:38:56,878 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-20 11:38:56,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:38:56,879 INFO L225 Difference]: With dead ends: 308 [2022-11-20 11:38:56,880 INFO L226 Difference]: Without dead ends: 308 [2022-11-20 11:38:56,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-11-20 11:38:56,880 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 396 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:38:56,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 784 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:38:56,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-11-20 11:38:56,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 216. [2022-11-20 11:38:56,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 215 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:56,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 254 transitions. [2022-11-20 11:38:56,887 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 254 transitions. Word has length 29 [2022-11-20 11:38:56,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:38:56,887 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 254 transitions. [2022-11-20 11:38:56,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:56,888 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 254 transitions. [2022-11-20 11:38:56,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-20 11:38:56,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:56,889 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:38:56,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 11:38:56,890 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:38:56,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:56,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1786976426, now seen corresponding path program 1 times [2022-11-20 11:38:56,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:56,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403081513] [2022-11-20 11:38:56,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:56,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:38:57,132 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 11:38:57,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:38:57,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403081513] [2022-11-20 11:38:57,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403081513] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:38:57,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894592506] [2022-11-20 11:38:57,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:57,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:38:57,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:38:57,138 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:38:57,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:38:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:38:57,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-20 11:38:57,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:38:57,326 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 11:38:57,334 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 11:38:57,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:38:57,426 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 11:38:57,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:38:57,434 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 11:38:57,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:38:57,636 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 11:38:57,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:38:57,651 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:38:57,651 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 11:38:57,668 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 11:38:57,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:38:58,336 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 11:38:58,342 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 11:38:58,353 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 11:38:58,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:38:58,369 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 11:38:58,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894592506] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:38:58,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:38:58,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2022-11-20 11:38:58,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938884796] [2022-11-20 11:38:58,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:38:58,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 11:38:58,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:38:58,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 11:38:58,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:38:58,371 INFO L87 Difference]: Start difference. First operand 216 states and 254 transitions. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:58,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:38:58,914 INFO L93 Difference]: Finished difference Result 500 states and 570 transitions. [2022-11-20 11:38:58,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 11:38:58,914 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-20 11:38:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:38:58,917 INFO L225 Difference]: With dead ends: 500 [2022-11-20 11:38:58,918 INFO L226 Difference]: Without dead ends: 500 [2022-11-20 11:38:58,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2022-11-20 11:38:58,918 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 670 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:38:58,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 934 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 339 Invalid, 0 Unknown, 85 Unchecked, 0.4s Time] [2022-11-20 11:38:58,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-11-20 11:38:58,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 251. [2022-11-20 11:38:58,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 219 states have (on average 1.3789954337899544) internal successors, (302), 250 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:58,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 302 transitions. [2022-11-20 11:38:58,926 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 302 transitions. Word has length 31 [2022-11-20 11:38:58,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:38:58,927 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 302 transitions. [2022-11-20 11:38:58,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:58,928 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 302 transitions. [2022-11-20 11:38:58,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-20 11:38:58,929 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:58,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:38:58,940 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-20 11:38:59,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:38:59,135 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:38:59,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:59,135 INFO L85 PathProgramCache]: Analyzing trace with hash 883081196, now seen corresponding path program 1 times [2022-11-20 11:38:59,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:59,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817460024] [2022-11-20 11:38:59,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:59,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:38:59,277 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 11:38:59,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:38:59,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817460024] [2022-11-20 11:38:59,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817460024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:38:59,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:38:59,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:38:59,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830107802] [2022-11-20 11:38:59,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:38:59,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:38:59,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:38:59,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:38:59,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:38:59,280 INFO L87 Difference]: Start difference. First operand 251 states and 302 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:59,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:38:59,434 INFO L93 Difference]: Finished difference Result 250 states and 301 transitions. [2022-11-20 11:38:59,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:38:59,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-20 11:38:59,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:38:59,436 INFO L225 Difference]: With dead ends: 250 [2022-11-20 11:38:59,436 INFO L226 Difference]: Without dead ends: 250 [2022-11-20 11:38:59,436 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 11:38:59,437 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 5 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:38:59,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 408 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:38:59,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-11-20 11:38:59,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2022-11-20 11:38:59,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 219 states have (on average 1.3744292237442923) internal successors, (301), 249 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:59,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 301 transitions. [2022-11-20 11:38:59,442 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 301 transitions. Word has length 33 [2022-11-20 11:38:59,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:38:59,443 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 301 transitions. [2022-11-20 11:38:59,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:59,443 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 301 transitions. [2022-11-20 11:38:59,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-20 11:38:59,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:59,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:38:59,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 11:38:59,445 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:38:59,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:59,446 INFO L85 PathProgramCache]: Analyzing trace with hash 883081197, now seen corresponding path program 1 times [2022-11-20 11:38:59,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:59,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089429245] [2022-11-20 11:38:59,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:59,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:38:59,691 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 11:38:59,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:38:59,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089429245] [2022-11-20 11:38:59,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089429245] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:38:59,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:38:59,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:38:59,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445136390] [2022-11-20 11:38:59,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:38:59,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:38:59,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:38:59,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:38:59,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:38:59,695 INFO L87 Difference]: Start difference. First operand 250 states and 301 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:59,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:38:59,876 INFO L93 Difference]: Finished difference Result 249 states and 300 transitions. [2022-11-20 11:38:59,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:38:59,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-20 11:38:59,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:38:59,878 INFO L225 Difference]: With dead ends: 249 [2022-11-20 11:38:59,878 INFO L226 Difference]: Without dead ends: 249 [2022-11-20 11:38:59,878 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 11:38:59,878 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 3 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:38:59,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 411 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:38:59,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-11-20 11:38:59,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2022-11-20 11:38:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 219 states have (on average 1.36986301369863) internal successors, (300), 248 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:59,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 300 transitions. [2022-11-20 11:38:59,883 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 300 transitions. Word has length 33 [2022-11-20 11:38:59,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:38:59,883 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 300 transitions. [2022-11-20 11:38:59,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:38:59,884 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 300 transitions. [2022-11-20 11:38:59,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 11:38:59,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:59,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:38:59,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 11:38:59,884 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:38:59,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:59,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1776374941, now seen corresponding path program 1 times [2022-11-20 11:38:59,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:59,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801240807] [2022-11-20 11:38:59,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:59,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:00,215 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 11:39:00,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:39:00,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801240807] [2022-11-20 11:39:00,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801240807] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:39:00,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:39:00,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 11:39:00,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178681137] [2022-11-20 11:39:00,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:39:00,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 11:39:00,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:39:00,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 11:39:00,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:39:00,218 INFO L87 Difference]: Start difference. First operand 249 states and 300 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:00,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:39:00,915 INFO L93 Difference]: Finished difference Result 364 states and 406 transitions. [2022-11-20 11:39:00,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 11:39:00,918 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-20 11:39:00,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:39:00,919 INFO L225 Difference]: With dead ends: 364 [2022-11-20 11:39:00,919 INFO L226 Difference]: Without dead ends: 364 [2022-11-20 11:39:00,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-11-20 11:39:00,920 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 501 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:39:00,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 837 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 11:39:00,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-11-20 11:39:00,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 250. [2022-11-20 11:39:00,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 222 states have (on average 1.3423423423423424) internal successors, (298), 249 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:00,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 298 transitions. [2022-11-20 11:39:00,927 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 298 transitions. Word has length 34 [2022-11-20 11:39:00,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:39:00,927 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 298 transitions. [2022-11-20 11:39:00,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:00,927 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 298 transitions. [2022-11-20 11:39:00,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 11:39:00,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:39:00,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:39:00,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 11:39:00,928 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:39:00,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:39:00,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1776374942, now seen corresponding path program 1 times [2022-11-20 11:39:00,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:39:00,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750313136] [2022-11-20 11:39:00,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:00,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:39:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:01,542 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 11:39:01,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:39:01,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750313136] [2022-11-20 11:39:01,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750313136] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:39:01,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:39:01,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 11:39:01,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164121867] [2022-11-20 11:39:01,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:39:01,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 11:39:01,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:39:01,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 11:39:01,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:39:01,544 INFO L87 Difference]: Start difference. First operand 250 states and 298 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:02,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:39:02,524 INFO L93 Difference]: Finished difference Result 428 states and 464 transitions. [2022-11-20 11:39:02,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 11:39:02,525 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-20 11:39:02,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:39:02,527 INFO L225 Difference]: With dead ends: 428 [2022-11-20 11:39:02,527 INFO L226 Difference]: Without dead ends: 428 [2022-11-20 11:39:02,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2022-11-20 11:39:02,528 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 461 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:39:02,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 1024 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 11:39:02,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-11-20 11:39:02,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 256. [2022-11-20 11:39:02,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 228 states have (on average 1.337719298245614) internal successors, (305), 255 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 305 transitions. [2022-11-20 11:39:02,534 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 305 transitions. Word has length 34 [2022-11-20 11:39:02,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:39:02,535 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 305 transitions. [2022-11-20 11:39:02,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:02,535 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 305 transitions. [2022-11-20 11:39:02,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-20 11:39:02,536 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:39:02,536 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 11:39:02,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 11:39:02,537 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:39:02,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:39:02,538 INFO L85 PathProgramCache]: Analyzing trace with hash -2030948706, now seen corresponding path program 1 times [2022-11-20 11:39:02,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:39:02,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866633895] [2022-11-20 11:39:02,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:02,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:39:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:02,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:39:02,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:39:02,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866633895] [2022-11-20 11:39:02,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866633895] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:39:02,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:39:02,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:39:02,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844300385] [2022-11-20 11:39:02,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:39:02,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:39:02,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:39:02,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:39:02,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:39:02,575 INFO L87 Difference]: Start difference. First operand 256 states and 305 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:02,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:39:02,584 INFO L93 Difference]: Finished difference Result 258 states and 307 transitions. [2022-11-20 11:39:02,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:39:02,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-20 11:39:02,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:39:02,586 INFO L225 Difference]: With dead ends: 258 [2022-11-20 11:39:02,586 INFO L226 Difference]: Without dead ends: 258 [2022-11-20 11:39:02,586 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 11:39:02,587 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:39:02,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:39:02,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-20 11:39:02,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2022-11-20 11:39:02,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 230 states have (on average 1.3347826086956522) internal successors, (307), 257 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 307 transitions. [2022-11-20 11:39:02,592 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 307 transitions. Word has length 35 [2022-11-20 11:39:02,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:39:02,593 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 307 transitions. [2022-11-20 11:39:02,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:02,593 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 307 transitions. [2022-11-20 11:39:02,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 11:39:02,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:39:02,594 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:39:02,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-20 11:39:02,594 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:39:02,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:39:02,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1994309533, now seen corresponding path program 1 times [2022-11-20 11:39:02,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:39:02,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350358336] [2022-11-20 11:39:02,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:02,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:39:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:03,362 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 11:39:03,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:39:03,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350358336] [2022-11-20 11:39:03,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350358336] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:39:03,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:39:03,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-20 11:39:03,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107318494] [2022-11-20 11:39:03,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:39:03,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 11:39:03,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:39:03,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 11:39:03,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-20 11:39:03,365 INFO L87 Difference]: Start difference. First operand 258 states and 307 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:04,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:39:04,338 INFO L93 Difference]: Finished difference Result 420 states and 456 transitions. [2022-11-20 11:39:04,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 11:39:04,338 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-20 11:39:04,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:39:04,340 INFO L225 Difference]: With dead ends: 420 [2022-11-20 11:39:04,340 INFO L226 Difference]: Without dead ends: 420 [2022-11-20 11:39:04,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2022-11-20 11:39:04,342 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 738 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:39:04,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1072 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 11:39:04,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-11-20 11:39:04,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 258. [2022-11-20 11:39:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 230 states have (on average 1.3304347826086957) internal successors, (306), 257 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:04,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 306 transitions. [2022-11-20 11:39:04,357 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 306 transitions. Word has length 36 [2022-11-20 11:39:04,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:39:04,357 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 306 transitions. [2022-11-20 11:39:04,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:04,358 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 306 transitions. [2022-11-20 11:39:04,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 11:39:04,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:39:04,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, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:39:04,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-20 11:39:04,359 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:39:04,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:39:04,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1529477485, now seen corresponding path program 1 times [2022-11-20 11:39:04,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:39:04,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876270566] [2022-11-20 11:39:04,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:04,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:39:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:04,512 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 11:39:04,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:39:04,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876270566] [2022-11-20 11:39:04,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876270566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:39:04,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:39:04,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:39:04,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515033721] [2022-11-20 11:39:04,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:39:04,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:39:04,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:39:04,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:39:04,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:39:04,514 INFO L87 Difference]: Start difference. First operand 258 states and 306 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:04,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:39:04,734 INFO L93 Difference]: Finished difference Result 273 states and 321 transitions. [2022-11-20 11:39:04,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:39:04,735 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-20 11:39:04,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:39:04,736 INFO L225 Difference]: With dead ends: 273 [2022-11-20 11:39:04,736 INFO L226 Difference]: Without dead ends: 273 [2022-11-20 11:39:04,736 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 11:39:04,737 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 60 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:39:04,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 516 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:39:04,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-11-20 11:39:04,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 267. [2022-11-20 11:39:04,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 239 states have (on average 1.3179916317991631) internal successors, (315), 266 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 315 transitions. [2022-11-20 11:39:04,741 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 315 transitions. Word has length 36 [2022-11-20 11:39:04,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:39:04,742 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 315 transitions. [2022-11-20 11:39:04,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:04,742 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 315 transitions. [2022-11-20 11:39:04,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 11:39:04,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:39:04,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:39:04,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-20 11:39:04,743 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:39:04,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:39:04,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1197350168, now seen corresponding path program 1 times [2022-11-20 11:39:04,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:39:04,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040721874] [2022-11-20 11:39:04,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:04,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:39:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:05,059 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 11:39:05,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:39:05,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040721874] [2022-11-20 11:39:05,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040721874] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:39:05,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:39:05,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 11:39:05,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135045620] [2022-11-20 11:39:05,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:39:05,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 11:39:05,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:39:05,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 11:39:05,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:39:05,062 INFO L87 Difference]: Start difference. First operand 267 states and 315 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:05,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:39:05,457 INFO L93 Difference]: Finished difference Result 267 states and 315 transitions. [2022-11-20 11:39:05,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 11:39:05,457 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-20 11:39:05,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:39:05,458 INFO L225 Difference]: With dead ends: 267 [2022-11-20 11:39:05,458 INFO L226 Difference]: Without dead ends: 267 [2022-11-20 11:39:05,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-11-20 11:39:05,459 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 81 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:39:05,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 647 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:39:05,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-11-20 11:39:05,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 266. [2022-11-20 11:39:05,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 239 states have (on average 1.3138075313807531) internal successors, (314), 265 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 314 transitions. [2022-11-20 11:39:05,464 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 314 transitions. Word has length 36 [2022-11-20 11:39:05,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:39:05,464 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 314 transitions. [2022-11-20 11:39:05,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:05,465 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 314 transitions. [2022-11-20 11:39:05,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 11:39:05,465 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:39:05,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:39:05,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-20 11:39:05,465 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:39:05,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:39:05,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1197350169, now seen corresponding path program 1 times [2022-11-20 11:39:05,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:39:05,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582339591] [2022-11-20 11:39:05,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:05,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:39:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:05,894 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 11:39:05,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:39:05,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582339591] [2022-11-20 11:39:05,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582339591] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:39:05,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:39:05,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 11:39:05,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698097508] [2022-11-20 11:39:05,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:39:05,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 11:39:05,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:39:05,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 11:39:05,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:39:05,896 INFO L87 Difference]: Start difference. First operand 266 states and 314 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:06,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:39:06,381 INFO L93 Difference]: Finished difference Result 266 states and 314 transitions. [2022-11-20 11:39:06,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 11:39:06,382 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-20 11:39:06,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:39:06,383 INFO L225 Difference]: With dead ends: 266 [2022-11-20 11:39:06,383 INFO L226 Difference]: Without dead ends: 266 [2022-11-20 11:39:06,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-11-20 11:39:06,384 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 75 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:39:06,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 714 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:39:06,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-11-20 11:39:06,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2022-11-20 11:39:06,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 239 states have (on average 1.3096234309623431) internal successors, (313), 264 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:06,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 313 transitions. [2022-11-20 11:39:06,388 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 313 transitions. Word has length 36 [2022-11-20 11:39:06,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:39:06,389 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 313 transitions. [2022-11-20 11:39:06,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:06,389 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 313 transitions. [2022-11-20 11:39:06,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 11:39:06,389 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:39:06,389 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 11:39:06,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-20 11:39:06,390 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:39:06,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:39:06,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1824914429, now seen corresponding path program 1 times [2022-11-20 11:39:06,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:39:06,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438602235] [2022-11-20 11:39:06,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:06,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:39:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:06,526 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 11:39:06,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:39:06,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438602235] [2022-11-20 11:39:06,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438602235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:39:06,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:39:06,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:39:06,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035318436] [2022-11-20 11:39:06,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:39:06,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:39:06,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:39:06,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:39:06,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:39:06,528 INFO L87 Difference]: Start difference. First operand 265 states and 313 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:06,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:39:06,819 INFO L93 Difference]: Finished difference Result 275 states and 324 transitions. [2022-11-20 11:39:06,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 11:39:06,820 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 11:39:06,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:39:06,821 INFO L225 Difference]: With dead ends: 275 [2022-11-20 11:39:06,821 INFO L226 Difference]: Without dead ends: 275 [2022-11-20 11:39:06,822 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 11:39:06,822 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 23 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:39:06,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 639 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:39:06,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-20 11:39:06,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2022-11-20 11:39:06,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 236 states have (on average 1.305084745762712) internal successors, (308), 260 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:06,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 308 transitions. [2022-11-20 11:39:06,829 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 308 transitions. Word has length 37 [2022-11-20 11:39:06,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:39:06,830 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 308 transitions. [2022-11-20 11:39:06,830 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 11:39:06,830 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 308 transitions. [2022-11-20 11:39:06,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-20 11:39:06,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:39:06,831 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:39:06,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-20 11:39:06,831 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:39:06,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:39:06,832 INFO L85 PathProgramCache]: Analyzing trace with hash -886173384, now seen corresponding path program 1 times [2022-11-20 11:39:06,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:39:06,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039368600] [2022-11-20 11:39:06,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:06,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:39:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:06,875 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 11:39:06,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:39:06,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039368600] [2022-11-20 11:39:06,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039368600] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:39:06,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:39:06,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:39:06,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741812415] [2022-11-20 11:39:06,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:39:06,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:39:06,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:39:06,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:39:06,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:39:06,878 INFO L87 Difference]: Start difference. First operand 261 states and 308 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:06,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:39:06,922 INFO L93 Difference]: Finished difference Result 274 states and 312 transitions. [2022-11-20 11:39:06,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:39:06,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-20 11:39:06,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:39:06,924 INFO L225 Difference]: With dead ends: 274 [2022-11-20 11:39:06,924 INFO L226 Difference]: Without dead ends: 274 [2022-11-20 11:39:06,924 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 11:39:06,925 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 91 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:39:06,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 144 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:39:06,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-11-20 11:39:06,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 262. [2022-11-20 11:39:06,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 237 states have (on average 1.3037974683544304) internal successors, (309), 261 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:06,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 309 transitions. [2022-11-20 11:39:06,932 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 309 transitions. Word has length 38 [2022-11-20 11:39:06,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:39:06,932 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 309 transitions. [2022-11-20 11:39:06,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:06,933 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 309 transitions. [2022-11-20 11:39:06,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 11:39:06,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:39:06,934 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 11:39:06,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-20 11:39:06,934 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:39:06,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:39:06,935 INFO L85 PathProgramCache]: Analyzing trace with hash 196879808, now seen corresponding path program 1 times [2022-11-20 11:39:06,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:39:06,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394813977] [2022-11-20 11:39:06,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:06,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:39:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:07,780 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 11:39:07,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:39:07,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394813977] [2022-11-20 11:39:07,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394813977] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:39:07,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:39:07,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 11:39:07,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677575305] [2022-11-20 11:39:07,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:39:07,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 11:39:07,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:39:07,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 11:39:07,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-11-20 11:39:07,782 INFO L87 Difference]: Start difference. First operand 262 states and 309 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:08,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:39:08,833 INFO L93 Difference]: Finished difference Result 422 states and 457 transitions. [2022-11-20 11:39:08,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 11:39:08,834 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-20 11:39:08,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:39:08,836 INFO L225 Difference]: With dead ends: 422 [2022-11-20 11:39:08,836 INFO L226 Difference]: Without dead ends: 422 [2022-11-20 11:39:08,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2022-11-20 11:39:08,837 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 479 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:39:08,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1142 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 11:39:08,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-11-20 11:39:08,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 262. [2022-11-20 11:39:08,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 237 states have (on average 1.2995780590717299) internal successors, (308), 261 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:08,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 308 transitions. [2022-11-20 11:39:08,847 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 308 transitions. Word has length 39 [2022-11-20 11:39:08,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:39:08,847 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 308 transitions. [2022-11-20 11:39:08,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:08,848 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 308 transitions. [2022-11-20 11:39:08,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 11:39:08,849 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:39:08,849 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 11:39:08,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-20 11:39:08,849 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:39:08,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:39:08,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2051878023, now seen corresponding path program 1 times [2022-11-20 11:39:08,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:39:08,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226371979] [2022-11-20 11:39:08,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:08,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:39:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:08,906 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 11:39:08,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:39:08,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226371979] [2022-11-20 11:39:08,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226371979] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:39:08,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:39:08,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:39:08,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255123792] [2022-11-20 11:39:08,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:39:08,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:39:08,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:39:08,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:39:08,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:39:08,909 INFO L87 Difference]: Start difference. First operand 262 states and 308 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:08,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:39:08,966 INFO L93 Difference]: Finished difference Result 264 states and 309 transitions. [2022-11-20 11:39:08,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:39:08,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-20 11:39:08,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:39:08,968 INFO L225 Difference]: With dead ends: 264 [2022-11-20 11:39:08,968 INFO L226 Difference]: Without dead ends: 264 [2022-11-20 11:39:08,969 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 11:39:08,970 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 82 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:39:08,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 159 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:39:08,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-11-20 11:39:08,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 260. [2022-11-20 11:39:08,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 236 states have (on average 1.2923728813559323) internal successors, (305), 259 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:08,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 305 transitions. [2022-11-20 11:39:08,977 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 305 transitions. Word has length 41 [2022-11-20 11:39:08,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:39:08,978 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 305 transitions. [2022-11-20 11:39:08,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:08,978 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 305 transitions. [2022-11-20 11:39:08,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 11:39:08,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:39:08,979 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:39:08,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-20 11:39:08,979 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:39:08,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:39:08,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1173136884, now seen corresponding path program 1 times [2022-11-20 11:39:08,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:39:08,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8550615] [2022-11-20 11:39:08,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:08,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:39:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:09,204 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 11:39:09,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:39:09,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8550615] [2022-11-20 11:39:09,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8550615] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:39:09,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998825079] [2022-11-20 11:39:09,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:09,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:39:09,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:39:09,207 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:39:09,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:39:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:09,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-20 11:39:09,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:39:09,348 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 11:39:09,356 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 11:39:09,390 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 11:39:09,398 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 11:39:09,530 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 11:39:09,533 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 11:39:09,552 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 11:39:09,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:39:09,700 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 11:39:09,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998825079] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:39:09,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:39:09,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 9 [2022-11-20 11:39:09,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49085040] [2022-11-20 11:39:09,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:39:09,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 11:39:09,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:39:09,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 11:39:09,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:39:09,703 INFO L87 Difference]: Start difference. First operand 260 states and 305 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:10,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:39:10,203 INFO L93 Difference]: Finished difference Result 352 states and 387 transitions. [2022-11-20 11:39:10,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 11:39:10,204 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-20 11:39:10,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:39:10,205 INFO L225 Difference]: With dead ends: 352 [2022-11-20 11:39:10,205 INFO L226 Difference]: Without dead ends: 352 [2022-11-20 11:39:10,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-11-20 11:39:10,206 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 178 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:39:10,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 802 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:39:10,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-11-20 11:39:10,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 284. [2022-11-20 11:39:10,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 260 states have (on average 1.3038461538461539) internal successors, (339), 283 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 339 transitions. [2022-11-20 11:39:10,212 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 339 transitions. Word has length 41 [2022-11-20 11:39:10,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:39:10,212 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 339 transitions. [2022-11-20 11:39:10,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:10,213 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 339 transitions. [2022-11-20 11:39:10,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-20 11:39:10,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:39:10,213 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 11:39:10,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:39:10,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:39:10,419 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:39:10,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:39:10,420 INFO L85 PathProgramCache]: Analyzing trace with hash 816295160, now seen corresponding path program 1 times [2022-11-20 11:39:10,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:39:10,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248396406] [2022-11-20 11:39:10,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:10,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:39:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:10,687 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 11:39:10,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:39:10,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248396406] [2022-11-20 11:39:10,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248396406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:39:10,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:39:10,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 11:39:10,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333628292] [2022-11-20 11:39:10,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:39:10,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 11:39:10,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:39:10,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 11:39:10,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:39:10,689 INFO L87 Difference]: Start difference. First operand 284 states and 339 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:11,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:39:11,145 INFO L93 Difference]: Finished difference Result 348 states and 397 transitions. [2022-11-20 11:39:11,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:39:11,145 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-20 11:39:11,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:39:11,146 INFO L225 Difference]: With dead ends: 348 [2022-11-20 11:39:11,147 INFO L226 Difference]: Without dead ends: 348 [2022-11-20 11:39:11,147 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 11:39:11,147 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 357 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:39:11,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 568 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:39:11,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-11-20 11:39:11,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 291. [2022-11-20 11:39:11,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 267 states have (on average 1.303370786516854) internal successors, (348), 290 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:11,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 348 transitions. [2022-11-20 11:39:11,153 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 348 transitions. Word has length 42 [2022-11-20 11:39:11,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:39:11,153 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 348 transitions. [2022-11-20 11:39:11,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:11,154 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 348 transitions. [2022-11-20 11:39:11,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-20 11:39:11,154 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:39:11,154 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 11:39:11,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-20 11:39:11,155 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:39:11,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:39:11,155 INFO L85 PathProgramCache]: Analyzing trace with hash 816295161, now seen corresponding path program 1 times [2022-11-20 11:39:11,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:39:11,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917665636] [2022-11-20 11:39:11,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:11,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:39:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:11,548 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 11:39:11,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:39:11,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917665636] [2022-11-20 11:39:11,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917665636] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:39:11,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:39:11,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 11:39:11,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50028293] [2022-11-20 11:39:11,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:39:11,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 11:39:11,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:39:11,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 11:39:11,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:39:11,552 INFO L87 Difference]: Start difference. First operand 291 states and 348 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:12,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:39:12,186 INFO L93 Difference]: Finished difference Result 348 states and 397 transitions. [2022-11-20 11:39:12,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:39:12,186 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-20 11:39:12,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:39:12,187 INFO L225 Difference]: With dead ends: 348 [2022-11-20 11:39:12,188 INFO L226 Difference]: Without dead ends: 348 [2022-11-20 11:39:12,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-11-20 11:39:12,188 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 252 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:39:12,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 674 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 11:39:12,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-11-20 11:39:12,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 297. [2022-11-20 11:39:12,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 273 states have (on average 1.3003663003663004) internal successors, (355), 296 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:12,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 355 transitions. [2022-11-20 11:39:12,198 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 355 transitions. Word has length 42 [2022-11-20 11:39:12,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:39:12,199 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 355 transitions. [2022-11-20 11:39:12,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:12,199 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 355 transitions. [2022-11-20 11:39:12,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-20 11:39:12,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:39:12,200 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 11:39:12,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-20 11:39:12,200 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:39:12,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:39:12,201 INFO L85 PathProgramCache]: Analyzing trace with hash 2007506213, now seen corresponding path program 1 times [2022-11-20 11:39:12,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:39:12,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278142361] [2022-11-20 11:39:12,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:12,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:39:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:12,293 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 11:39:12,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:39:12,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278142361] [2022-11-20 11:39:12,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278142361] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:39:12,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104619268] [2022-11-20 11:39:12,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:12,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:39:12,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:39:12,298 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:39:12,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 11:39:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:12,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 11:39:12,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:39:12,499 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 11:39:12,526 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 11:39:12,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:39:12,592 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 11:39:12,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104619268] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:39:12,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:39:12,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-11-20 11:39:12,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154582609] [2022-11-20 11:39:12,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:39:12,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:39:12,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:39:12,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:39:12,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:39:12,594 INFO L87 Difference]: Start difference. First operand 297 states and 355 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:12,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:39:12,705 INFO L93 Difference]: Finished difference Result 328 states and 386 transitions. [2022-11-20 11:39:12,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:39:12,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-20 11:39:12,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:39:12,707 INFO L225 Difference]: With dead ends: 328 [2022-11-20 11:39:12,707 INFO L226 Difference]: Without dead ends: 304 [2022-11-20 11:39:12,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:39:12,708 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:39:12,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 48 Unchecked, 0.1s Time] [2022-11-20 11:39:12,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-11-20 11:39:12,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2022-11-20 11:39:12,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 280 states have (on average 1.292857142857143) internal successors, (362), 303 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:12,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 362 transitions. [2022-11-20 11:39:12,714 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 362 transitions. Word has length 42 [2022-11-20 11:39:12,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:39:12,714 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 362 transitions. [2022-11-20 11:39:12,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:12,714 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 362 transitions. [2022-11-20 11:39:12,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-20 11:39:12,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:39:12,715 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:39:12,725 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 11:39:12,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-20 11:39:12,921 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:39:12,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:39:12,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1167718218, now seen corresponding path program 1 times [2022-11-20 11:39:12,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:39:12,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027186981] [2022-11-20 11:39:12,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:12,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:39:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:12,963 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 11:39:12,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:39:12,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027186981] [2022-11-20 11:39:12,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027186981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:39:12,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:39:12,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:39:12,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398737509] [2022-11-20 11:39:12,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:39:12,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:39:12,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:39:12,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:39:12,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:39:12,965 INFO L87 Difference]: Start difference. First operand 304 states and 362 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:12,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:39:12,978 INFO L93 Difference]: Finished difference Result 458 states and 556 transitions. [2022-11-20 11:39:12,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:39:12,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-20 11:39:12,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:39:12,980 INFO L225 Difference]: With dead ends: 458 [2022-11-20 11:39:12,981 INFO L226 Difference]: Without dead ends: 458 [2022-11-20 11:39:12,981 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 11:39:12,981 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 54 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:39:12,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 318 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:39:12,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-11-20 11:39:12,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 340. [2022-11-20 11:39:12,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 316 states have (on average 1.3259493670886076) internal successors, (419), 339 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:12,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 419 transitions. [2022-11-20 11:39:12,989 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 419 transitions. Word has length 44 [2022-11-20 11:39:12,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:39:12,990 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 419 transitions. [2022-11-20 11:39:12,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:12,990 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 419 transitions. [2022-11-20 11:39:12,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-20 11:39:12,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:39:12,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:39:12,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-20 11:39:12,991 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:39:12,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:39:12,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1519355336, now seen corresponding path program 1 times [2022-11-20 11:39:12,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:39:12,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805015761] [2022-11-20 11:39:12,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:12,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:39:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:13,328 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 11:39:13,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:39:13,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805015761] [2022-11-20 11:39:13,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805015761] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:39:13,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:39:13,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 11:39:13,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256656463] [2022-11-20 11:39:13,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:39:13,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:39:13,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:39:13,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:39:13,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:39:13,331 INFO L87 Difference]: Start difference. First operand 340 states and 419 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:13,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:39:13,807 INFO L93 Difference]: Finished difference Result 370 states and 439 transitions. [2022-11-20 11:39:13,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:39:13,807 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-20 11:39:13,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:39:13,809 INFO L225 Difference]: With dead ends: 370 [2022-11-20 11:39:13,809 INFO L226 Difference]: Without dead ends: 370 [2022-11-20 11:39:13,810 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 11:39:13,812 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 134 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:39:13,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 514 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:39:13,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-11-20 11:39:13,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 340. [2022-11-20 11:39:13,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 316 states have (on average 1.3227848101265822) internal successors, (418), 339 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 418 transitions. [2022-11-20 11:39:13,820 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 418 transitions. Word has length 44 [2022-11-20 11:39:13,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:39:13,821 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 418 transitions. [2022-11-20 11:39:13,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:13,821 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 418 transitions. [2022-11-20 11:39:13,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-20 11:39:13,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:39:13,822 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:39:13,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-20 11:39:13,822 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:39:13,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:39:13,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1190454621, now seen corresponding path program 1 times [2022-11-20 11:39:13,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:39:13,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766264860] [2022-11-20 11:39:13,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:13,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:39:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:13,977 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 11:39:13,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:39:13,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766264860] [2022-11-20 11:39:13,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766264860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:39:13,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:39:13,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:39:13,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66297928] [2022-11-20 11:39:13,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:39:13,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:39:13,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:39:13,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:39:13,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:39:13,979 INFO L87 Difference]: Start difference. First operand 340 states and 418 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:14,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:39:14,103 INFO L93 Difference]: Finished difference Result 287 states and 330 transitions. [2022-11-20 11:39:14,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:39:14,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-11-20 11:39:14,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:39:14,105 INFO L225 Difference]: With dead ends: 287 [2022-11-20 11:39:14,105 INFO L226 Difference]: Without dead ends: 287 [2022-11-20 11:39:14,105 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 11:39:14,105 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 54 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:39:14,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 504 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:39:14,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-11-20 11:39:14,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 286. [2022-11-20 11:39:14,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 263 states have (on average 1.2509505703422052) internal successors, (329), 285 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:14,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 329 transitions. [2022-11-20 11:39:14,111 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 329 transitions. Word has length 46 [2022-11-20 11:39:14,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:39:14,111 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 329 transitions. [2022-11-20 11:39:14,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 329 transitions. [2022-11-20 11:39:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-20 11:39:14,112 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:39:14,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:39:14,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-20 11:39:14,112 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:39:14,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:39:14,112 INFO L85 PathProgramCache]: Analyzing trace with hash 120277254, now seen corresponding path program 1 times [2022-11-20 11:39:14,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:39:14,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154430351] [2022-11-20 11:39:14,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:14,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:39:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:14,433 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 11:39:14,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:39:14,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154430351] [2022-11-20 11:39:14,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154430351] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:39:14,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:39:14,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 11:39:14,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002259995] [2022-11-20 11:39:14,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:39:14,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 11:39:14,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:39:14,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 11:39:14,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:39:14,436 INFO L87 Difference]: Start difference. First operand 286 states and 329 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:14,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:39:14,926 INFO L93 Difference]: Finished difference Result 279 states and 317 transitions. [2022-11-20 11:39:14,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 11:39:14,927 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-11-20 11:39:14,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:39:14,928 INFO L225 Difference]: With dead ends: 279 [2022-11-20 11:39:14,928 INFO L226 Difference]: Without dead ends: 279 [2022-11-20 11:39:14,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-11-20 11:39:14,929 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 413 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:39:14,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 639 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:39:14,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-20 11:39:14,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2022-11-20 11:39:14,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 240 states have (on average 1.2666666666666666) internal successors, (304), 262 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:14,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 304 transitions. [2022-11-20 11:39:14,934 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 304 transitions. Word has length 49 [2022-11-20 11:39:14,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:39:14,934 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 304 transitions. [2022-11-20 11:39:14,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:14,934 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 304 transitions. [2022-11-20 11:39:14,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-20 11:39:14,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:39:14,935 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:39:14,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-20 11:39:14,935 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:39:14,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:39:14,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1590511077, now seen corresponding path program 1 times [2022-11-20 11:39:14,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:39:14,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623431069] [2022-11-20 11:39:14,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:14,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:39:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:15,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 11:39:15,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:39:15,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623431069] [2022-11-20 11:39:15,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623431069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:39:15,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:39:15,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:39:15,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762052666] [2022-11-20 11:39:15,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:39:15,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:39:15,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:39:15,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:39:15,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:39:15,095 INFO L87 Difference]: Start difference. First operand 263 states and 304 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:15,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:39:15,218 INFO L93 Difference]: Finished difference Result 277 states and 318 transitions. [2022-11-20 11:39:15,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:39:15,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-11-20 11:39:15,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:39:15,220 INFO L225 Difference]: With dead ends: 277 [2022-11-20 11:39:15,220 INFO L226 Difference]: Without dead ends: 277 [2022-11-20 11:39:15,220 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 11:39:15,220 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 19 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:39:15,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 474 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:39:15,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-11-20 11:39:15,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 266. [2022-11-20 11:39:15,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 243 states have (on average 1.2592592592592593) internal successors, (306), 265 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:15,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 306 transitions. [2022-11-20 11:39:15,225 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 306 transitions. Word has length 50 [2022-11-20 11:39:15,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:39:15,225 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 306 transitions. [2022-11-20 11:39:15,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:15,225 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 306 transitions. [2022-11-20 11:39:15,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-20 11:39:15,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:39:15,226 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:39:15,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-20 11:39:15,227 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:39:15,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:39:15,227 INFO L85 PathProgramCache]: Analyzing trace with hash -97333738, now seen corresponding path program 1 times [2022-11-20 11:39:15,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:39:15,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959261435] [2022-11-20 11:39:15,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:15,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:39:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:15,579 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 11:39:15,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:39:15,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959261435] [2022-11-20 11:39:15,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959261435] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:39:15,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703747924] [2022-11-20 11:39:15,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:15,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:39:15,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:39:15,580 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:39:15,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 11:39:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:15,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-20 11:39:15,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:39:15,742 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 11:39:15,874 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:39:15,875 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 11:39:15,924 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 11:39:16,075 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:39:16,075 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 11:39:16,178 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:39:16,179 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 11:39:16,374 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:39:16,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-20 11:39:16,455 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 11:39:16,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:39:18,985 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:39:18,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-20 11:39:18,997 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:39:18,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-11-20 11:39:19,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-11-20 11:39:23,830 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 11:39:23,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703747924] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:39:23,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:39:23,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-11-20 11:39:23,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713937359] [2022-11-20 11:39:23,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:39:23,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-20 11:39:23,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:39:23,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-20 11:39:23,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=735, Unknown=6, NotChecked=0, Total=870 [2022-11-20 11:39:23,833 INFO L87 Difference]: Start difference. First operand 266 states and 306 transitions. Second operand has 30 states, 29 states have (on average 5.206896551724138) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:24,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:39:24,441 INFO L93 Difference]: Finished difference Result 285 states and 327 transitions. [2022-11-20 11:39:24,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 11:39:24,442 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 5.206896551724138) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-11-20 11:39:24,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:39:24,445 INFO L225 Difference]: With dead ends: 285 [2022-11-20 11:39:24,446 INFO L226 Difference]: Without dead ends: 285 [2022-11-20 11:39:24,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=209, Invalid=907, Unknown=6, NotChecked=0, Total=1122 [2022-11-20 11:39:24,447 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 246 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 480 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:39:24,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 1167 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 452 Invalid, 0 Unknown, 480 Unchecked, 0.4s Time] [2022-11-20 11:39:24,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-11-20 11:39:24,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 273. [2022-11-20 11:39:24,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 250 states have (on average 1.26) internal successors, (315), 272 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:24,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 315 transitions. [2022-11-20 11:39:24,453 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 315 transitions. Word has length 52 [2022-11-20 11:39:24,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:39:24,453 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 315 transitions. [2022-11-20 11:39:24,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 5.206896551724138) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:24,453 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 315 transitions. [2022-11-20 11:39:24,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-20 11:39:24,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:39:24,454 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:39:24,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 11:39:24,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-11-20 11:39:24,659 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:39:24,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:39:24,660 INFO L85 PathProgramCache]: Analyzing trace with hash -97333737, now seen corresponding path program 1 times [2022-11-20 11:39:24,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:39:24,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182787763] [2022-11-20 11:39:24,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:24,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:39:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:25,204 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 11:39:25,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:39:25,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182787763] [2022-11-20 11:39:25,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182787763] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:39:25,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956556466] [2022-11-20 11:39:25,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:25,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:39:25,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:39:25,206 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:39:25,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 11:39:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:25,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-20 11:39:25,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:39:25,395 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 11:39:25,534 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:39:25,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 11:39:25,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:39:25,608 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 11:39:25,618 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 11:39:25,795 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:39:25,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 11:39:25,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 11:39:25,821 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:39:25,821 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 11:39:25,958 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:39:25,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-20 11:39:25,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 11:39:26,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:39:26,221 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 11:39:26,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:39:26,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 11:39:26,301 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 11:39:26,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:39:27,548 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:39:27,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-20 11:39:27,563 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:39:27,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-11-20 11:39:27,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-11-20 11:39:27,636 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:39:27,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-11-20 11:39:27,650 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:39:27,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-20 11:39:27,655 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:39:27,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:39:27,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:39:27,673 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 27 treesize of output 19 [2022-11-20 11:39:27,679 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:39:27,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:39:27,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:39:27,685 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 20 treesize of output 12 [2022-11-20 11:39:28,164 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 11:39:28,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956556466] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:39:28,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:39:28,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-20 11:39:28,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560719480] [2022-11-20 11:39:28,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:39:28,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-20 11:39:28,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:39:28,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-20 11:39:28,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=892, Unknown=4, NotChecked=0, Total=992 [2022-11-20 11:39:28,167 INFO L87 Difference]: Start difference. First operand 273 states and 315 transitions. Second operand has 32 states, 31 states have (on average 4.967741935483871) internal successors, (154), 32 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:30,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:39:30,959 INFO L93 Difference]: Finished difference Result 468 states and 512 transitions. [2022-11-20 11:39:30,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 11:39:30,960 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.967741935483871) internal successors, (154), 32 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-11-20 11:39:30,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:39:30,962 INFO L225 Difference]: With dead ends: 468 [2022-11-20 11:39:30,962 INFO L226 Difference]: Without dead ends: 468 [2022-11-20 11:39:30,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=473, Invalid=2603, Unknown=4, NotChecked=0, Total=3080 [2022-11-20 11:39:30,964 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 854 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 1703 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 2409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 648 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:39:30,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 1952 Invalid, 2409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1703 Invalid, 0 Unknown, 648 Unchecked, 1.4s Time] [2022-11-20 11:39:30,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-11-20 11:39:30,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 336. [2022-11-20 11:39:30,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 313 states have (on average 1.2619808306709266) internal successors, (395), 335 states have internal predecessors, (395), 0 states have call successors, (0), 0 states 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 11:39:30,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 395 transitions. [2022-11-20 11:39:30,971 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 395 transitions. Word has length 52 [2022-11-20 11:39:30,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:39:30,971 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 395 transitions. [2022-11-20 11:39:30,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.967741935483871) internal successors, (154), 32 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:30,971 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 395 transitions. [2022-11-20 11:39:30,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 11:39:30,972 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:39:30,972 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:39:30,978 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-20 11:39:31,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:39:31,178 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:39:31,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:39:31,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2084299753, now seen corresponding path program 1 times [2022-11-20 11:39:31,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:39:31,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775710334] [2022-11-20 11:39:31,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:31,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:39:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:32,158 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 11:39:32,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:39:32,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775710334] [2022-11-20 11:39:32,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775710334] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:39:32,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809912458] [2022-11-20 11:39:32,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:32,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:39:32,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:39:32,162 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:39:32,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 11:39:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:32,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-20 11:39:32,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:39:32,354 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 11:39:32,402 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:39:32,403 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 11:39:32,459 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 11:39:32,554 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:39:32,554 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 11:39:32,645 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:39:32,646 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 11:39:32,839 INFO L321 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2022-11-20 11:39:32,839 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 11:39:32,929 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-20 11:39:32,930 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 11:39:33,455 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:39:33,456 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 11:39:33,875 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:39:33,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 118 treesize of output 100 [2022-11-20 11:39:34,369 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 11:39:34,574 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 11:39:34,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:39:37,089 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1236 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_14| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14| 1) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_14| v_ArrVal_1236) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|) 0)))) is different from false [2022-11-20 11:39:37,150 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1231 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_14| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14| 1) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1231))) (store .cse0 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|))) |v_ULTIMATE.start_main_#t~malloc10#1.base_14| v_ArrVal_1236) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|) 0)))) is different from false [2022-11-20 11:39:37,563 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:39:37,563 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 95 treesize of output 66 [2022-11-20 11:39:37,568 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:39:37,573 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 546 treesize of output 524 [2022-11-20 11:39:37,582 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 596 treesize of output 564 [2022-11-20 11:39:37,601 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 548 treesize of output 508 [2022-11-20 11:39:37,616 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 528 treesize of output 484 [2022-11-20 11:39:38,100 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 11:39:38,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809912458] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:39:38,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:39:38,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 17] total 42 [2022-11-20 11:39:38,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241930823] [2022-11-20 11:39:38,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:39:38,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-20 11:39:38,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:39:38,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-20 11:39:38,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1377, Unknown=41, NotChecked=158, Total=1806 [2022-11-20 11:39:38,102 INFO L87 Difference]: Start difference. First operand 336 states and 395 transitions. Second operand has 43 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 43 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:41,588 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (forall ((v_ArrVal_1236 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1236) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) 1)) (forall ((v_ArrVal_1236 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1236) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) 1)))) is different from false [2022-11-20 11:39:42,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:39:42,233 INFO L93 Difference]: Finished difference Result 617 states and 714 transitions. [2022-11-20 11:39:42,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-20 11:39:42,233 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 43 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-11-20 11:39:42,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:39:42,235 INFO L225 Difference]: With dead ends: 617 [2022-11-20 11:39:42,235 INFO L226 Difference]: Without dead ends: 617 [2022-11-20 11:39:42,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=485, Invalid=2863, Unknown=86, NotChecked=348, Total=3782 [2022-11-20 11:39:42,237 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 664 mSDsluCounter, 2803 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 2937 SdHoareTripleChecker+Invalid, 3306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2371 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:39:42,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 2937 Invalid, 3306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 912 Invalid, 0 Unknown, 2371 Unchecked, 0.8s Time] [2022-11-20 11:39:42,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-11-20 11:39:42,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 368. [2022-11-20 11:39:42,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 345 states have (on average 1.2463768115942029) internal successors, (430), 367 states have internal predecessors, (430), 0 states have call successors, (0), 0 states 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 11:39:42,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 430 transitions. [2022-11-20 11:39:42,246 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 430 transitions. Word has length 55 [2022-11-20 11:39:42,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:39:42,246 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 430 transitions. [2022-11-20 11:39:42,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 43 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:39:42,246 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 430 transitions. [2022-11-20 11:39:42,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 11:39:42,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:39:42,247 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:39:42,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 11:39:42,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:39:42,453 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:39:42,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:39:42,454 INFO L85 PathProgramCache]: Analyzing trace with hash 2084299754, now seen corresponding path program 1 times [2022-11-20 11:39:42,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:39:42,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571703130] [2022-11-20 11:39:42,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:42,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:39:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:44,988 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 11:39:44,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:39:44,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571703130] [2022-11-20 11:39:44,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571703130] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:39:44,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125845628] [2022-11-20 11:39:44,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:39:44,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:39:44,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:39:44,992 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:39:44,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 11:39:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:39:45,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-20 11:39:45,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:39:45,193 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 11:39:45,291 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:39:45,292 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 11:39:45,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:39:45,360 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 11:39:45,366 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 11:39:45,543 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:39:45,545 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 11:39:45,558 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 11:39:45,679 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:39:45,679 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 11:39:45,693 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 11:39:45,982 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-11-20 11:39:45,982 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 11:39:46,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 11:39:46,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:39:46,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-20 11:39:46,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:39:46,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 11:39:46,425 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:39:46,425 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 57 treesize of output 49 [2022-11-20 11:39:46,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:39:46,439 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 23 treesize of output 23 [2022-11-20 11:39:46,680 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:39:46,680 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 64 treesize of output 57 [2022-11-20 11:39:46,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-11-20 11:39:47,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:39:47,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 11:39:47,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:39:47,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:39:47,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 21 [2022-11-20 11:39:47,338 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 11:39:47,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:39:47,603 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)))) (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 4))))) is different from false [2022-11-20 11:39:47,845 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| 4))) (and (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) is different from false [2022-11-20 11:39:47,866 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.offset|))) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (<= (+ 8 (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ 4 (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) is different from false [2022-11-20 11:40:06,493 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:40:06,494 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 184 treesize of output 175 [2022-11-20 11:40:06,503 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:40:06,504 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 164 treesize of output 115 [2022-11-20 11:40:06,509 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:40:06,514 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 624 treesize of output 594 [2022-11-20 11:40:06,524 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:40:06,535 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 2484 treesize of output 2450 [2022-11-20 11:40:06,553 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:40:06,556 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 2346 treesize of output 2218 [2022-11-20 11:40:06,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:40:06,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2122 treesize of output 1994 [2022-11-20 11:40:06,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:40:06,598 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 1946 treesize of output 1882 [2022-11-20 11:40:06,615 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:40:06,619 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 1842 treesize of output 1774 [2022-11-20 11:40:06,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:40:06,649 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 1730 treesize of output 1550 [2022-11-20 11:40:06,676 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:40:06,679 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 1462 treesize of output 1286 [2022-11-20 11:40:08,921 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:40:08,922 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 92 treesize of output 83 [2022-11-20 11:40:08,933 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:40:08,933 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 72 treesize of output 63 [2022-11-20 11:40:08,940 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 108 treesize of output 90 [2022-11-20 11:40:08,946 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:40:08,949 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 152 treesize of output 146 [2022-11-20 11:40:08,960 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 98 treesize of output 82 [2022-11-20 11:40:08,964 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:40:08,968 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 79 treesize of output 75 [2022-11-20 11:40:08,972 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:40:08,975 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 94 [2022-11-20 11:40:08,979 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:40:08,981 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 96 treesize of output 84 [2022-11-20 11:40:09,359 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 83 treesize of output 81 [2022-11-20 11:40:13,488 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 11:40:13,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125845628] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:40:13,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:40:13,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 17] total 44 [2022-11-20 11:40:13,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385396576] [2022-11-20 11:40:13,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:40:13,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-20 11:40:13,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:40:13,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-20 11:40:13,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1520, Unknown=36, NotChecked=246, Total=1980 [2022-11-20 11:40:13,491 INFO L87 Difference]: Start difference. First operand 368 states and 430 transitions. Second operand has 45 states, 44 states have (on average 3.6136363636363638) internal successors, (159), 45 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:40:23,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:40:23,514 INFO L93 Difference]: Finished difference Result 633 states and 717 transitions. [2022-11-20 11:40:23,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-20 11:40:23,514 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 3.6136363636363638) internal successors, (159), 45 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-11-20 11:40:23,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:40:23,517 INFO L225 Difference]: With dead ends: 633 [2022-11-20 11:40:23,517 INFO L226 Difference]: Without dead ends: 633 [2022-11-20 11:40:23,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1934 ImplicationChecksByTransitivity, 32.1s TimeCoverageRelationStatistics Valid=902, Invalid=6371, Unknown=49, NotChecked=510, Total=7832 [2022-11-20 11:40:23,520 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 980 mSDsluCounter, 2736 mSDsCounter, 0 mSdLazyCounter, 1565 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 2863 SdHoareTripleChecker+Invalid, 3966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2358 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:40:23,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 2863 Invalid, 3966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1565 Invalid, 0 Unknown, 2358 Unchecked, 2.0s Time] [2022-11-20 11:40:23,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2022-11-20 11:40:23,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 367. [2022-11-20 11:40:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 345 states have (on average 1.228985507246377) internal successors, (424), 366 states have internal predecessors, (424), 0 states have call successors, (0), 0 states 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 11:40:23,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 424 transitions. [2022-11-20 11:40:23,528 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 424 transitions. Word has length 55 [2022-11-20 11:40:23,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:40:23,528 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 424 transitions. [2022-11-20 11:40:23,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.6136363636363638) internal successors, (159), 45 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:40:23,529 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 424 transitions. [2022-11-20 11:40:23,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 11:40:23,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:40:23,530 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:40:23,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 11:40:23,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-11-20 11:40:23,736 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:40:23,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:40:23,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1738644409, now seen corresponding path program 1 times [2022-11-20 11:40:23,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:40:23,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945388091] [2022-11-20 11:40:23,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:40:23,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:40:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:40:24,963 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 11:40:24,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:40:24,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945388091] [2022-11-20 11:40:24,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945388091] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:40:24,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27871674] [2022-11-20 11:40:24,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:40:24,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:40:24,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:40:24,966 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:40:24,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 11:40:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:40:25,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-20 11:40:25,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:40:25,177 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 11:40:25,206 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 11:40:25,212 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 11:40:25,382 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:40:25,383 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 11:40:25,472 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-20 11:40:25,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-11-20 11:40:25,502 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-20 11:40:25,502 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 11:40:25,912 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:40:25,913 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 82 treesize of output 72 [2022-11-20 11:40:25,928 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:40:25,928 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 82 treesize of output 84 [2022-11-20 11:40:26,177 INFO L321 Elim1Store]: treesize reduction 4, result has 94.9 percent of original size [2022-11-20 11:40:26,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 142 [2022-11-20 11:40:26,566 INFO L321 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2022-11-20 11:40:26,566 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 67 [2022-11-20 11:40:26,585 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:40:26,586 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 106 treesize of output 108 [2022-11-20 11:40:26,947 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-20 11:40:26,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 108 [2022-11-20 11:40:26,959 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 98 treesize of output 100 [2022-11-20 11:40:27,280 INFO L321 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2022-11-20 11:40:27,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 142 [2022-11-20 11:40:27,302 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:40:27,302 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 122 treesize of output 124 [2022-11-20 11:40:27,391 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 115 treesize of output 103 [2022-11-20 11:40:33,685 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification. DAG size of input: 58 DAG size of output: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:40:34,409 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:40:34,410 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 129 [2022-11-20 11:40:34,435 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 55 treesize of output 47 [2022-11-20 11:40:34,763 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 11:40:34,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:40:35,622 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1464))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) .cse3))) (or (forall ((v_ArrVal_1467 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1465) .cse0 v_ArrVal_1467) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1466 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse2 .cse0 v_ArrVal_1466) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) 1)))))) (forall ((v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse4 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1464))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~end~0#1.base|) .cse3) v_ArrVal_1466)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (or (= .cse4 0) (= (select |c_#valid| .cse4) 1)))))) is different from false [2022-11-20 11:40:35,652 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1464))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) .cse2) v_ArrVal_1466)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 0)))) (forall ((v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1464))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~end~0#1.base|) .cse2))) (or (forall ((v_ArrVal_1466 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse5 .cse6 v_ArrVal_1466) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4)) 1)) (forall ((v_ArrVal_1467 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1465) .cse6 v_ArrVal_1467) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) 0))))))))) is different from false [2022-11-20 11:40:35,716 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:40:35,717 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 183 treesize of output 283 [2022-11-20 11:40:36,032 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse2 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse6 .cse2 |c_ULTIMATE.start_main_#t~malloc13#1.base|)))) (or (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_prenex_6))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) .cse2) v_prenex_5)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (or (= .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) (= .cse0 0)))) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1464))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~end~0#1.base|) .cse2) v_ArrVal_1466)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) |c_ULTIMATE.start_main_~end~0#1.base|))))) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse10 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse6 .cse10 |c_ULTIMATE.start_main_#t~malloc13#1.base|)))) (let ((.cse8 (store .cse11 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1464))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~end~0#1.base|) .cse10))) (or (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1465) .cse7 v_ArrVal_1467) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) 0)) (= (select (select (store .cse8 .cse7 v_ArrVal_1466) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (select (let ((.cse9 (store .cse11 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_prenex_6))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~end~0#1.base|) .cse10) v_prenex_5)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) |c_ULTIMATE.start_main_~end~0#1.base|)))))))) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse15 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse6 .cse15 |c_ULTIMATE.start_main_#t~malloc13#1.base|)))) (let ((.cse12 (select (select (let ((.cse17 (store .cse16 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1464))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~end~0#1.base|) .cse15) v_ArrVal_1466)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (or (= .cse12 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse13 (select (select (let ((.cse14 (store .cse16 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_prenex_6))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~end~0#1.base|) .cse15) v_prenex_5)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (or (= .cse13 |c_ULTIMATE.start_main_~end~0#1.base|) (= .cse12 .cse13) (= .cse13 0))))))))) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse20 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse6 .cse20 |c_ULTIMATE.start_main_#t~malloc13#1.base|)))) (let ((.cse18 (select (select (let ((.cse22 (store .cse21 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_prenex_6))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~end~0#1.base|) .cse20) v_prenex_5)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (or (= .cse18 |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (let ((.cse19 (store .cse21 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1464))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~end~0#1.base|) .cse20) v_ArrVal_1466)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) .cse18) (= .cse18 0)))))) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse27 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse6 .cse27 |c_ULTIMATE.start_main_#t~malloc13#1.base|)))) (let ((.cse29 (store .cse28 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1464))) (let ((.cse23 (select (select .cse29 |c_ULTIMATE.start_main_~end~0#1.base|) .cse27))) (let ((.cse24 (select (select (store .cse29 .cse23 v_ArrVal_1466) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (or (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1465) .cse23 v_ArrVal_1467) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) 0)) (= .cse24 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse25 (select (select (let ((.cse26 (store .cse28 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_prenex_6))) (store .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~end~0#1.base|) .cse27) v_prenex_5)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (or (= .cse25 |c_ULTIMATE.start_main_~end~0#1.base|) (= .cse24 .cse25))))))))))) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse32 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse33 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse6 .cse32 |c_ULTIMATE.start_main_#t~malloc13#1.base|)))) (let ((.cse35 (store .cse33 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1464))) (let ((.cse34 (select (select .cse35 |c_ULTIMATE.start_main_~end~0#1.base|) .cse32))) (let ((.cse30 (select (select (store .cse35 .cse34 v_ArrVal_1466) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (or (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= .cse30 (select (select (let ((.cse31 (store .cse33 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_prenex_6))) (store .cse31 (select (select .cse31 |c_ULTIMATE.start_main_~end~0#1.base|) .cse32) v_prenex_5)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1465) .cse34 v_ArrVal_1467) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) 0)) (= .cse30 |c_ULTIMATE.start_main_~end~0#1.base|)))))))))) is different from false [2022-11-20 11:40:38,228 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:40:38,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 126 [2022-11-20 11:40:38,252 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:40:38,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 126 [2022-11-20 11:40:38,278 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:40:38,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 99 [2022-11-20 11:40:38,301 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:40:38,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 99 [2022-11-20 11:40:43,641 INFO L321 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2022-11-20 11:40:43,641 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 129 treesize of output 102 [2022-11-20 11:40:43,661 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:40:43,662 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 4276 treesize of output 3184 [2022-11-20 11:40:43,700 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:40:43,700 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 3148 treesize of output 2296 [2022-11-20 11:40:43,746 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:40:43,746 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 518 treesize of output 446 [2022-11-20 11:40:43,783 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 438 treesize of output 406 [2022-11-20 11:40:43,815 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 1762 treesize of output 1634 [2022-11-20 11:40:43,859 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:40:43,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1634 treesize of output 1402 [2022-11-20 11:40:44,328 INFO L321 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2022-11-20 11:40:44,328 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 64 treesize of output 77 [2022-11-20 11:40:44,365 INFO L321 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2022-11-20 11:40:44,365 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 116 treesize of output 102 [2022-11-20 11:40:44,381 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:40:44,382 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 615 treesize of output 481 [2022-11-20 11:40:44,393 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:40:44,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 191 [2022-11-20 11:40:44,413 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 180 treesize of output 168 [2022-11-20 11:40:44,427 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 142 treesize of output 126 [2022-11-20 11:40:44,468 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:40:44,468 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 534 treesize of output 414 [2022-11-20 11:40:44,506 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:40:44,506 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 376 treesize of output 320 [2022-11-20 11:40:44,521 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 214 treesize of output 198 [2022-11-20 11:40:44,879 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 11:40:44,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27871674] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:40:44,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:40:44,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 19] total 50 [2022-11-20 11:40:44,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085503284] [2022-11-20 11:40:44,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:40:44,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-20 11:40:44,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:40:44,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-20 11:40:44,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1913, Unknown=52, NotChecked=276, Total=2450 [2022-11-20 11:40:44,881 INFO L87 Difference]: Start difference. First operand 367 states and 424 transitions. Second operand has 50 states, 50 states have (on average 2.94) internal successors, (147), 50 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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 11:40:48,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:40:48,116 INFO L93 Difference]: Finished difference Result 392 states and 451 transitions. [2022-11-20 11:40:48,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 11:40:48,117 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.94) internal successors, (147), 50 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-11-20 11:40:48,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:40:48,118 INFO L225 Difference]: With dead ends: 392 [2022-11-20 11:40:48,118 INFO L226 Difference]: Without dead ends: 392 [2022-11-20 11:40:48,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=395, Invalid=3222, Unknown=55, NotChecked=360, Total=4032 [2022-11-20 11:40:48,120 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 210 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 1705 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1181 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:40:48,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 1705 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 271 Invalid, 0 Unknown, 1181 Unchecked, 0.3s Time] [2022-11-20 11:40:48,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-11-20 11:40:48,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 390. [2022-11-20 11:40:48,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 368 states have (on average 1.2201086956521738) internal successors, (449), 389 states have internal predecessors, (449), 0 states have call successors, (0), 0 states 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 11:40:48,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 449 transitions. [2022-11-20 11:40:48,128 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 449 transitions. Word has length 55 [2022-11-20 11:40:48,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:40:48,128 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 449 transitions. [2022-11-20 11:40:48,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.94) internal successors, (147), 50 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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 11:40:48,128 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 449 transitions. [2022-11-20 11:40:48,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 11:40:48,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:40:48,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:40:48,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 11:40:48,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-11-20 11:40:48,335 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:40:48,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:40:48,336 INFO L85 PathProgramCache]: Analyzing trace with hash 320505786, now seen corresponding path program 1 times [2022-11-20 11:40:48,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:40:48,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304291406] [2022-11-20 11:40:48,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:40:48,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:40:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:40:49,013 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 11:40:49,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:40:49,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304291406] [2022-11-20 11:40:49,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304291406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:40:49,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:40:49,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-20 11:40:49,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344473899] [2022-11-20 11:40:49,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:40:49,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 11:40:49,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:40:49,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 11:40:49,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:40:49,015 INFO L87 Difference]: Start difference. First operand 390 states and 449 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:40:49,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:40:49,868 INFO L93 Difference]: Finished difference Result 414 states and 463 transitions. [2022-11-20 11:40:49,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 11:40:49,869 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-11-20 11:40:49,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:40:49,870 INFO L225 Difference]: With dead ends: 414 [2022-11-20 11:40:49,870 INFO L226 Difference]: Without dead ends: 414 [2022-11-20 11:40:49,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2022-11-20 11:40:49,871 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 270 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:40:49,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 659 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 11:40:49,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-11-20 11:40:49,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 390. [2022-11-20 11:40:49,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 368 states have (on average 1.2173913043478262) internal successors, (448), 389 states have internal predecessors, (448), 0 states have call successors, (0), 0 states 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 11:40:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 448 transitions. [2022-11-20 11:40:49,880 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 448 transitions. Word has length 56 [2022-11-20 11:40:49,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:40:49,880 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 448 transitions. [2022-11-20 11:40:49,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:40:49,881 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 448 transitions. [2022-11-20 11:40:49,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 11:40:49,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:40:49,882 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:40:49,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-20 11:40:49,882 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-11-20 11:40:49,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:40:49,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1557310441, now seen corresponding path program 1 times [2022-11-20 11:40:49,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:40:49,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236742262] [2022-11-20 11:40:49,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:40:49,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:40:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:40:51,638 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 11:40:51,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:40:51,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236742262] [2022-11-20 11:40:51,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236742262] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:40:51,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159843350] [2022-11-20 11:40:51,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:40:51,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:40:51,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:40:51,639 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:40:51,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_678cd960-3d31-4fa3-8c42-3d88a2e67c08/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 11:40:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:40:51,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-20 11:40:51,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:40:51,834 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 11:40:51,893 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:40:51,893 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 11:40:51,951 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 11:40:51,962 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 11:40:52,117 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:40:52,118 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 46 treesize of output 45 [2022-11-20 11:40:52,126 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 11:40:52,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:40:52,268 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-20 11:40:52,268 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 84 treesize of output 56 [2022-11-20 11:40:52,279 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2022-11-20 11:40:52,636 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-11-20 11:40:52,637 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 11:40:52,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:40:52,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:40:52,754 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:40:52,757 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:40:52,758 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 45 [2022-11-20 11:40:52,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:40:52,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-11-20 11:40:53,157 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-20 11:40:53,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 68 [2022-11-20 11:40:53,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:40:53,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2022-11-20 11:40:53,467 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-20 11:40:53,467 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 79 treesize of output 76 [2022-11-20 11:40:53,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2022-11-20 11:40:54,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:40:54,364 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:40:54,373 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-20 11:40:54,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 45 [2022-11-20 11:40:54,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:40:54,388 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 11:40:54,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 21 [2022-11-20 11:40:54,396 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 11:40:54,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:40:54,715 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1611))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1610) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 4)) 0)) (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1610))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1611) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (+ (select (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 4))) 0)))) is different from false [2022-11-20 11:40:55,000 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1610))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1611) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 4))) 0)) (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1611))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1610) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 4)) 0)))) is different from false [2022-11-20 11:40:55,025 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) (.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.offset|)))) (and (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1611))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (+ 4 (select (select (store .cse3 |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1610) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) 0)) (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (let ((.cse4 (store .cse3 |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1610))) (select (select .cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1611) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (+ 4 (select (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))) 0)))) is different from false [2022-11-20 11:41:13,751 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:41:13,752 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 612 treesize of output 523 [2022-11-20 11:41:13,763 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:41:13,763 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 512 treesize of output 323 [2022-11-20 11:41:13,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:41:14,221 INFO L321 Elim1Store]: treesize reduction 271, result has 39.6 percent of original size [2022-11-20 11:41:14,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 1314600 treesize of output 1215028 [2022-11-20 11:41:15,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:41:15,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:41:16,166 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:41:16,170 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 7649186 treesize of output 7144790 [2022-11-20 11:41:31,569 WARN L233 SmtUtils]: Spent 15.40s on a formula simplification that was a NOOP. DAG size: 2618 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 11:41:31,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:41:31,803 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 7652058 treesize of output 6883118 [2022-11-20 11:48:03,738 WARN L233 SmtUtils]: Spent 6.53m on a formula simplification. DAG size of input: 2667 DAG size of output: 2664 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 11:48:04,608 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:48:04,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:48:06,093 INFO L321 Elim1Store]: treesize reduction 51, result has 82.8 percent of original size [2022-11-20 11:48:06,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 7630662 treesize of output 6706282