./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 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_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 06:00:19,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 06:00:19,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 06:00:20,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 06:00:20,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 06:00:20,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 06:00:20,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 06:00:20,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 06:00:20,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 06:00:20,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 06:00:20,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 06:00:20,015 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 06:00:20,015 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 06:00:20,016 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 06:00:20,017 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 06:00:20,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 06:00:20,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 06:00:20,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 06:00:20,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 06:00:20,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 06:00:20,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 06:00:20,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 06:00:20,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 06:00:20,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 06:00:20,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 06:00:20,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 06:00:20,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 06:00:20,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 06:00:20,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 06:00:20,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 06:00:20,032 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 06:00:20,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 06:00:20,033 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 06:00:20,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 06:00:20,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 06:00:20,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 06:00:20,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 06:00:20,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 06:00:20,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 06:00:20,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 06:00:20,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 06:00:20,039 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 06:00:20,060 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 06:00:20,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 06:00:20,061 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 06:00:20,061 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 06:00:20,061 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 06:00:20,062 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 06:00:20,062 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 06:00:20,062 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 06:00:20,062 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 06:00:20,066 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 06:00:20,067 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 06:00:20,067 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 06:00:20,067 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 06:00:20,067 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 06:00:20,067 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 06:00:20,068 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 06:00:20,068 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 06:00:20,068 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 06:00:20,069 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 06:00:20,069 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 06:00:20,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 06:00:20,069 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 06:00:20,069 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 06:00:20,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 06:00:20,070 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 06:00:20,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 06:00:20,070 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 06:00:20,070 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 06:00:20,070 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 06:00:20,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 06:00:20,071 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 06:00:20,071 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 06:00:20,071 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 06:00:20,071 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 06:00:20,072 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 06:00:20,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:00:20,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 06:00:20,072 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 06:00:20,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 06:00:20,073 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 06:00:20,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 06:00:20,073 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 06:00:20,073 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_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c [2022-12-14 06:00:20,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 06:00:20,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 06:00:20,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 06:00:20,294 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 06:00:20,294 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 06:00:20,296 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2022-12-14 06:00:22,875 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 06:00:23,106 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 06:00:23,106 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2022-12-14 06:00:23,117 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/data/6ac1e5818/f65e9dae21e2471b8070a98744a106de/FLAG1c1ea18d6 [2022-12-14 06:00:23,473 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/data/6ac1e5818/f65e9dae21e2471b8070a98744a106de [2022-12-14 06:00:23,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 06:00:23,480 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 06:00:23,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 06:00:23,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 06:00:23,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 06:00:23,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:00:23" (1/1) ... [2022-12-14 06:00:23,488 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a2d6ad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:00:23, skipping insertion in model container [2022-12-14 06:00:23,488 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:00:23" (1/1) ... [2022-12-14 06:00:23,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 06:00:23,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 06:00:23,923 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[44118,44131] [2022-12-14 06:00:23,933 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_ee40455e-da10-443c-9805-37dbe3235d16/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[44660,44673] [2022-12-14 06:00:23,935 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 06:00:23,993 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_ee40455e-da10-443c-9805-37dbe3235d16/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[56247,56260] [2022-12-14 06:00:23,994 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_ee40455e-da10-443c-9805-37dbe3235d16/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[56368,56381] [2022-12-14 06:00:24,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:00:24,015 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-12-14 06:00:24,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5f6db9ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:00:24, skipping insertion in model container [2022-12-14 06:00:24,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 06:00:24,016 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-12-14 06:00:24,017 INFO L158 Benchmark]: Toolchain (without parser) took 537.04ms. Allocated memory is still 140.5MB. Free memory was 105.8MB in the beginning and 83.4MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-12-14 06:00:24,017 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 140.5MB. Free memory was 110.5MB in the beginning and 110.4MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 06:00:24,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.43ms. Allocated memory is still 140.5MB. Free memory was 105.4MB in the beginning and 83.4MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-12-14 06:00:24,019 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 140.5MB. Free memory was 110.5MB in the beginning and 110.4MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 534.43ms. Allocated memory is still 140.5MB. Free memory was 105.4MB in the beginning and 83.4MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 990]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 06:00:25,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 06:00:25,464 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 06:00:25,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 06:00:25,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 06:00:25,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 06:00:25,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 06:00:25,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 06:00:25,489 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 06:00:25,490 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 06:00:25,491 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 06:00:25,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 06:00:25,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 06:00:25,493 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 06:00:25,494 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 06:00:25,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 06:00:25,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 06:00:25,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 06:00:25,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 06:00:25,500 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 06:00:25,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 06:00:25,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 06:00:25,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 06:00:25,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 06:00:25,508 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 06:00:25,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 06:00:25,509 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 06:00:25,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 06:00:25,510 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 06:00:25,511 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 06:00:25,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 06:00:25,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 06:00:25,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 06:00:25,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 06:00:25,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 06:00:25,515 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 06:00:25,516 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 06:00:25,516 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 06:00:25,516 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 06:00:25,517 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 06:00:25,517 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 06:00:25,518 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-12-14 06:00:25,541 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 06:00:25,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 06:00:25,541 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 06:00:25,541 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 06:00:25,542 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 06:00:25,542 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 06:00:25,543 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 06:00:25,543 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 06:00:25,543 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 06:00:25,543 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 06:00:25,543 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 06:00:25,543 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 06:00:25,544 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 06:00:25,544 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 06:00:25,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 06:00:25,545 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 06:00:25,545 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 06:00:25,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 06:00:25,545 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 06:00:25,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 06:00:25,545 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 06:00:25,546 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 06:00:25,546 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 06:00:25,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 06:00:25,546 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 06:00:25,546 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 06:00:25,546 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 06:00:25,547 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 06:00:25,547 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 06:00:25,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 06:00:25,547 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 06:00:25,547 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 06:00:25,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:00:25,548 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 06:00:25,548 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 06:00:25,548 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 06:00:25,548 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 06:00:25,548 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 06:00:25,549 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 06:00:25,549 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c [2022-12-14 06:00:25,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 06:00:25,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 06:00:25,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 06:00:25,775 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 06:00:25,776 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 06:00:25,777 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2022-12-14 06:00:28,377 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 06:00:28,571 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 06:00:28,572 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2022-12-14 06:00:28,584 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/data/6056de0c7/f5e6c989f8804a0e97746f0a9164fa5e/FLAGf56296e4a [2022-12-14 06:00:28,595 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/data/6056de0c7/f5e6c989f8804a0e97746f0a9164fa5e [2022-12-14 06:00:28,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 06:00:28,597 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 06:00:28,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 06:00:28,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 06:00:28,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 06:00:28,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:00:28" (1/1) ... [2022-12-14 06:00:28,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c09390e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:00:28, skipping insertion in model container [2022-12-14 06:00:28,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:00:28" (1/1) ... [2022-12-14 06:00:28,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 06:00:28,644 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 06:00:28,986 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_ee40455e-da10-443c-9805-37dbe3235d16/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[44118,44131] [2022-12-14 06:00:28,996 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_ee40455e-da10-443c-9805-37dbe3235d16/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[44660,44673] [2022-12-14 06:00:28,998 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 06:00:29,058 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_ee40455e-da10-443c-9805-37dbe3235d16/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[56247,56260] [2022-12-14 06:00:29,059 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_ee40455e-da10-443c-9805-37dbe3235d16/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[56368,56381] [2022-12-14 06:00:29,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:00:29,080 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-12-14 06:00:29,103 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 06:00:29,124 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_ee40455e-da10-443c-9805-37dbe3235d16/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[44118,44131] [2022-12-14 06:00:29,126 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_ee40455e-da10-443c-9805-37dbe3235d16/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[44660,44673] [2022-12-14 06:00:29,127 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 06:00:29,178 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_ee40455e-da10-443c-9805-37dbe3235d16/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[56247,56260] [2022-12-14 06:00:29,179 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_ee40455e-da10-443c-9805-37dbe3235d16/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[56368,56381] [2022-12-14 06:00:29,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:00:29,193 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 06:00:29,222 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_ee40455e-da10-443c-9805-37dbe3235d16/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[44118,44131] [2022-12-14 06:00:29,225 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_ee40455e-da10-443c-9805-37dbe3235d16/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[44660,44673] [2022-12-14 06:00:29,226 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 06:00:29,262 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_ee40455e-da10-443c-9805-37dbe3235d16/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[56247,56260] [2022-12-14 06:00:29,263 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_ee40455e-da10-443c-9805-37dbe3235d16/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[56368,56381] [2022-12-14 06:00:29,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:00:29,329 INFO L208 MainTranslator]: Completed translation [2022-12-14 06:00:29,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:00:29 WrapperNode [2022-12-14 06:00:29,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 06:00:29,330 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 06:00:29,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 06:00:29,331 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 06:00:29,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:00:29" (1/1) ... [2022-12-14 06:00:29,367 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:00:29" (1/1) ... [2022-12-14 06:00:29,417 INFO L138 Inliner]: procedures = 285, calls = 347, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1200 [2022-12-14 06:00:29,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 06:00:29,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 06:00:29,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 06:00:29,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 06:00:29,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:00:29" (1/1) ... [2022-12-14 06:00:29,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:00:29" (1/1) ... [2022-12-14 06:00:29,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:00:29" (1/1) ... [2022-12-14 06:00:29,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:00:29" (1/1) ... [2022-12-14 06:00:29,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:00:29" (1/1) ... [2022-12-14 06:00:29,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:00:29" (1/1) ... [2022-12-14 06:00:29,487 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:00:29" (1/1) ... [2022-12-14 06:00:29,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:00:29" (1/1) ... [2022-12-14 06:00:29,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 06:00:29,502 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 06:00:29,502 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 06:00:29,502 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 06:00:29,503 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:00:29" (1/1) ... [2022-12-14 06:00:29,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:00:29,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:00:29,527 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 06:00:29,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 06:00:29,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-12-14 06:00:29,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-14 06:00:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 06:00:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-12-14 06:00:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 06:00:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 06:00:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-14 06:00:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 06:00:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2022-12-14 06:00:29,560 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2022-12-14 06:00:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-14 06:00:29,560 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-14 06:00:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 06:00:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 06:00:29,560 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2022-12-14 06:00:29,561 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2022-12-14 06:00:29,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 06:00:29,561 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2022-12-14 06:00:29,561 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2022-12-14 06:00:29,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 06:00:29,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 06:00:29,775 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 06:00:29,777 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 06:00:33,758 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 06:00:33,767 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 06:00:33,767 INFO L300 CfgBuilder]: Removed 72 assume(true) statements. [2022-12-14 06:00:33,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:00:33 BoogieIcfgContainer [2022-12-14 06:00:33,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 06:00:33,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 06:00:33,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 06:00:33,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 06:00:33,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 06:00:28" (1/3) ... [2022-12-14 06:00:33,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@211be2db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:00:33, skipping insertion in model container [2022-12-14 06:00:33,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:00:29" (2/3) ... [2022-12-14 06:00:33,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@211be2db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:00:33, skipping insertion in model container [2022-12-14 06:00:33,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:00:33" (3/3) ... [2022-12-14 06:00:33,775 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test6-2.i [2022-12-14 06:00:33,788 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 06:00:33,788 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 634 error locations. [2022-12-14 06:00:33,831 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 06:00:33,836 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;@416031e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 06:00:33,836 INFO L358 AbstractCegarLoop]: Starting to check reachability of 634 error locations. [2022-12-14 06:00:33,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 1279 states, 625 states have (on average 2.2448) internal successors, (1403), 1259 states have internal predecessors, (1403), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-14 06:00:33,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 06:00:33,845 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:00:33,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 06:00:33,846 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:00:33,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:00:33,850 INFO L85 PathProgramCache]: Analyzing trace with hash 77521, now seen corresponding path program 1 times [2022-12-14 06:00:33,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:00:33,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568388679] [2022-12-14 06:00:33,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:00:33,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:00:33,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:00:33,860 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:00:33,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-14 06:00:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:00:33,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 06:00:33,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:00:34,033 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 7 [2022-12-14 06:00:34,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:00:34,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:00:34,044 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:00:34,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568388679] [2022-12-14 06:00:34,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568388679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:00:34,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:00:34,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 06:00:34,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326910479] [2022-12-14 06:00:34,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:00:34,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:00:34,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:00:34,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:00:34,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:00:34,074 INFO L87 Difference]: Start difference. First operand has 1279 states, 625 states have (on average 2.2448) internal successors, (1403), 1259 states have internal predecessors, (1403), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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-12-14 06:00:35,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:00:35,876 INFO L93 Difference]: Finished difference Result 1536 states and 1625 transitions. [2022-12-14 06:00:35,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:00:35,878 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-12-14 06:00:35,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:00:35,891 INFO L225 Difference]: With dead ends: 1536 [2022-12-14 06:00:35,892 INFO L226 Difference]: Without dead ends: 1534 [2022-12-14 06:00:35,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:00:35,895 INFO L413 NwaCegarLoop]: 909 mSDtfsCounter, 906 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 06:00:35,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 1254 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-14 06:00:35,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2022-12-14 06:00:35,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1299. [2022-12-14 06:00:35,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1299 states, 659 states have (on average 2.1062215477996964) internal successors, (1388), 1280 states have internal predecessors, (1388), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-12-14 06:00:35,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1418 transitions. [2022-12-14 06:00:35,987 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1418 transitions. Word has length 3 [2022-12-14 06:00:35,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:00:35,988 INFO L495 AbstractCegarLoop]: Abstraction has 1299 states and 1418 transitions. [2022-12-14 06:00:35,988 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-12-14 06:00:35,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1418 transitions. [2022-12-14 06:00:35,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 06:00:35,989 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:00:35,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 06:00:36,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-14 06:00:36,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:00:36,191 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:00:36,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:00:36,193 INFO L85 PathProgramCache]: Analyzing trace with hash 77522, now seen corresponding path program 1 times [2022-12-14 06:00:36,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:00:36,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260749755] [2022-12-14 06:00:36,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:00:36,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:00:36,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:00:36,201 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:00:36,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-14 06:00:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:00:36,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 06:00:36,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:00:36,330 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-12-14 06:00:36,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:00:36,339 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:00:36,339 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:00:36,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260749755] [2022-12-14 06:00:36,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260749755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:00:36,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:00:36,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 06:00:36,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099870750] [2022-12-14 06:00:36,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:00:36,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:00:36,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:00:36,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:00:36,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:00:36,341 INFO L87 Difference]: Start difference. First operand 1299 states and 1418 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-12-14 06:00:39,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:00:39,343 INFO L93 Difference]: Finished difference Result 1890 states and 2056 transitions. [2022-12-14 06:00:39,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:00:39,344 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-12-14 06:00:39,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:00:39,348 INFO L225 Difference]: With dead ends: 1890 [2022-12-14 06:00:39,348 INFO L226 Difference]: Without dead ends: 1890 [2022-12-14 06:00:39,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:00:39,349 INFO L413 NwaCegarLoop]: 1053 mSDtfsCounter, 624 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:00:39,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 1754 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-12-14 06:00:39,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2022-12-14 06:00:39,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1503. [2022-12-14 06:00:39,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 862 states have (on average 2.0881670533642693) internal successors, (1800), 1482 states have internal predecessors, (1800), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-12-14 06:00:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1834 transitions. [2022-12-14 06:00:39,374 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1834 transitions. Word has length 3 [2022-12-14 06:00:39,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:00:39,374 INFO L495 AbstractCegarLoop]: Abstraction has 1503 states and 1834 transitions. [2022-12-14 06:00:39,374 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-12-14 06:00:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1834 transitions. [2022-12-14 06:00:39,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 06:00:39,375 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:00:39,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:00:39,384 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-14 06:00:39,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:00:39,577 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:00:39,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:00:39,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1111693489, now seen corresponding path program 1 times [2022-12-14 06:00:39,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:00:39,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077987922] [2022-12-14 06:00:39,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:00:39,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:00:39,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:00:39,587 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:00:39,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-14 06:00:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:00:39,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 06:00:39,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:00:39,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-12-14 06:00:39,747 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 7 [2022-12-14 06:00:39,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:00:39,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 06:00:39,812 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 06:00:39,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 06:00:39,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:00:39,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:00:39,842 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:00:39,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077987922] [2022-12-14 06:00:39,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077987922] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:00:39,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:00:39,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 06:00:39,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433804500] [2022-12-14 06:00:39,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:00:39,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:00:39,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:00:39,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:00:39,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:00:39,843 INFO L87 Difference]: Start difference. First operand 1503 states and 1834 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:00:44,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:00:44,873 INFO L93 Difference]: Finished difference Result 2568 states and 2977 transitions. [2022-12-14 06:00:44,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:00:44,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 06:00:44,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:00:44,878 INFO L225 Difference]: With dead ends: 2568 [2022-12-14 06:00:44,878 INFO L226 Difference]: Without dead ends: 2568 [2022-12-14 06:00:44,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:00:44,879 INFO L413 NwaCegarLoop]: 716 mSDtfsCounter, 1109 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 2206 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 1808 SdHoareTripleChecker+Invalid, 2220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-12-14 06:00:44,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 1808 Invalid, 2220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2206 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-12-14 06:00:44,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2022-12-14 06:00:44,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 1648. [2022-12-14 06:00:44,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1007 states have (on average 2.0685203574975173) internal successors, (2083), 1627 states have internal predecessors, (2083), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-12-14 06:00:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2117 transitions. [2022-12-14 06:00:44,912 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2117 transitions. Word has length 8 [2022-12-14 06:00:44,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:00:44,913 INFO L495 AbstractCegarLoop]: Abstraction has 1648 states and 2117 transitions. [2022-12-14 06:00:44,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:00:44,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2117 transitions. [2022-12-14 06:00:44,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 06:00:44,913 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:00:44,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:00:44,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-12-14 06:00:45,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:00:45,115 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:00:45,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:00:45,117 INFO L85 PathProgramCache]: Analyzing trace with hash -102759776, now seen corresponding path program 1 times [2022-12-14 06:00:45,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:00:45,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453578003] [2022-12-14 06:00:45,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:00:45,119 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:00:45,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:00:45,122 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:00:45,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-14 06:00:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:00:45,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 06:00:45,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:00:45,275 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 7 [2022-12-14 06:00:45,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:00:45,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:00:45,291 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:00:45,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453578003] [2022-12-14 06:00:45,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453578003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:00:45,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:00:45,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 06:00:45,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851076998] [2022-12-14 06:00:45,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:00:45,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:00:45,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:00:45,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:00:45,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:00:45,293 INFO L87 Difference]: Start difference. First operand 1648 states and 2117 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:00:48,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:00:48,429 INFO L93 Difference]: Finished difference Result 2810 states and 3510 transitions. [2022-12-14 06:00:48,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 06:00:48,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 06:00:48,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:00:48,435 INFO L225 Difference]: With dead ends: 2810 [2022-12-14 06:00:48,435 INFO L226 Difference]: Without dead ends: 2810 [2022-12-14 06:00:48,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:00:48,436 INFO L413 NwaCegarLoop]: 1319 mSDtfsCounter, 2331 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2337 SdHoareTripleChecker+Valid, 2575 SdHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:00:48,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2337 Valid, 2575 Invalid, 1841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1784 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-12-14 06:00:48,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2022-12-14 06:00:48,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 1603. [2022-12-14 06:00:48,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1007 states have (on average 2.009930486593843) internal successors, (2024), 1582 states have internal predecessors, (2024), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-12-14 06:00:48,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2058 transitions. [2022-12-14 06:00:48,477 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2058 transitions. Word has length 9 [2022-12-14 06:00:48,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:00:48,478 INFO L495 AbstractCegarLoop]: Abstraction has 1603 states and 2058 transitions. [2022-12-14 06:00:48,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:00:48,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2058 transitions. [2022-12-14 06:00:48,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 06:00:48,478 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:00:48,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:00:48,486 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-14 06:00:48,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:00:48,679 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:00:48,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:00:48,680 INFO L85 PathProgramCache]: Analyzing trace with hash -102759775, now seen corresponding path program 1 times [2022-12-14 06:00:48,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:00:48,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542770244] [2022-12-14 06:00:48,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:00:48,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:00:48,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:00:48,681 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:00:48,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-14 06:00:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:00:48,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 06:00:48,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:00:48,784 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-12-14 06:00:48,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:00:48,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:00:48,818 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:00:48,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542770244] [2022-12-14 06:00:48,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542770244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:00:48,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:00:48,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 06:00:48,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306415796] [2022-12-14 06:00:48,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:00:48,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:00:48,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:00:48,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:00:48,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:00:48,820 INFO L87 Difference]: Start difference. First operand 1603 states and 2058 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:00:52,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:00:52,954 INFO L93 Difference]: Finished difference Result 2439 states and 3103 transitions. [2022-12-14 06:00:52,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:00:52,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 06:00:52,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:00:52,959 INFO L225 Difference]: With dead ends: 2439 [2022-12-14 06:00:52,959 INFO L226 Difference]: Without dead ends: 2439 [2022-12-14 06:00:52,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:00:52,960 INFO L413 NwaCegarLoop]: 1511 mSDtfsCounter, 1581 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1586 SdHoareTripleChecker+Valid, 2714 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:00:52,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1586 Valid, 2714 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-12-14 06:00:52,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states. [2022-12-14 06:00:52,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 1593. [2022-12-14 06:00:52,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1007 states have (on average 1.9860973187686197) internal successors, (2000), 1572 states have internal predecessors, (2000), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-12-14 06:00:52,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2034 transitions. [2022-12-14 06:00:52,982 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2034 transitions. Word has length 9 [2022-12-14 06:00:52,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:00:52,983 INFO L495 AbstractCegarLoop]: Abstraction has 1593 states and 2034 transitions. [2022-12-14 06:00:52,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:00:52,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2034 transitions. [2022-12-14 06:00:52,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 06:00:52,983 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:00:52,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:00:52,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-12-14 06:00:53,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:00:53,184 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr516ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:00:53,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:00:53,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1033799265, now seen corresponding path program 1 times [2022-12-14 06:00:53,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:00:53,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515709335] [2022-12-14 06:00:53,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:00:53,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:00:53,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:00:53,186 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:00:53,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-14 06:00:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:00:53,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 06:00:53,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:00:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:00:53,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:00:53,330 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:00:53,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515709335] [2022-12-14 06:00:53,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [515709335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:00:53,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:00:53,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:00:53,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887299347] [2022-12-14 06:00:53,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:00:53,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:00:53,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:00:53,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:00:53,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:00:53,332 INFO L87 Difference]: Start difference. First operand 1593 states and 2034 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:00:53,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:00:53,987 INFO L93 Difference]: Finished difference Result 2263 states and 2807 transitions. [2022-12-14 06:00:53,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 06:00:53,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 06:00:53,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:00:53,992 INFO L225 Difference]: With dead ends: 2263 [2022-12-14 06:00:53,992 INFO L226 Difference]: Without dead ends: 2263 [2022-12-14 06:00:53,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:00:53,992 INFO L413 NwaCegarLoop]: 1452 mSDtfsCounter, 749 mSDsluCounter, 2415 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 3867 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 06:00:53,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 3867 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 06:00:53,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2022-12-14 06:00:54,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 1851. [2022-12-14 06:00:54,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1851 states, 1262 states have (on average 1.9904912836767037) internal successors, (2512), 1827 states have internal predecessors, (2512), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-14 06:00:54,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 2552 transitions. [2022-12-14 06:00:54,022 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 2552 transitions. Word has length 11 [2022-12-14 06:00:54,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:00:54,022 INFO L495 AbstractCegarLoop]: Abstraction has 1851 states and 2552 transitions. [2022-12-14 06:00:54,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:00:54,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2552 transitions. [2022-12-14 06:00:54,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 06:00:54,023 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:00:54,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:00:54,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-14 06:00:54,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:00:54,224 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:00:54,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:00:54,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1306900600, now seen corresponding path program 1 times [2022-12-14 06:00:54,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:00:54,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615458229] [2022-12-14 06:00:54,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:00:54,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:00:54,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:00:54,226 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:00:54,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-14 06:00:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:00:54,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 06:00:54,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:00:54,364 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 06:00:54,364 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 06:00:54,365 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 06:00:54,368 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 30 treesize of output 39 [2022-12-14 06:00:54,409 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:00:54,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 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2022-12-14 06:00:54,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:00:54,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:00:54,423 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:00:54,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615458229] [2022-12-14 06:00:54,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615458229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:00:54,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:00:54,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:00:54,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248761888] [2022-12-14 06:00:54,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:00:54,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:00:54,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:00:54,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:00:54,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:00:54,425 INFO L87 Difference]: Start difference. First operand 1851 states and 2552 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:00:55,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:00:55,934 INFO L93 Difference]: Finished difference Result 1999 states and 2407 transitions. [2022-12-14 06:00:55,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:00:55,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-14 06:00:55,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:00:55,939 INFO L225 Difference]: With dead ends: 1999 [2022-12-14 06:00:55,939 INFO L226 Difference]: Without dead ends: 1999 [2022-12-14 06:00:55,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:00:55,939 INFO L413 NwaCegarLoop]: 1384 mSDtfsCounter, 502 mSDsluCounter, 2472 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 3856 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 06:00:55,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 3856 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 06:00:55,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2022-12-14 06:00:55,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1493. [2022-12-14 06:00:55,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 906 states have (on average 1.9757174392935983) internal successors, (1790), 1471 states have internal predecessors, (1790), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-12-14 06:00:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1826 transitions. [2022-12-14 06:00:55,953 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1826 transitions. Word has length 14 [2022-12-14 06:00:55,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:00:55,953 INFO L495 AbstractCegarLoop]: Abstraction has 1493 states and 1826 transitions. [2022-12-14 06:00:55,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:00:55,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1826 transitions. [2022-12-14 06:00:55,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 06:00:55,954 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:00:55,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:00:55,966 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-14 06:00:56,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:00:56,155 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:00:56,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:00:56,156 INFO L85 PathProgramCache]: Analyzing trace with hash 769788685, now seen corresponding path program 1 times [2022-12-14 06:00:56,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:00:56,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [656796054] [2022-12-14 06:00:56,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:00:56,158 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:00:56,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:00:56,161 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:00:56,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-14 06:00:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:00:56,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 06:00:56,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:00:56,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:00:56,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:00:56,310 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:00:56,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [656796054] [2022-12-14 06:00:56,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [656796054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:00:56,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:00:56,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 06:00:56,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777983900] [2022-12-14 06:00:56,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:00:56,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:00:56,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:00:56,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:00:56,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:00:56,312 INFO L87 Difference]: Start difference. First operand 1493 states and 1826 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-12-14 06:00:56,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:00:56,332 INFO L93 Difference]: Finished difference Result 1433 states and 1740 transitions. [2022-12-14 06:00:56,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:00:56,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-12-14 06:00:56,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:00:56,337 INFO L225 Difference]: With dead ends: 1433 [2022-12-14 06:00:56,337 INFO L226 Difference]: Without dead ends: 1433 [2022-12-14 06:00:56,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:00:56,337 INFO L413 NwaCegarLoop]: 1237 mSDtfsCounter, 1163 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:00:56,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 1306 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:00:56,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2022-12-14 06:00:56,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1433. [2022-12-14 06:00:56,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 870 states have (on average 1.9586206896551723) internal successors, (1704), 1411 states have internal predecessors, (1704), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-12-14 06:00:56,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1740 transitions. [2022-12-14 06:00:56,349 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 1740 transitions. Word has length 19 [2022-12-14 06:00:56,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:00:56,349 INFO L495 AbstractCegarLoop]: Abstraction has 1433 states and 1740 transitions. [2022-12-14 06:00:56,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-12-14 06:00:56,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1740 transitions. [2022-12-14 06:00:56,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 06:00:56,349 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:00:56,349 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-12-14 06:00:56,357 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-12-14 06:00:56,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:00:56,551 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:00:56,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:00:56,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1032548102, now seen corresponding path program 1 times [2022-12-14 06:00:56,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:00:56,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911186775] [2022-12-14 06:00:56,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:00:56,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:00:56,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:00:56,557 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:00:56,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-14 06:00:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:00:56,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 06:00:56,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:00:56,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:00:56,846 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:00:56,846 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:00:56,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [911186775] [2022-12-14 06:00:56,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [911186775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:00:56,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:00:56,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:00:56,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113739253] [2022-12-14 06:00:56,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:00:56,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:00:56,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:00:56,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:00:56,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:00:56,847 INFO L87 Difference]: Start difference. First operand 1433 states and 1740 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-12-14 06:00:56,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:00:56,901 INFO L93 Difference]: Finished difference Result 1405 states and 1684 transitions. [2022-12-14 06:00:56,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:00:56,901 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-12-14 06:00:56,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:00:56,904 INFO L225 Difference]: With dead ends: 1405 [2022-12-14 06:00:56,905 INFO L226 Difference]: Without dead ends: 1405 [2022-12-14 06:00:56,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:00:56,905 INFO L413 NwaCegarLoop]: 1192 mSDtfsCounter, 1144 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 2446 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:00:56,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 2446 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:00:56,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2022-12-14 06:00:56,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1403. [2022-12-14 06:00:56,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1403 states, 854 states have (on average 1.9274004683840749) internal successors, (1646), 1381 states have internal predecessors, (1646), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-12-14 06:00:56,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 1682 transitions. [2022-12-14 06:00:56,920 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 1682 transitions. Word has length 21 [2022-12-14 06:00:56,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:00:56,920 INFO L495 AbstractCegarLoop]: Abstraction has 1403 states and 1682 transitions. [2022-12-14 06:00:56,920 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-12-14 06:00:56,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1682 transitions. [2022-12-14 06:00:56,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 06:00:56,920 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:00:56,921 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:00:56,929 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-12-14 06:00:57,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:00:57,123 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:00:57,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:00:57,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308372, now seen corresponding path program 1 times [2022-12-14 06:00:57,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:00:57,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242838656] [2022-12-14 06:00:57,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:00:57,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:00:57,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:00:57,130 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:00:57,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-14 06:00:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:00:57,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 06:00:57,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:00:57,296 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 7 [2022-12-14 06:00:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:00:57,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:00:57,343 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:00:57,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242838656] [2022-12-14 06:00:57,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242838656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:00:57,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:00:57,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:00:57,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790067553] [2022-12-14 06:00:57,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:00:57,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 06:00:57,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:00:57,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 06:00:57,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:00:57,344 INFO L87 Difference]: Start difference. First operand 1403 states and 1682 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 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-12-14 06:01:00,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:01:00,963 INFO L93 Difference]: Finished difference Result 2571 states and 3078 transitions. [2022-12-14 06:01:00,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 06:01:00,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 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-12-14 06:01:00,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:01:00,971 INFO L225 Difference]: With dead ends: 2571 [2022-12-14 06:01:00,971 INFO L226 Difference]: Without dead ends: 2571 [2022-12-14 06:01:00,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:01:00,972 INFO L413 NwaCegarLoop]: 1147 mSDtfsCounter, 2420 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 2363 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2423 SdHoareTripleChecker+Valid, 2731 SdHoareTripleChecker+Invalid, 2381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-12-14 06:01:00,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2423 Valid, 2731 Invalid, 2381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2363 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-12-14 06:01:00,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2022-12-14 06:01:00,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 1399. [2022-12-14 06:01:01,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1399 states, 854 states have (on average 1.9180327868852458) internal successors, (1638), 1377 states have internal predecessors, (1638), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-12-14 06:01:01,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 1674 transitions. [2022-12-14 06:01:01,002 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 1674 transitions. Word has length 35 [2022-12-14 06:01:01,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:01:01,003 INFO L495 AbstractCegarLoop]: Abstraction has 1399 states and 1674 transitions. [2022-12-14 06:01:01,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 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-12-14 06:01:01,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1674 transitions. [2022-12-14 06:01:01,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 06:01:01,004 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:01:01,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:01:01,016 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-12-14 06:01:01,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:01:01,206 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:01:01,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:01:01,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308373, now seen corresponding path program 1 times [2022-12-14 06:01:01,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:01:01,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831932856] [2022-12-14 06:01:01,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:01:01,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:01:01,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:01:01,212 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:01:01,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-12-14 06:01:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:01:01,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 06:01:01,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:01:01,362 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-12-14 06:01:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:01:01,521 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:01:01,521 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:01:01,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831932856] [2022-12-14 06:01:01,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831932856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:01:01,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:01:01,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:01:01,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492555641] [2022-12-14 06:01:01,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:01:01,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 06:01:01,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:01:01,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 06:01:01,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:01:01,522 INFO L87 Difference]: Start difference. First operand 1399 states and 1674 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 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-12-14 06:01:06,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:01:06,211 INFO L93 Difference]: Finished difference Result 2213 states and 2657 transitions. [2022-12-14 06:01:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 06:01:06,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 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-12-14 06:01:06,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:01:06,215 INFO L225 Difference]: With dead ends: 2213 [2022-12-14 06:01:06,215 INFO L226 Difference]: Without dead ends: 2213 [2022-12-14 06:01:06,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:01:06,216 INFO L413 NwaCegarLoop]: 1538 mSDtfsCounter, 2195 mSDsluCounter, 1753 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2195 SdHoareTripleChecker+Valid, 3291 SdHoareTripleChecker+Invalid, 2161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-12-14 06:01:06,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2195 Valid, 3291 Invalid, 2161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2140 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-12-14 06:01:06,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2213 states. [2022-12-14 06:01:06,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2213 to 1395. [2022-12-14 06:01:06,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 854 states have (on average 1.9086651053864168) internal successors, (1630), 1373 states have internal predecessors, (1630), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-12-14 06:01:06,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1666 transitions. [2022-12-14 06:01:06,231 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1666 transitions. Word has length 35 [2022-12-14 06:01:06,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:01:06,231 INFO L495 AbstractCegarLoop]: Abstraction has 1395 states and 1666 transitions. [2022-12-14 06:01:06,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 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-12-14 06:01:06,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1666 transitions. [2022-12-14 06:01:06,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-14 06:01:06,232 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:01:06,232 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] [2022-12-14 06:01:06,241 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-12-14 06:01:06,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:01:06,433 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:01:06,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:01:06,435 INFO L85 PathProgramCache]: Analyzing trace with hash -2063651411, now seen corresponding path program 1 times [2022-12-14 06:01:06,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:01:06,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688471626] [2022-12-14 06:01:06,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:01:06,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:01:06,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:01:06,439 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:01:06,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-12-14 06:01:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:01:06,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 06:01:06,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:01:06,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:01:06,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:01:06,672 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:01:06,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688471626] [2022-12-14 06:01:06,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688471626] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:01:06,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:01:06,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:01:06,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746605956] [2022-12-14 06:01:06,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:01:06,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:01:06,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:01:06,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:01:06,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:01:06,674 INFO L87 Difference]: Start difference. First operand 1395 states and 1666 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:01:06,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:01:06,714 INFO L93 Difference]: Finished difference Result 1383 states and 1646 transitions. [2022-12-14 06:01:06,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:01:06,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-12-14 06:01:06,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:01:06,718 INFO L225 Difference]: With dead ends: 1383 [2022-12-14 06:01:06,718 INFO L226 Difference]: Without dead ends: 1383 [2022-12-14 06:01:06,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:01:06,718 INFO L413 NwaCegarLoop]: 1186 mSDtfsCounter, 1113 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 2424 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:01:06,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 2424 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:01:06,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2022-12-14 06:01:06,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1383. [2022-12-14 06:01:06,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 842 states have (on average 1.9121140142517814) internal successors, (1610), 1361 states have internal predecessors, (1610), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-12-14 06:01:06,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1646 transitions. [2022-12-14 06:01:06,729 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1646 transitions. Word has length 54 [2022-12-14 06:01:06,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:01:06,729 INFO L495 AbstractCegarLoop]: Abstraction has 1383 states and 1646 transitions. [2022-12-14 06:01:06,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:01:06,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1646 transitions. [2022-12-14 06:01:06,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-14 06:01:06,730 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:01:06,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:01:06,739 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-12-14 06:01:06,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:01:06,931 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:01:06,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:01:06,932 INFO L85 PathProgramCache]: Analyzing trace with hash -202865055, now seen corresponding path program 1 times [2022-12-14 06:01:06,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:01:06,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132403925] [2022-12-14 06:01:06,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:01:06,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:01:06,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:01:06,937 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:01:06,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-12-14 06:01:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:01:07,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 06:01:07,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:01:07,378 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 06:01:07,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 24 [2022-12-14 06:01:07,426 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 06:01:07,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-12-14 06:01:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:01:07,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:01:07,720 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:01:07,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132403925] [2022-12-14 06:01:07,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132403925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:01:07,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:01:07,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:01:07,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414480448] [2022-12-14 06:01:07,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:01:07,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 06:01:07,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:01:07,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 06:01:07,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-14 06:01:07,722 INFO L87 Difference]: Start difference. First operand 1383 states and 1646 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:01:11,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:01:11,341 INFO L93 Difference]: Finished difference Result 3211 states and 3774 transitions. [2022-12-14 06:01:11,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:01:11,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-12-14 06:01:11,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:01:11,350 INFO L225 Difference]: With dead ends: 3211 [2022-12-14 06:01:11,350 INFO L226 Difference]: Without dead ends: 3211 [2022-12-14 06:01:11,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-12-14 06:01:11,351 INFO L413 NwaCegarLoop]: 1188 mSDtfsCounter, 3186 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 1755 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3186 SdHoareTripleChecker+Valid, 2330 SdHoareTripleChecker+Invalid, 1796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-12-14 06:01:11,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3186 Valid, 2330 Invalid, 1796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1755 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-12-14 06:01:11,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3211 states. [2022-12-14 06:01:11,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3211 to 1837. [2022-12-14 06:01:11,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1280 states have (on average 1.8984375) internal successors, (2430), 1802 states have internal predecessors, (2430), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-12-14 06:01:11,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2492 transitions. [2022-12-14 06:01:11,377 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2492 transitions. Word has length 62 [2022-12-14 06:01:11,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:01:11,377 INFO L495 AbstractCegarLoop]: Abstraction has 1837 states and 2492 transitions. [2022-12-14 06:01:11,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:01:11,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2492 transitions. [2022-12-14 06:01:11,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-14 06:01:11,378 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:01:11,378 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:01:11,388 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-12-14 06:01:11,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:01:11,579 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:01:11,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:01:11,581 INFO L85 PathProgramCache]: Analyzing trace with hash -202865054, now seen corresponding path program 1 times [2022-12-14 06:01:11,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:01:11,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536911364] [2022-12-14 06:01:11,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:01:11,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:01:11,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:01:11,586 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:01:11,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-12-14 06:01:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:01:11,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-14 06:01:11,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:01:11,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:01:11,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 06:01:11,995 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:01:11,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 06:01:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:01:12,352 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:01:12,352 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:01:12,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536911364] [2022-12-14 06:01:12,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536911364] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:01:12,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:01:12,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:01:12,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510849457] [2022-12-14 06:01:12,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:01:12,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 06:01:12,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:01:12,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 06:01:12,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 06:01:12,354 INFO L87 Difference]: Start difference. First operand 1837 states and 2492 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:01:15,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:01:15,549 INFO L93 Difference]: Finished difference Result 1843 states and 2499 transitions. [2022-12-14 06:01:15,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 06:01:15,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-12-14 06:01:15,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:01:15,554 INFO L225 Difference]: With dead ends: 1843 [2022-12-14 06:01:15,554 INFO L226 Difference]: Without dead ends: 1843 [2022-12-14 06:01:15,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 06:01:15,554 INFO L413 NwaCegarLoop]: 1168 mSDtfsCounter, 111 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 2396 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-12-14 06:01:15,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 2396 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-12-14 06:01:15,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2022-12-14 06:01:15,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1842. [2022-12-14 06:01:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1284 states have (on average 1.895638629283489) internal successors, (2434), 1806 states have internal predecessors, (2434), 32 states have call successors, (32), 9 states have call predecessors, (32), 7 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-12-14 06:01:15,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2498 transitions. [2022-12-14 06:01:15,570 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2498 transitions. Word has length 62 [2022-12-14 06:01:15,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:01:15,571 INFO L495 AbstractCegarLoop]: Abstraction has 1842 states and 2498 transitions. [2022-12-14 06:01:15,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:01:15,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2498 transitions. [2022-12-14 06:01:15,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-14 06:01:15,574 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:01:15,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:01:15,584 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-12-14 06:01:15,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:01:15,775 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:01:15,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:01:15,776 INFO L85 PathProgramCache]: Analyzing trace with hash -904346310, now seen corresponding path program 1 times [2022-12-14 06:01:15,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:01:15,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184882557] [2022-12-14 06:01:15,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:01:15,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:01:15,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:01:15,779 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:01:15,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-12-14 06:01:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:01:16,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 06:01:16,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:01:16,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:01:16,070 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:01:16,070 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:01:16,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184882557] [2022-12-14 06:01:16,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184882557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:01:16,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:01:16,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 06:01:16,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575763391] [2022-12-14 06:01:16,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:01:16,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 06:01:16,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:01:16,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 06:01:16,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 06:01:16,071 INFO L87 Difference]: Start difference. First operand 1842 states and 2498 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:01:16,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:01:16,154 INFO L93 Difference]: Finished difference Result 1868 states and 2525 transitions. [2022-12-14 06:01:16,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 06:01:16,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-12-14 06:01:16,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:01:16,157 INFO L225 Difference]: With dead ends: 1868 [2022-12-14 06:01:16,158 INFO L226 Difference]: Without dead ends: 1868 [2022-12-14 06:01:16,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:01:16,158 INFO L413 NwaCegarLoop]: 1183 mSDtfsCounter, 19 mSDsluCounter, 4722 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 5905 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:01:16,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 5905 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:01:16,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2022-12-14 06:01:16,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1866. [2022-12-14 06:01:16,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1302 states have (on average 1.8870967741935485) internal successors, (2457), 1826 states have internal predecessors, (2457), 34 states have call successors, (34), 13 states have call predecessors, (34), 11 states have return successors, (34), 30 states have call predecessors, (34), 34 states have call successors, (34) [2022-12-14 06:01:16,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2525 transitions. [2022-12-14 06:01:16,194 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2525 transitions. Word has length 68 [2022-12-14 06:01:16,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:01:16,194 INFO L495 AbstractCegarLoop]: Abstraction has 1866 states and 2525 transitions. [2022-12-14 06:01:16,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:01:16,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2525 transitions. [2022-12-14 06:01:16,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-14 06:01:16,195 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:01:16,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:01:16,206 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-12-14 06:01:16,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:01:16,396 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:01:16,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:01:16,397 INFO L85 PathProgramCache]: Analyzing trace with hash -961994179, now seen corresponding path program 1 times [2022-12-14 06:01:16,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:01:16,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859509602] [2022-12-14 06:01:16,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:01:16,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:01:16,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:01:16,400 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:01:16,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-12-14 06:01:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:01:16,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 06:01:16,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:01:16,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:01:16,742 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:01:16,742 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:01:16,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859509602] [2022-12-14 06:01:16,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859509602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:01:16,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:01:16,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 06:01:16,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656807707] [2022-12-14 06:01:16,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:01:16,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 06:01:16,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:01:16,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 06:01:16,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 06:01:16,744 INFO L87 Difference]: Start difference. First operand 1866 states and 2525 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 06:01:16,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:01:16,901 INFO L93 Difference]: Finished difference Result 1878 states and 2539 transitions. [2022-12-14 06:01:16,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 06:01:16,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-12-14 06:01:16,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:01:16,904 INFO L225 Difference]: With dead ends: 1878 [2022-12-14 06:01:16,904 INFO L226 Difference]: Without dead ends: 1878 [2022-12-14 06:01:16,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 06:01:16,905 INFO L413 NwaCegarLoop]: 1169 mSDtfsCounter, 20 mSDsluCounter, 3444 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4613 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:01:16,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4613 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:01:16,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2022-12-14 06:01:16,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1869. [2022-12-14 06:01:16,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1304 states have (on average 1.8857361963190185) internal successors, (2459), 1828 states have internal predecessors, (2459), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2022-12-14 06:01:16,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2528 transitions. [2022-12-14 06:01:16,927 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2528 transitions. Word has length 68 [2022-12-14 06:01:16,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:01:16,927 INFO L495 AbstractCegarLoop]: Abstraction has 1869 states and 2528 transitions. [2022-12-14 06:01:16,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 06:01:16,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2528 transitions. [2022-12-14 06:01:16,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-14 06:01:16,928 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:01:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:01:16,940 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-12-14 06:01:17,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:01:17,128 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:01:17,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:01:17,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1684223946, now seen corresponding path program 1 times [2022-12-14 06:01:17,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:01:17,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824551069] [2022-12-14 06:01:17,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:01:17,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:01:17,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:01:17,130 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:01:17,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-12-14 06:01:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:01:17,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 06:01:17,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:01:17,516 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 7 [2022-12-14 06:01:17,623 WARN L859 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |alt_malloc_#res.base| (_ bv1 1)))) is different from true [2022-12-14 06:01:17,640 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 06:01:17,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-14 06:01:17,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:01:17,651 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:01:17,651 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:01:17,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824551069] [2022-12-14 06:01:17,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824551069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:01:17,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:01:17,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 06:01:17,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249184389] [2022-12-14 06:01:17,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:01:17,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 06:01:17,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:01:17,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 06:01:17,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2022-12-14 06:01:17,653 INFO L87 Difference]: Start difference. First operand 1869 states and 2528 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:01:21,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:01:21,497 INFO L93 Difference]: Finished difference Result 3193 states and 4238 transitions. [2022-12-14 06:01:21,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 06:01:21,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2022-12-14 06:01:21,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:01:21,502 INFO L225 Difference]: With dead ends: 3193 [2022-12-14 06:01:21,502 INFO L226 Difference]: Without dead ends: 3193 [2022-12-14 06:01:21,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2022-12-14 06:01:21,502 INFO L413 NwaCegarLoop]: 1101 mSDtfsCounter, 1620 mSDsluCounter, 1926 mSDsCounter, 0 mSdLazyCounter, 2738 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1626 SdHoareTripleChecker+Valid, 3027 SdHoareTripleChecker+Invalid, 4371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1612 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-12-14 06:01:21,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1626 Valid, 3027 Invalid, 4371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2738 Invalid, 0 Unknown, 1612 Unchecked, 3.8s Time] [2022-12-14 06:01:21,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2022-12-14 06:01:21,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 1868. [2022-12-14 06:01:21,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1868 states, 1304 states have (on average 1.88420245398773) internal successors, (2457), 1827 states have internal predecessors, (2457), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2022-12-14 06:01:21,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2526 transitions. [2022-12-14 06:01:21,529 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2526 transitions. Word has length 73 [2022-12-14 06:01:21,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:01:21,529 INFO L495 AbstractCegarLoop]: Abstraction has 1868 states and 2526 transitions. [2022-12-14 06:01:21,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:01:21,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2526 transitions. [2022-12-14 06:01:21,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-14 06:01:21,530 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:01:21,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:01:21,545 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-12-14 06:01:21,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:01:21,732 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:01:21,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:01:21,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1684223945, now seen corresponding path program 1 times [2022-12-14 06:01:21,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:01:21,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612253504] [2022-12-14 06:01:21,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:01:21,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:01:21,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:01:21,738 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:01:21,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-12-14 06:01:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:01:22,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 06:01:22,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:01:22,088 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 7 [2022-12-14 06:01:22,092 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-12-14 06:01:22,412 WARN L859 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_1107 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |alt_malloc_#res.base| v_ArrVal_1107))) (= (_ bv0 1) (select |c_old(#valid)| |alt_malloc_#res.base|)))) is different from true [2022-12-14 06:01:22,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:01:22,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 06:01:22,431 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 06:01:22,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 06:01:22,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:01:22,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:01:22,445 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:01:22,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612253504] [2022-12-14 06:01:22,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612253504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:01:22,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:01:22,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 06:01:22,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310278951] [2022-12-14 06:01:22,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:01:22,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 06:01:22,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:01:22,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 06:01:22,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2022-12-14 06:01:22,446 INFO L87 Difference]: Start difference. First operand 1868 states and 2526 transitions. Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:01:28,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:01:28,938 INFO L93 Difference]: Finished difference Result 3264 states and 4363 transitions. [2022-12-14 06:01:28,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 06:01:28,939 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2022-12-14 06:01:28,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:01:28,943 INFO L225 Difference]: With dead ends: 3264 [2022-12-14 06:01:28,943 INFO L226 Difference]: Without dead ends: 3264 [2022-12-14 06:01:28,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2022-12-14 06:01:28,944 INFO L413 NwaCegarLoop]: 1299 mSDtfsCounter, 2343 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 3959 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2349 SdHoareTripleChecker+Valid, 2955 SdHoareTripleChecker+Invalid, 5892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1903 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-12-14 06:01:28,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2349 Valid, 2955 Invalid, 5892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3959 Invalid, 0 Unknown, 1903 Unchecked, 6.4s Time] [2022-12-14 06:01:28,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3264 states. [2022-12-14 06:01:28,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3264 to 1864. [2022-12-14 06:01:28,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1864 states, 1308 states have (on average 1.8692660550458715) internal successors, (2445), 1823 states have internal predecessors, (2445), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2022-12-14 06:01:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 2514 transitions. [2022-12-14 06:01:28,966 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 2514 transitions. Word has length 73 [2022-12-14 06:01:28,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:01:28,967 INFO L495 AbstractCegarLoop]: Abstraction has 1864 states and 2514 transitions. [2022-12-14 06:01:28,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:01:28,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2514 transitions. [2022-12-14 06:01:28,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-14 06:01:28,968 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:01:28,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:01:28,979 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-12-14 06:01:29,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:01:29,168 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:01:29,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:01:29,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1696557543, now seen corresponding path program 1 times [2022-12-14 06:01:29,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:01:29,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679433507] [2022-12-14 06:01:29,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:01:29,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:01:29,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:01:29,170 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:01:29,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-12-14 06:01:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:01:29,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-14 06:01:29,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:01:29,438 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 7 [2022-12-14 06:01:29,454 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-12-14 06:01:29,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-14 06:01:29,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:01:29,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:01:29,511 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:01:29,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679433507] [2022-12-14 06:01:29,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679433507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:01:29,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:01:29,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 06:01:29,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317381000] [2022-12-14 06:01:29,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:01:29,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 06:01:29,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:01:29,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 06:01:29,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:01:29,514 INFO L87 Difference]: Start difference. First operand 1864 states and 2514 transitions. Second operand has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 06:01:33,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:01:33,360 INFO L93 Difference]: Finished difference Result 1879 states and 2530 transitions. [2022-12-14 06:01:33,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 06:01:33,360 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 80 [2022-12-14 06:01:33,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:01:33,364 INFO L225 Difference]: With dead ends: 1879 [2022-12-14 06:01:33,364 INFO L226 Difference]: Without dead ends: 1879 [2022-12-14 06:01:33,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-14 06:01:33,364 INFO L413 NwaCegarLoop]: 1169 mSDtfsCounter, 23 mSDsluCounter, 3748 mSDsCounter, 0 mSdLazyCounter, 3317 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4917 SdHoareTripleChecker+Invalid, 3319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-12-14 06:01:33,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4917 Invalid, 3319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3317 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-12-14 06:01:33,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2022-12-14 06:01:33,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1878. [2022-12-14 06:01:33,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1320 states have (on average 1.8643939393939395) internal successors, (2461), 1835 states have internal predecessors, (2461), 34 states have call successors, (34), 15 states have call predecessors, (34), 14 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2022-12-14 06:01:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2530 transitions. [2022-12-14 06:01:33,381 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2530 transitions. Word has length 80 [2022-12-14 06:01:33,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:01:33,382 INFO L495 AbstractCegarLoop]: Abstraction has 1878 states and 2530 transitions. [2022-12-14 06:01:33,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 06:01:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2530 transitions. [2022-12-14 06:01:33,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-12-14 06:01:33,382 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:01:33,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:01:33,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-12-14 06:01:33,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:01:33,583 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:01:33,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:01:33,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1053676349, now seen corresponding path program 1 times [2022-12-14 06:01:33,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:01:33,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036368342] [2022-12-14 06:01:33,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:01:33,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:01:33,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:01:33,588 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:01:33,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-12-14 06:01:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:01:33,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 06:01:33,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:01:33,859 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-12-14 06:01:33,895 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-12-14 06:01:33,901 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-12-14 06:01:33,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-12-14 06:01:33,947 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 19 treesize of output 7 [2022-12-14 06:01:34,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:01:34,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:01:34,015 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:01:34,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036368342] [2022-12-14 06:01:34,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036368342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:01:34,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:01:34,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 06:01:34,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926853905] [2022-12-14 06:01:34,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:01:34,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 06:01:34,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:01:34,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 06:01:34,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-14 06:01:34,016 INFO L87 Difference]: Start difference. First operand 1878 states and 2530 transitions. Second operand has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:01:39,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:01:39,825 INFO L93 Difference]: Finished difference Result 1878 states and 2528 transitions. [2022-12-14 06:01:39,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 06:01:39,826 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 81 [2022-12-14 06:01:39,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:01:39,829 INFO L225 Difference]: With dead ends: 1878 [2022-12-14 06:01:39,829 INFO L226 Difference]: Without dead ends: 1878 [2022-12-14 06:01:39,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-14 06:01:39,830 INFO L413 NwaCegarLoop]: 1164 mSDtfsCounter, 19 mSDsluCounter, 4769 mSDsCounter, 0 mSdLazyCounter, 3477 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 5933 SdHoareTripleChecker+Invalid, 3478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-12-14 06:01:39,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 5933 Invalid, 3478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3477 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-12-14 06:01:39,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2022-12-14 06:01:39,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1878. [2022-12-14 06:01:39,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1320 states have (on average 1.8628787878787878) internal successors, (2459), 1835 states have internal predecessors, (2459), 34 states have call successors, (34), 15 states have call predecessors, (34), 14 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2022-12-14 06:01:39,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2528 transitions. [2022-12-14 06:01:39,852 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2528 transitions. Word has length 81 [2022-12-14 06:01:39,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:01:39,853 INFO L495 AbstractCegarLoop]: Abstraction has 1878 states and 2528 transitions. [2022-12-14 06:01:39,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:01:39,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2528 transitions. [2022-12-14 06:01:39,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-12-14 06:01:39,854 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:01:39,854 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:01:39,864 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-12-14 06:01:40,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:01:40,054 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:01:40,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:01:40,055 INFO L85 PathProgramCache]: Analyzing trace with hash 491350102, now seen corresponding path program 1 times [2022-12-14 06:01:40,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:01:40,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734833996] [2022-12-14 06:01:40,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:01:40,056 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:01:40,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:01:40,056 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:01:40,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-12-14 06:01:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:01:40,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 06:01:40,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:01:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:01:40,331 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:01:40,331 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:01:40,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734833996] [2022-12-14 06:01:40,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734833996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:01:40,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:01:40,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 06:01:40,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891099324] [2022-12-14 06:01:40,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:01:40,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 06:01:40,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:01:40,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 06:01:40,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:01:40,333 INFO L87 Difference]: Start difference. First operand 1878 states and 2528 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 06:01:40,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:01:40,397 INFO L93 Difference]: Finished difference Result 1894 states and 2546 transitions. [2022-12-14 06:01:40,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 06:01:40,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 88 [2022-12-14 06:01:40,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:01:40,400 INFO L225 Difference]: With dead ends: 1894 [2022-12-14 06:01:40,400 INFO L226 Difference]: Without dead ends: 1888 [2022-12-14 06:01:40,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 06:01:40,401 INFO L413 NwaCegarLoop]: 1172 mSDtfsCounter, 10 mSDsluCounter, 3500 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4672 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-12-14 06:01:40,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4672 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:01:40,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2022-12-14 06:01:40,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1888. [2022-12-14 06:01:40,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1328 states have (on average 1.8591867469879517) internal successors, (2469), 1845 states have internal predecessors, (2469), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2022-12-14 06:01:40,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2540 transitions. [2022-12-14 06:01:40,418 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2540 transitions. Word has length 88 [2022-12-14 06:01:40,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:01:40,418 INFO L495 AbstractCegarLoop]: Abstraction has 1888 states and 2540 transitions. [2022-12-14 06:01:40,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 06:01:40,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2540 transitions. [2022-12-14 06:01:40,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-14 06:01:40,419 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:01:40,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:01:40,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-12-14 06:01:40,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:01:40,620 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:01:40,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:01:40,620 INFO L85 PathProgramCache]: Analyzing trace with hash -385822936, now seen corresponding path program 1 times [2022-12-14 06:01:40,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:01:40,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [862054857] [2022-12-14 06:01:40,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:01:40,622 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:01:40,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:01:40,623 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:01:40,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-12-14 06:01:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:01:40,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 06:01:40,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:01:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:01:40,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:01:41,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:01:41,076 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:01:41,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [862054857] [2022-12-14 06:01:41,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [862054857] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:01:41,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [57307034] [2022-12-14 06:01:41,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:01:41,077 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 06:01:41,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 06:01:41,078 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 06:01:41,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-12-14 06:01:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:01:41,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 06:01:41,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:01:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:01:41,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:01:41,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:01:41,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [57307034] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:01:41,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728595519] [2022-12-14 06:01:41,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:01:41,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:01:41,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:01:41,626 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:01:41,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-14 06:01:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:01:41,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 06:01:41,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:01:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:01:41,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:01:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:01:42,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728595519] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:01:42,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 06:01:42,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 10 [2022-12-14 06:01:42,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80534271] [2022-12-14 06:01:42,028 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 06:01:42,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 06:01:42,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:01:42,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 06:01:42,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-14 06:01:42,029 INFO L87 Difference]: Start difference. First operand 1888 states and 2540 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-14 06:01:42,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:01:42,240 INFO L93 Difference]: Finished difference Result 1914 states and 2570 transitions. [2022-12-14 06:01:42,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 06:01:42,241 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 89 [2022-12-14 06:01:42,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:01:42,244 INFO L225 Difference]: With dead ends: 1914 [2022-12-14 06:01:42,244 INFO L226 Difference]: Without dead ends: 1902 [2022-12-14 06:01:42,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-12-14 06:01:42,244 INFO L413 NwaCegarLoop]: 1175 mSDtfsCounter, 36 mSDsluCounter, 7006 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 8181 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:01:42,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 8181 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:01:42,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2022-12-14 06:01:42,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1896. [2022-12-14 06:01:42,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1896 states, 1336 states have (on average 1.8555389221556886) internal successors, (2479), 1853 states have internal predecessors, (2479), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2022-12-14 06:01:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2550 transitions. [2022-12-14 06:01:42,259 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2550 transitions. Word has length 89 [2022-12-14 06:01:42,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:01:42,260 INFO L495 AbstractCegarLoop]: Abstraction has 1896 states and 2550 transitions. [2022-12-14 06:01:42,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-14 06:01:42,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2550 transitions. [2022-12-14 06:01:42,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-14 06:01:42,260 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:01:42,260 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:01:42,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-12-14 06:01:42,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2022-12-14 06:01:42,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-14 06:01:42,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:01:42,862 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:01:42,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:01:42,863 INFO L85 PathProgramCache]: Analyzing trace with hash 55938262, now seen corresponding path program 2 times [2022-12-14 06:01:42,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:01:42,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782797439] [2022-12-14 06:01:42,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 06:01:42,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:01:42,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:01:42,868 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:01:42,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-12-14 06:01:43,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 06:01:43,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:01:43,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 06:01:43,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:01:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:01:43,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:01:43,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:01:43,835 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:01:43,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782797439] [2022-12-14 06:01:43,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782797439] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:01:43,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [672284749] [2022-12-14 06:01:43,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 06:01:43,835 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 06:01:43,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 06:01:43,836 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 06:01:43,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2022-12-14 06:01:45,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 06:01:45,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:01:45,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 06:01:45,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:01:45,500 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:01:45,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:01:45,586 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:01:45,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [672284749] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:01:45,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116446940] [2022-12-14 06:01:45,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 06:01:45,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:01:45,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:01:45,588 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:01:45,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-14 06:02:35,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 06:02:35,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:02:35,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-14 06:02:35,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:02:36,128 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 06:02:36,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 06:02:36,150 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-12-14 06:02:36,526 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:02:36,527 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 36 treesize of output 37 [2022-12-14 06:02:36,600 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 33 treesize of output 15 [2022-12-14 06:02:36,636 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 06:02:36,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:02:36,763 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-12-14 06:02:36,763 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 25 treesize of output 24 [2022-12-14 06:02:36,770 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_2306) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem73#1.base|)) is different from false [2022-12-14 06:02:36,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116446940] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:02:36,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-12-14 06:02:36,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 14] total 29 [2022-12-14 06:02:36,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396251198] [2022-12-14 06:02:36,772 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-12-14 06:02:36,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 06:02:36,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:02:36,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 06:02:36,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=756, Unknown=3, NotChecked=56, Total=930 [2022-12-14 06:02:36,773 INFO L87 Difference]: Start difference. First operand 1896 states and 2550 transitions. Second operand has 29 states, 28 states have (on average 6.071428571428571) internal successors, (170), 27 states have internal predecessors, (170), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 06:02:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:02:50,665 INFO L93 Difference]: Finished difference Result 2415 states and 3208 transitions. [2022-12-14 06:02:50,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-14 06:02:50,666 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 6.071428571428571) internal successors, (170), 27 states have internal predecessors, (170), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 92 [2022-12-14 06:02:50,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:02:50,668 INFO L225 Difference]: With dead ends: 2415 [2022-12-14 06:02:50,669 INFO L226 Difference]: Without dead ends: 2403 [2022-12-14 06:02:50,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 429 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=645, Invalid=3478, Unknown=41, NotChecked=126, Total=4290 [2022-12-14 06:02:50,670 INFO L413 NwaCegarLoop]: 717 mSDtfsCounter, 968 mSDsluCounter, 10804 mSDsCounter, 0 mSdLazyCounter, 9644 mSolverCounterSat, 59 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 11521 SdHoareTripleChecker+Invalid, 9711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 9644 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:02:50,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [975 Valid, 11521 Invalid, 9711 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 9644 Invalid, 8 Unknown, 0 Unchecked, 12.3s Time] [2022-12-14 06:02:50,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2022-12-14 06:02:50,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 1913. [2022-12-14 06:02:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1913 states, 1354 states have (on average 1.8471196454948302) internal successors, (2501), 1870 states have internal predecessors, (2501), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2022-12-14 06:02:50,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 2572 transitions. [2022-12-14 06:02:50,685 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 2572 transitions. Word has length 92 [2022-12-14 06:02:50,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:02:50,686 INFO L495 AbstractCegarLoop]: Abstraction has 1913 states and 2572 transitions. [2022-12-14 06:02:50,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 6.071428571428571) internal successors, (170), 27 states have internal predecessors, (170), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 06:02:50,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2572 transitions. [2022-12-14 06:02:50,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-12-14 06:02:50,686 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:02:50,686 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:02:50,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-14 06:02:50,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2022-12-14 06:02:51,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-12-14 06:02:51,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:02:51,288 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:02:51,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:02:51,290 INFO L85 PathProgramCache]: Analyzing trace with hash 675941271, now seen corresponding path program 1 times [2022-12-14 06:02:51,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:02:51,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944021873] [2022-12-14 06:02:51,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:02:51,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:02:51,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:02:51,293 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:02:51,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-12-14 06:02:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:02:51,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 06:02:51,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:02:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:02:51,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:02:52,618 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:02:52,619 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:02:52,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944021873] [2022-12-14 06:02:52,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [944021873] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:02:52,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [617818969] [2022-12-14 06:02:52,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:02:52,619 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 06:02:52,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 06:02:52,620 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 06:02:52,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-12-14 06:02:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:02:53,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 06:02:53,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:02:53,194 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:02:53,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:02:53,366 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:02:53,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [617818969] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:02:53,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77286237] [2022-12-14 06:02:53,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:02:53,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:02:53,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:02:53,368 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:02:53,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-14 06:02:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:02:53,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 06:02:53,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:02:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:02:53,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:02:55,221 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:02:55,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77286237] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:02:55,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 06:02:55,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 15, 15, 15] total 41 [2022-12-14 06:02:55,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675606056] [2022-12-14 06:02:55,222 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 06:02:55,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-14 06:02:55,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:02:55,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-14 06:02:55,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1187, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 06:02:55,224 INFO L87 Difference]: Start difference. First operand 1913 states and 2572 transitions. Second operand has 41 states, 41 states have (on average 3.048780487804878) internal successors, (125), 41 states have internal predecessors, (125), 1 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-14 06:02:58,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:02:58,353 INFO L93 Difference]: Finished difference Result 2021 states and 2710 transitions. [2022-12-14 06:02:58,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-14 06:02:58,353 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.048780487804878) internal successors, (125), 41 states have internal predecessors, (125), 1 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 98 [2022-12-14 06:02:58,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:02:58,355 INFO L225 Difference]: With dead ends: 2021 [2022-12-14 06:02:58,355 INFO L226 Difference]: Without dead ends: 2003 [2022-12-14 06:02:58,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1810, Invalid=3890, Unknown=0, NotChecked=0, Total=5700 [2022-12-14 06:02:58,357 INFO L413 NwaCegarLoop]: 1192 mSDtfsCounter, 180 mSDsluCounter, 18937 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 20129 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:02:58,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 20129 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 06:02:58,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2022-12-14 06:02:58,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1949. [2022-12-14 06:02:58,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 1390 states have (on average 1.8323741007194245) internal successors, (2547), 1906 states have internal predecessors, (2547), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2022-12-14 06:02:58,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 2618 transitions. [2022-12-14 06:02:58,380 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 2618 transitions. Word has length 98 [2022-12-14 06:02:58,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:02:58,381 INFO L495 AbstractCegarLoop]: Abstraction has 1949 states and 2618 transitions. [2022-12-14 06:02:58,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.048780487804878) internal successors, (125), 41 states have internal predecessors, (125), 1 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-14 06:02:58,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 2618 transitions. [2022-12-14 06:02:58,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-12-14 06:02:58,381 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:02:58,381 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:02:58,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-12-14 06:02:58,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2022-12-14 06:02:58,819 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-12-14 06:02:58,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:02:58,984 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:02:58,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:02:58,986 INFO L85 PathProgramCache]: Analyzing trace with hash 2055264535, now seen corresponding path program 2 times [2022-12-14 06:02:58,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:02:58,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639166948] [2022-12-14 06:02:58,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 06:02:58,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:02:58,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:02:58,989 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:02:58,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-12-14 06:02:59,718 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 06:02:59,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:02:59,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 06:02:59,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:03:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:03:00,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:03:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:03:05,805 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:03:05,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639166948] [2022-12-14 06:03:05,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639166948] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:03:05,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1381515664] [2022-12-14 06:03:05,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 06:03:05,805 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 06:03:05,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 06:03:05,806 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 06:03:05,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2022-12-14 06:03:08,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 06:03:08,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:03:08,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 06:03:08,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:03:08,282 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:03:08,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:03:09,777 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:03:09,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1381515664] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:03:09,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818954029] [2022-12-14 06:03:09,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 06:03:09,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:03:09,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:03:09,778 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:03:09,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-14 06:04:38,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 06:04:38,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:04:38,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 73 conjunts are in the unsatisfiable core [2022-12-14 06:04:38,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:04:38,640 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-12-14 06:04:38,757 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 06:04:38,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 06:04:38,852 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-12-14 06:04:38,861 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-12-14 06:04:39,155 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 22 treesize of output 10 [2022-12-14 06:04:39,160 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 9 treesize of output 3 [2022-12-14 06:04:42,314 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3656 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_3656))) (exists ((v_arrayElimCell_27 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_27) (_ bv44 32))) (exists ((v_ArrVal_3657 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_3657)))) is different from true [2022-12-14 06:04:42,347 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:04:42,347 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-12-14 06:04:42,353 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-12-14 06:04:42,529 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 31 treesize of output 13 [2022-12-14 06:04:42,534 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 19 treesize of output 7 [2022-12-14 06:04:42,622 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 210 trivial. 22 not checked. [2022-12-14 06:04:42,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:04:43,321 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3705 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3704 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3705) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3704 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3704) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-12-14 06:04:43,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818954029] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:04:43,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-12-14 06:04:43,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27, 27, 13] total 64 [2022-12-14 06:04:43,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001972739] [2022-12-14 06:04:43,327 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-12-14 06:04:43,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-12-14 06:04:43,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:04:43,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-12-14 06:04:43,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=3404, Unknown=3, NotChecked=254, Total=4422 [2022-12-14 06:04:43,330 INFO L87 Difference]: Start difference. First operand 1949 states and 2618 transitions. Second operand has 64 states, 63 states have (on average 3.2698412698412698) internal successors, (206), 61 states have internal predecessors, (206), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 06:06:11,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:06:11,512 INFO L93 Difference]: Finished difference Result 2624 states and 3506 transitions. [2022-12-14 06:06:11,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-12-14 06:06:11,513 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 3.2698412698412698) internal successors, (206), 61 states have internal predecessors, (206), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 110 [2022-12-14 06:06:11,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:06:11,514 INFO L225 Difference]: With dead ends: 2624 [2022-12-14 06:06:11,514 INFO L226 Difference]: Without dead ends: 2606 [2022-12-14 06:06:11,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 461 SyntacticMatches, 25 SemanticMatches, 148 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6264 ImplicationChecksByTransitivity, 40.5s TimeCoverageRelationStatistics Valid=3676, Invalid=18057, Unknown=31, NotChecked=586, Total=22350 [2022-12-14 06:06:11,518 INFO L413 NwaCegarLoop]: 728 mSDtfsCounter, 1326 mSDsluCounter, 23074 mSDsCounter, 0 mSdLazyCounter, 24115 mSolverCounterSat, 103 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 23802 SdHoareTripleChecker+Invalid, 25524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 24115 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 1300 IncrementalHoareTripleChecker+Unchecked, 55.8s IncrementalHoareTripleChecker+Time [2022-12-14 06:06:11,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 23802 Invalid, 25524 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [103 Valid, 24115 Invalid, 6 Unknown, 1300 Unchecked, 55.8s Time] [2022-12-14 06:06:11,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2606 states. [2022-12-14 06:06:11,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2606 to 2020. [2022-12-14 06:06:11,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2020 states, 1462 states have (on average 1.8064295485636115) internal successors, (2641), 1977 states have internal predecessors, (2641), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2022-12-14 06:06:11,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 2712 transitions. [2022-12-14 06:06:11,544 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 2712 transitions. Word has length 110 [2022-12-14 06:06:11,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:06:11,545 INFO L495 AbstractCegarLoop]: Abstraction has 2020 states and 2712 transitions. [2022-12-14 06:06:11,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 3.2698412698412698) internal successors, (206), 61 states have internal predecessors, (206), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 06:06:11,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2712 transitions. [2022-12-14 06:06:11,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-14 06:06:11,545 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:06:11,546 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:06:11,555 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2022-12-14 06:06:11,790 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2022-12-14 06:06:11,983 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-12-14 06:06:12,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:06:12,148 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:06:12,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:06:12,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1849192087, now seen corresponding path program 1 times [2022-12-14 06:06:12,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:06:12,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811383627] [2022-12-14 06:06:12,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:06:12,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:06:12,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:06:12,154 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:06:12,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-12-14 06:06:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:06:13,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-14 06:06:13,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:06:13,033 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 7 [2022-12-14 06:06:13,153 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 06:06:13,153 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 19 treesize of output 27 [2022-12-14 06:06:13,174 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-12-14 06:06:13,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-14 06:06:15,134 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:06:15,135 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 36 treesize of output 37 [2022-12-14 06:06:15,248 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:06:15,248 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 36 treesize of output 37 [2022-12-14 06:06:15,268 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 33 treesize of output 15 [2022-12-14 06:06:15,306 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-12-14 06:06:15,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:06:15,383 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4145 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_4145) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 06:06:15,394 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4145 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4145) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-12-14 06:06:15,676 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4145 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4191))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4145)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 06:06:15,678 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:06:15,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811383627] [2022-12-14 06:06:15,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811383627] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:06:15,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1043756492] [2022-12-14 06:06:15,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:06:15,679 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 06:06:15,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 06:06:15,680 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 06:06:15,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-12-14 06:06:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:06:19,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-14 06:06:19,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:06:19,859 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 7 [2022-12-14 06:06:19,973 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 06:06:19,973 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 19 treesize of output 27 [2022-12-14 06:06:19,986 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-12-14 06:06:20,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-14 06:06:22,016 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:06:22,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-12-14 06:06:22,084 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:06:22,084 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 36 treesize of output 37 [2022-12-14 06:06:22,106 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 33 treesize of output 15 [2022-12-14 06:06:22,120 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-12-14 06:06:22,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:06:26,542 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4677))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4631)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-12-14 06:06:26,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1043756492] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:06:26,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940576566] [2022-12-14 06:06:26,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:06:26,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:06:26,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:06:26,546 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:06:26,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-14 06:06:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:06:26,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-14 06:06:26,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:06:27,131 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 06:06:27,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 06:06:27,168 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-12-14 06:06:29,685 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:06:29,685 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 36 treesize of output 37 [2022-12-14 06:06:31,852 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:06:31,852 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 36 treesize of output 37 [2022-12-14 06:06:31,866 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 33 treesize of output 15 [2022-12-14 06:06:31,870 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-12-14 06:06:31,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:06:34,195 INFO L321 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2022-12-14 06:06:34,195 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 37 treesize of output 36 [2022-12-14 06:06:34,202 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5161))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4631)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem73#1.base|)) is different from false [2022-12-14 06:06:34,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940576566] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:06:34,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:06:34,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 26 [2022-12-14 06:06:34,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386729964] [2022-12-14 06:06:34,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:06:34,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 06:06:34,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:06:34,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 06:06:34,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=744, Unknown=37, NotChecked=300, Total=1190 [2022-12-14 06:06:34,206 INFO L87 Difference]: Start difference. First operand 2020 states and 2712 transitions. Second operand has 27 states, 24 states have (on average 4.791666666666667) internal successors, (115), 23 states have internal predecessors, (115), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-12-14 06:06:57,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:06:57,357 INFO L93 Difference]: Finished difference Result 2680 states and 3509 transitions. [2022-12-14 06:06:57,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 06:06:57,358 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 4.791666666666667) internal successors, (115), 23 states have internal predecessors, (115), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 135 [2022-12-14 06:06:57,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:06:57,361 INFO L225 Difference]: With dead ends: 2680 [2022-12-14 06:06:57,361 INFO L226 Difference]: Without dead ends: 2680 [2022-12-14 06:06:57,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 260 SyntacticMatches, 132 SemanticMatches, 49 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=252, Invalid=1781, Unknown=57, NotChecked=460, Total=2550 [2022-12-14 06:06:57,361 INFO L413 NwaCegarLoop]: 796 mSDtfsCounter, 1895 mSDsluCounter, 11158 mSDsCounter, 0 mSdLazyCounter, 12132 mSolverCounterSat, 54 mSolverCounterUnsat, 1032 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1898 SdHoareTripleChecker+Valid, 11954 SdHoareTripleChecker+Invalid, 13218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 12132 IncrementalHoareTripleChecker+Invalid, 1032 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:06:57,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1898 Valid, 11954 Invalid, 13218 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 12132 Invalid, 1032 Unknown, 0 Unchecked, 22.3s Time] [2022-12-14 06:06:57,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2680 states. [2022-12-14 06:06:57,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2680 to 2017. [2022-12-14 06:06:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 1462 states have (on average 1.802325581395349) internal successors, (2635), 1974 states have internal predecessors, (2635), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2022-12-14 06:06:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2706 transitions. [2022-12-14 06:06:57,378 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2706 transitions. Word has length 135 [2022-12-14 06:06:57,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:06:57,378 INFO L495 AbstractCegarLoop]: Abstraction has 2017 states and 2706 transitions. [2022-12-14 06:06:57,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 4.791666666666667) internal successors, (115), 23 states have internal predecessors, (115), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-12-14 06:06:57,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2706 transitions. [2022-12-14 06:06:57,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-14 06:06:57,379 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:06:57,379 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:06:57,392 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-12-14 06:06:57,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-12-14 06:06:57,792 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (36)] Ended with exit code 0 [2022-12-14 06:06:57,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 06:06:57,980 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:06:57,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:06:57,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1849192088, now seen corresponding path program 1 times [2022-12-14 06:06:57,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:06:57,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305260805] [2022-12-14 06:06:57,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:06:57,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:06:57,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:06:57,982 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:06:57,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-12-14 06:06:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:06:58,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 124 conjunts are in the unsatisfiable core [2022-12-14 06:06:58,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:06:58,886 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 7 [2022-12-14 06:06:59,123 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-12-14 06:06:59,152 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 06:06:59,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 06:06:59,183 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-12-14 06:06:59,188 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-12-14 06:06:59,308 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 18 treesize of output 10 [2022-12-14 06:06:59,312 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 7 treesize of output 3 [2022-12-14 06:07:01,293 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:07:01,294 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-12-14 06:07:01,299 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-12-14 06:07:01,407 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:07:01,407 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-12-14 06:07:01,416 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-12-14 06:07:01,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 25 treesize of output 13 [2022-12-14 06:07:01,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 06:07:01,468 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-12-14 06:07:01,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:07:01,688 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5648 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5648 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2022-12-14 06:07:01,723 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5648 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5648 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-12-14 06:07:02,483 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5648 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5740 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5740))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5739) .cse0 v_ArrVal_5648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5648 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5740 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5739) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-12-14 06:07:02,491 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:07:02,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305260805] [2022-12-14 06:07:02,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305260805] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:07:02,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [524758666] [2022-12-14 06:07:02,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:07:02,491 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 06:07:02,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 06:07:02,492 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 06:07:02,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2022-12-14 06:07:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:07:05,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 84 conjunts are in the unsatisfiable core [2022-12-14 06:07:05,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:07:05,899 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-12-14 06:07:05,904 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 7 [2022-12-14 06:07:06,375 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 06:07:06,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 06:07:06,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 06:07:06,450 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-12-14 06:07:06,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-12-14 06:07:06,564 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 20 treesize of output 8 [2022-12-14 06:07:06,626 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 7 treesize of output 3 [2022-12-14 06:07:10,332 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 16 treesize of output 18 [2022-12-14 06:07:10,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:07:10,570 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 82 treesize of output 60 [2022-12-14 06:07:10,588 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-12-14 06:07:10,589 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 60 treesize of output 44 [2022-12-14 06:07:10,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-12-14 06:07:10,729 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 26 treesize of output 14 [2022-12-14 06:07:10,861 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-12-14 06:07:10,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:07:11,305 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 231 treesize of output 159 [2022-12-14 06:07:20,913 WARN L233 SmtUtils]: Spent 7.82s on a formula simplification. DAG size of input: 63 DAG size of output: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 06:07:21,266 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_ArrVal_6232 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6232))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (forall ((v_ArrVal_6185 (_ BitVec 32))) (let ((.cse0 (select (select (store .cse1 v_arrayElimCell_72 (store (select .cse1 v_arrayElimCell_72) (bvadd (_ bv16 32) .cse2) v_ArrVal_6185)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (not (bvule (bvadd .cse2 (_ bv20 32)) (select |c_#length| v_arrayElimCell_72))))))) (forall ((v_arrayElimCell_72 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_ArrVal_6232 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6232))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse6 (select |c_#length| v_arrayElimCell_72))) (or (bvule (bvadd (_ bv8 32) (select (select (store .cse4 v_arrayElimCell_72 (store (select .cse4 v_arrayElimCell_72) (bvadd (_ bv16 32) .cse5) v_prenex_5)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) .cse6) (not (bvule (bvadd .cse5 (_ bv20 32)) .cse6)))))))) is different from false [2022-12-14 06:07:21,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [524758666] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:07:21,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830849697] [2022-12-14 06:07:21,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:07:21,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:07:21,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:07:21,280 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:07:21,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-14 06:07:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:07:21,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 120 conjunts are in the unsatisfiable core [2022-12-14 06:07:21,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:07:22,069 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-12-14 06:07:22,097 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 06:07:22,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 06:07:22,211 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-12-14 06:07:22,222 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-12-14 06:07:22,540 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 22 treesize of output 10 [2022-12-14 06:07:22,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-14 06:07:25,084 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:07:25,084 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-12-14 06:07:25,090 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-12-14 06:07:25,423 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:07:25,423 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-12-14 06:07:25,429 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-12-14 06:07:25,461 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 31 treesize of output 13 [2022-12-14 06:07:25,468 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 19 treesize of output 7 [2022-12-14 06:07:25,474 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-12-14 06:07:25,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:07:25,537 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_6717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6717) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-14 06:07:25,573 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6717) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-12-14 06:07:26,455 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6809))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6810) .cse0 v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6717) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6809 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6810) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6809) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-12-14 06:07:26,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830849697] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:07:26,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:07:26,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 35 [2022-12-14 06:07:26,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300697879] [2022-12-14 06:07:26,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:07:26,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 06:07:26,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:07:26,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 06:07:26,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1382, Unknown=71, NotChecked=574, Total=2162 [2022-12-14 06:07:26,465 INFO L87 Difference]: Start difference. First operand 2017 states and 2706 transitions. Second operand has 36 states, 32 states have (on average 7.3125) internal successors, (234), 30 states have internal predecessors, (234), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 06:08:36,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:08:36,366 INFO L93 Difference]: Finished difference Result 3360 states and 4435 transitions. [2022-12-14 06:08:36,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 06:08:36,367 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 7.3125) internal successors, (234), 30 states have internal predecessors, (234), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 135 [2022-12-14 06:08:36,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:08:36,369 INFO L225 Difference]: With dead ends: 3360 [2022-12-14 06:08:36,369 INFO L226 Difference]: Without dead ends: 3360 [2022-12-14 06:08:36,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 249 SyntacticMatches, 131 SemanticMatches, 60 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=278, Invalid=2620, Unknown=100, NotChecked=784, Total=3782 [2022-12-14 06:08:36,370 INFO L413 NwaCegarLoop]: 913 mSDtfsCounter, 3009 mSDsluCounter, 14728 mSDsCounter, 0 mSdLazyCounter, 30464 mSolverCounterSat, 53 mSolverCounterUnsat, 2314 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3014 SdHoareTripleChecker+Valid, 15641 SdHoareTripleChecker+Invalid, 32831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 30464 IncrementalHoareTripleChecker+Invalid, 2314 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 67.9s IncrementalHoareTripleChecker+Time [2022-12-14 06:08:36,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3014 Valid, 15641 Invalid, 32831 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [53 Valid, 30464 Invalid, 2314 Unknown, 0 Unchecked, 67.9s Time] [2022-12-14 06:08:36,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2022-12-14 06:08:36,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 2050. [2022-12-14 06:08:36,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 1488 states have (on average 1.7977150537634408) internal successors, (2675), 2001 states have internal predecessors, (2675), 40 states have call successors, (40), 17 states have call predecessors, (40), 18 states have return successors, (43), 34 states have call predecessors, (43), 40 states have call successors, (43) [2022-12-14 06:08:36,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 2758 transitions. [2022-12-14 06:08:36,389 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 2758 transitions. Word has length 135 [2022-12-14 06:08:36,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:08:36,390 INFO L495 AbstractCegarLoop]: Abstraction has 2050 states and 2758 transitions. [2022-12-14 06:08:36,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 7.3125) internal successors, (234), 30 states have internal predecessors, (234), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 06:08:36,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 2758 transitions. [2022-12-14 06:08:36,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-14 06:08:36,391 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:08:36,391 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:08:36,408 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2022-12-14 06:08:36,608 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-12-14 06:08:36,806 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2022-12-14 06:08:36,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:08:36,992 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:08:36,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:08:36,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2031259997, now seen corresponding path program 1 times [2022-12-14 06:08:36,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:08:36,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755953555] [2022-12-14 06:08:36,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:08:36,994 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:08:36,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:08:36,996 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:08:36,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-12-14 06:08:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:08:37,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-14 06:08:37,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:08:37,920 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 7 [2022-12-14 06:08:38,106 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 06:08:38,107 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 19 treesize of output 27 [2022-12-14 06:08:38,145 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-12-14 06:08:38,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-14 06:08:40,603 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:08:40,604 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 36 treesize of output 37 [2022-12-14 06:08:40,721 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:08:40,721 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 36 treesize of output 37 [2022-12-14 06:08:40,825 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:08:40,825 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 36 treesize of output 37 [2022-12-14 06:08:40,850 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 33 treesize of output 15 [2022-12-14 06:08:40,902 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-12-14 06:08:40,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:08:43,097 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7266 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7266) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-12-14 06:08:43,115 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7266 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7265))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7266)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 06:08:43,130 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7266 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7265))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7266)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-14 06:08:43,376 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7312))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7265)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7266)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-14 06:08:43,380 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:08:43,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755953555] [2022-12-14 06:08:43,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [755953555] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:08:43,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1034581154] [2022-12-14 06:08:43,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:08:43,380 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 06:08:43,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 06:08:43,381 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 06:08:43,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2022-12-14 06:08:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:08:52,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 70 conjunts are in the unsatisfiable core [2022-12-14 06:08:52,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:08:52,453 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 7 [2022-12-14 06:08:52,613 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 06:08:52,613 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 19 treesize of output 27 [2022-12-14 06:08:52,629 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-12-14 06:08:52,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-14 06:08:54,995 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:08:54,996 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 36 treesize of output 37 [2022-12-14 06:08:55,082 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:08:55,083 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 36 treesize of output 37 [2022-12-14 06:08:55,139 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:08:55,139 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 36 treesize of output 37 [2022-12-14 06:08:55,161 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 33 treesize of output 15 [2022-12-14 06:08:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-12-14 06:08:55,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:08:55,192 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7768) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-12-14 06:08:55,205 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7768) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-12-14 06:08:55,225 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7767))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7768)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-14 06:08:55,241 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7767))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7768)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 06:08:55,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1034581154] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:08:55,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294489887] [2022-12-14 06:08:55,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:08:55,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:08:55,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:08:55,698 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:08:55,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-12-14 06:08:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:08:56,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-14 06:08:56,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:08:56,393 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 06:08:56,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 06:08:56,446 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-12-14 06:08:59,802 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:08:59,802 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 36 treesize of output 37 [2022-12-14 06:09:00,005 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:09:00,005 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 36 treesize of output 37 [2022-12-14 06:09:00,126 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:09:00,126 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 36 treesize of output 37 [2022-12-14 06:09:00,143 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 33 treesize of output 15 [2022-12-14 06:09:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-12-14 06:09:00,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:09:00,177 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8268) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 06:09:00,189 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8268 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2022-12-14 06:09:00,208 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8267))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8268)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 06:09:00,224 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8267))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8268)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-12-14 06:09:00,539 INFO L321 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2022-12-14 06:09:00,540 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 61 treesize of output 60 [2022-12-14 06:09:00,552 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8314 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8314))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8267)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8268)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem73#1.base|)) is different from false [2022-12-14 06:09:00,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294489887] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:09:00,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:09:00,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 28 [2022-12-14 06:09:00,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14787094] [2022-12-14 06:09:00,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:09:00,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 06:09:00,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:09:00,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 06:09:00,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=862, Unknown=48, NotChecked=936, Total=1980 [2022-12-14 06:09:00,558 INFO L87 Difference]: Start difference. First operand 2050 states and 2758 transitions. Second operand has 29 states, 26 states have (on average 4.653846153846154) internal successors, (121), 25 states have internal predecessors, (121), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-12-14 06:09:32,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:09:32,996 INFO L93 Difference]: Finished difference Result 2712 states and 3559 transitions. [2022-12-14 06:09:32,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 06:09:32,997 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 4.653846153846154) internal successors, (121), 25 states have internal predecessors, (121), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 138 [2022-12-14 06:09:32,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:09:32,999 INFO L225 Difference]: With dead ends: 2712 [2022-12-14 06:09:32,999 INFO L226 Difference]: Without dead ends: 2712 [2022-12-14 06:09:33,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 269 SyntacticMatches, 131 SemanticMatches, 60 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 1883 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=285, Invalid=2050, Unknown=69, NotChecked=1378, Total=3782 [2022-12-14 06:09:33,000 INFO L413 NwaCegarLoop]: 795 mSDtfsCounter, 1887 mSDsluCounter, 12438 mSDsCounter, 0 mSdLazyCounter, 13561 mSolverCounterSat, 54 mSolverCounterUnsat, 1079 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1890 SdHoareTripleChecker+Valid, 13233 SdHoareTripleChecker+Invalid, 14694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 13561 IncrementalHoareTripleChecker+Invalid, 1079 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.2s IncrementalHoareTripleChecker+Time [2022-12-14 06:09:33,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1890 Valid, 13233 Invalid, 14694 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 13561 Invalid, 1079 Unknown, 0 Unchecked, 31.2s Time] [2022-12-14 06:09:33,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2022-12-14 06:09:33,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 2049. [2022-12-14 06:09:33,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2049 states, 1488 states have (on average 1.7963709677419355) internal successors, (2673), 2000 states have internal predecessors, (2673), 40 states have call successors, (40), 17 states have call predecessors, (40), 18 states have return successors, (43), 34 states have call predecessors, (43), 40 states have call successors, (43) [2022-12-14 06:09:33,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 2049 states and 2756 transitions. [2022-12-14 06:09:33,024 INFO L78 Accepts]: Start accepts. Automaton has 2049 states and 2756 transitions. Word has length 138 [2022-12-14 06:09:33,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:09:33,025 INFO L495 AbstractCegarLoop]: Abstraction has 2049 states and 2756 transitions. [2022-12-14 06:09:33,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 4.653846153846154) internal successors, (121), 25 states have internal predecessors, (121), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-12-14 06:09:33,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 2756 transitions. [2022-12-14 06:09:33,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-14 06:09:33,026 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:09:33,026 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:09:33,044 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-12-14 06:09:33,270 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Ended with exit code 0 [2022-12-14 06:09:33,472 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (42)] Forceful destruction successful, exit code 0 [2022-12-14 06:09:33,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 06:09:33,628 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:09:33,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:09:33,630 INFO L85 PathProgramCache]: Analyzing trace with hash 2031259998, now seen corresponding path program 1 times [2022-12-14 06:09:33,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:09:33,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138747514] [2022-12-14 06:09:33,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:09:33,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:09:33,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:09:33,633 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:09:33,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-12-14 06:09:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:09:34,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 127 conjunts are in the unsatisfiable core [2022-12-14 06:09:34,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:09:34,679 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 7 [2022-12-14 06:09:34,946 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-12-14 06:09:34,996 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 06:09:34,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 06:09:35,038 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-12-14 06:09:35,052 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-12-14 06:09:35,198 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 18 treesize of output 10 [2022-12-14 06:09:35,202 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 7 treesize of output 3 [2022-12-14 06:09:37,751 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:09:37,751 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-12-14 06:09:37,763 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-12-14 06:09:37,931 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:09:37,932 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-12-14 06:09:37,938 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-12-14 06:09:38,077 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:09:38,077 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-12-14 06:09:38,082 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-12-14 06:09:38,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 06:09:38,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-14 06:09:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-12-14 06:09:38,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:09:38,414 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8817) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-14 06:09:38,445 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8817) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2022-12-14 06:09:38,501 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8816))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8815) .cse0 v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8817) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8815) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8816) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-12-14 06:09:38,546 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8816))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8815) .cse1 v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8817) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8815) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8816) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2022-12-14 06:09:39,295 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8910 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8909 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8910))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8816))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8909) .cse0 v_ArrVal_8815) .cse1 v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8817) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8910 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8909 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8910))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8909) .cse6 v_ArrVal_8815) (select (select (store .cse7 .cse6 v_ArrVal_8816) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8818))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2022-12-14 06:09:39,309 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:09:39,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138747514] [2022-12-14 06:09:39,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138747514] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:09:39,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1751687979] [2022-12-14 06:09:39,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:09:39,310 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 06:09:39,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 06:09:39,310 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 06:09:39,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2022-12-14 06:09:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:09:44,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 125 conjunts are in the unsatisfiable core [2022-12-14 06:09:44,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:09:44,254 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 7 [2022-12-14 06:09:44,514 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-12-14 06:09:44,547 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 06:09:44,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 06:09:44,630 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-12-14 06:09:44,645 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-12-14 06:09:44,851 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 22 treesize of output 10 [2022-12-14 06:09:44,856 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 9 treesize of output 3 [2022-12-14 06:09:47,300 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:09:47,300 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-12-14 06:09:47,313 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-12-14 06:09:47,505 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:09:47,505 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-12-14 06:09:47,511 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-12-14 06:09:47,643 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:09:47,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-14 06:09:47,649 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-12-14 06:09:47,676 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 19 treesize of output 7 [2022-12-14 06:09:47,679 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 31 treesize of output 13 [2022-12-14 06:09:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-12-14 06:09:47,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:09:47,747 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-14 06:09:47,778 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-12-14 06:09:47,843 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9411))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9412) .cse0 v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9412) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9411) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-12-14 06:09:47,962 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9412) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9411) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9411))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9412) .cse3 v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-12-14 06:09:49,505 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9506))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9505) .cse1 v_ArrVal_9412) (select (select (store .cse2 .cse1 v_ArrVal_9411) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9413))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9506))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9411))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9505) .cse4 v_ArrVal_9412) .cse5 v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9414) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-12-14 06:09:49,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1751687979] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:09:49,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685461661] [2022-12-14 06:09:49,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:09:49,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:09:49,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:09:49,523 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:09:49,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-12-14 06:09:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:09:50,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 123 conjunts are in the unsatisfiable core [2022-12-14 06:09:50,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:09:50,363 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-12-14 06:09:50,401 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 06:09:50,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 06:09:50,420 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-12-14 06:09:50,437 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-12-14 06:09:50,517 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 22 treesize of output 10 [2022-12-14 06:09:50,524 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 9 treesize of output 3 [2022-12-14 06:09:53,897 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_10005) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_107 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_107) (_ bv44 32))) (exists ((v_ArrVal_10004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_10004)))) is different from true [2022-12-14 06:09:53,975 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:09:53,976 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-12-14 06:09:53,988 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-12-14 06:09:54,175 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:09:54,175 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-12-14 06:09:54,195 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-12-14 06:09:54,285 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:09:54,285 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-12-14 06:09:54,293 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-12-14 06:09:54,335 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 19 treesize of output 7 [2022-12-14 06:09:54,339 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 31 treesize of output 13 [2022-12-14 06:09:54,350 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-12-14 06:09:54,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:09:54,434 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_10008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-14 06:09:54,471 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_10008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2022-12-14 06:09:54,597 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10006))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10007) .cse0 v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10007) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-12-14 06:09:54,720 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_10007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10007) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_10007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10006))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10007) .cse3 v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_10008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-12-14 06:09:56,522 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10100 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10101 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10101))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10006))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10100) .cse0 v_ArrVal_10007) .cse1 v_ArrVal_10009) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10100 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10101 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10101))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10100) .cse6 v_ArrVal_10007) (select (select (store .cse7 .cse6 v_ArrVal_10006) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10009))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2022-12-14 06:09:56,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685461661] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:09:56,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:09:56,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 24 [2022-12-14 06:09:56,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737912353] [2022-12-14 06:09:56,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:09:56,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 06:09:56,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:09:56,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 06:09:56,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=569, Unknown=36, NotChecked=1008, Total=1722 [2022-12-14 06:09:56,541 INFO L87 Difference]: Start difference. First operand 2049 states and 2756 transitions. Second operand has 25 states, 22 states have (on average 7.636363636363637) internal successors, (168), 21 states have internal predecessors, (168), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-14 06:11:06,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:11:06,723 INFO L93 Difference]: Finished difference Result 3344 states and 4416 transitions. [2022-12-14 06:11:06,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 06:11:06,724 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.636363636363637) internal successors, (168), 21 states have internal predecessors, (168), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 138 [2022-12-14 06:11:06,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:11:06,727 INFO L225 Difference]: With dead ends: 3344 [2022-12-14 06:11:06,727 INFO L226 Difference]: Without dead ends: 3344 [2022-12-14 06:11:06,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 268 SyntacticMatches, 135 SemanticMatches, 52 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=200, Invalid=1221, Unknown=49, NotChecked=1392, Total=2862 [2022-12-14 06:11:06,728 INFO L413 NwaCegarLoop]: 1096 mSDtfsCounter, 2111 mSDsluCounter, 11285 mSDsCounter, 0 mSdLazyCounter, 20907 mSolverCounterSat, 28 mSolverCounterUnsat, 937 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2116 SdHoareTripleChecker+Valid, 12381 SdHoareTripleChecker+Invalid, 23755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 20907 IncrementalHoareTripleChecker+Invalid, 937 IncrementalHoareTripleChecker+Unknown, 1883 IncrementalHoareTripleChecker+Unchecked, 68.7s IncrementalHoareTripleChecker+Time [2022-12-14 06:11:06,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2116 Valid, 12381 Invalid, 23755 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [28 Valid, 20907 Invalid, 937 Unknown, 1883 Unchecked, 68.7s Time] [2022-12-14 06:11:06,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3344 states. [2022-12-14 06:11:06,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3344 to 2048. [2022-12-14 06:11:06,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2048 states, 1488 states have (on average 1.79502688172043) internal successors, (2671), 1999 states have internal predecessors, (2671), 40 states have call successors, (40), 17 states have call predecessors, (40), 18 states have return successors, (43), 34 states have call predecessors, (43), 40 states have call successors, (43) [2022-12-14 06:11:06,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2754 transitions. [2022-12-14 06:11:06,755 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2754 transitions. Word has length 138 [2022-12-14 06:11:06,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:11:06,755 INFO L495 AbstractCegarLoop]: Abstraction has 2048 states and 2754 transitions. [2022-12-14 06:11:06,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.636363636363637) internal successors, (168), 21 states have internal predecessors, (168), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-14 06:11:06,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2754 transitions. [2022-12-14 06:11:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-12-14 06:11:06,756 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:11:06,756 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:11:06,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-12-14 06:11:06,998 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (45)] Forceful destruction successful, exit code 0 [2022-12-14 06:11:07,180 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Ended with exit code 0 [2022-12-14 06:11:07,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:11:07,357 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:11:07,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:11:07,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1472678910, now seen corresponding path program 1 times [2022-12-14 06:11:07,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:11:07,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585156222] [2022-12-14 06:11:07,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:11:07,362 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:11:07,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:11:07,364 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:11:07,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2022-12-14 06:11:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:11:08,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 70 conjunts are in the unsatisfiable core [2022-12-14 06:11:08,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:11:08,480 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 7 [2022-12-14 06:11:08,855 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 06:11:08,856 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 19 treesize of output 27 [2022-12-14 06:11:08,915 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-12-14 06:11:09,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-14 06:11:13,260 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_32| (_ BitVec 32)) (v_arrayElimCell_143 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_143) (_ bv1 1))) (not (= v_arrayElimCell_143 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_32|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_32|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_10570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_10570) |c_#memory_$Pointer$.base|))) is different from true [2022-12-14 06:11:13,376 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:11:13,376 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 36 treesize of output 37 [2022-12-14 06:11:13,578 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:11:13,578 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 36 treesize of output 37 [2022-12-14 06:11:13,754 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:11:13,754 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 36 treesize of output 37 [2022-12-14 06:11:13,940 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:11:13,940 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 36 treesize of output 37 [2022-12-14 06:11:13,977 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 33 treesize of output 15 [2022-12-14 06:11:14,068 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-12-14 06:11:14,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:11:14,211 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10573) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-12-14 06:11:14,231 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10573) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2022-12-14 06:11:14,259 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10572))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10573)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-14 06:11:15,588 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10571))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10572)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10573)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-14 06:11:15,615 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10571))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10572)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10573)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-14 06:11:16,100 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10619))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10571)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10572)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10573)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-12-14 06:11:16,104 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:11:16,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585156222] [2022-12-14 06:11:16,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585156222] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:11:16,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1712826190] [2022-12-14 06:11:16,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:11:16,105 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 06:11:16,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 06:11:16,106 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 06:11:16,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2022-12-14 06:11:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:11:22,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 72 conjunts are in the unsatisfiable core [2022-12-14 06:11:22,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:11:22,774 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 7 [2022-12-14 06:11:23,112 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 06:11:23,112 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 19 treesize of output 27 [2022-12-14 06:11:23,145 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-12-14 06:11:23,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-14 06:11:27,131 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:11:27,131 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 36 treesize of output 37 [2022-12-14 06:11:27,252 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:11:27,252 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 36 treesize of output 37 [2022-12-14 06:11:27,346 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:11:27,346 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 36 treesize of output 37 [2022-12-14 06:11:27,423 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:11:27,423 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 36 treesize of output 37 [2022-12-14 06:11:27,454 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 33 treesize of output 15 [2022-12-14 06:11:27,472 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-12-14 06:11:27,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:11:27,501 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11091 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_11091) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 06:11:27,519 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11091 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_11091) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-12-14 06:11:27,546 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_11090))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-14 06:11:27,566 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11090))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-12-14 06:11:27,598 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_11089))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11090)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 06:11:27,624 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11089))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11090)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-12-14 06:11:28,092 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11137 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_11137))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11089)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11090)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-12-14 06:11:28,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1712826190] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:11:28,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592221230] [2022-12-14 06:11:28,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:11:28,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:11:28,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:11:28,100 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:11:28,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-12-14 06:11:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:11:28,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-14 06:11:28,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:11:29,185 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 06:11:29,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 06:11:29,265 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-12-14 06:11:34,276 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_11604 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_11604))) is different from true [2022-12-14 06:11:34,326 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:11:34,326 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 23 treesize of output 26 [2022-12-14 06:11:34,490 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:11:34,491 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 23 treesize of output 26 [2022-12-14 06:11:34,657 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:11:34,658 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 23 treesize of output 26 [2022-12-14 06:11:34,821 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:11:34,822 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 36 treesize of output 37 [2022-12-14 06:11:34,992 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 33 treesize of output 15 [2022-12-14 06:11:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-12-14 06:11:34,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:11:35,043 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-12-14 06:11:35,044 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 25 treesize of output 24 [2022-12-14 06:11:35,289 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11607 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11607) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2022-12-14 06:11:35,313 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11607 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_11606)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_11607) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2022-12-14 06:11:35,331 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11607 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11606))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_11607) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2022-12-14 06:11:35,359 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11607 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11605 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_11605))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11606)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_11607) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2022-12-14 06:11:35,379 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11607 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11605 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11605))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11606)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_11607) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2022-12-14 06:11:35,868 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11607 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11605 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_11653))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11605)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11606)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_11607) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2022-12-14 06:11:35,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592221230] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:11:35,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:11:35,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2022-12-14 06:11:35,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087096694] [2022-12-14 06:11:35,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:11:35,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 06:11:35,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:11:35,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 06:11:35,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=850, Unknown=70, NotChecked=1680, Total=2756 [2022-12-14 06:11:35,875 INFO L87 Difference]: Start difference. First operand 2048 states and 2754 transitions. Second operand has 31 states, 28 states have (on average 4.678571428571429) internal successors, (131), 27 states have internal predecessors, (131), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-14 06:12:12,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:12:12,385 INFO L93 Difference]: Finished difference Result 2710 states and 3555 transitions. [2022-12-14 06:12:12,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 06:12:12,387 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 4.678571428571429) internal successors, (131), 27 states have internal predecessors, (131), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 141 [2022-12-14 06:12:12,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:12:12,389 INFO L225 Difference]: With dead ends: 2710 [2022-12-14 06:12:12,389 INFO L226 Difference]: Without dead ends: 2710 [2022-12-14 06:12:12,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 280 SyntacticMatches, 132 SemanticMatches, 67 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 1812 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=302, Invalid=1946, Unknown=92, NotChecked=2352, Total=4692 [2022-12-14 06:12:12,390 INFO L413 NwaCegarLoop]: 794 mSDtfsCounter, 1881 mSDsluCounter, 7961 mSDsCounter, 0 mSdLazyCounter, 8451 mSolverCounterSat, 56 mSolverCounterUnsat, 1018 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1884 SdHoareTripleChecker+Valid, 8755 SdHoareTripleChecker+Invalid, 11897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 8451 IncrementalHoareTripleChecker+Invalid, 1018 IncrementalHoareTripleChecker+Unknown, 2372 IncrementalHoareTripleChecker+Unchecked, 34.7s IncrementalHoareTripleChecker+Time [2022-12-14 06:12:12,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1884 Valid, 8755 Invalid, 11897 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [56 Valid, 8451 Invalid, 1018 Unknown, 2372 Unchecked, 34.7s Time] [2022-12-14 06:12:12,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2710 states. [2022-12-14 06:12:12,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2710 to 2047. [2022-12-14 06:12:12,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2047 states, 1488 states have (on average 1.7936827956989247) internal successors, (2669), 1998 states have internal predecessors, (2669), 40 states have call successors, (40), 17 states have call predecessors, (40), 18 states have return successors, (43), 34 states have call predecessors, (43), 40 states have call successors, (43) [2022-12-14 06:12:12,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 2752 transitions. [2022-12-14 06:12:12,423 INFO L78 Accepts]: Start accepts. Automaton has 2047 states and 2752 transitions. Word has length 141 [2022-12-14 06:12:12,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:12:12,423 INFO L495 AbstractCegarLoop]: Abstraction has 2047 states and 2752 transitions. [2022-12-14 06:12:12,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 4.678571428571429) internal successors, (131), 27 states have internal predecessors, (131), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-14 06:12:12,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 2752 transitions. [2022-12-14 06:12:12,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-12-14 06:12:12,424 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:12:12,424 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:12:12,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Forceful destruction successful, exit code 0 [2022-12-14 06:12:12,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-12-14 06:12:12,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (48)] Forceful destruction successful, exit code 0 [2022-12-14 06:12:13,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 06:12:13,026 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-12-14 06:12:13,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:12:13,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1472678911, now seen corresponding path program 1 times [2022-12-14 06:12:13,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:12:13,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060760237] [2022-12-14 06:12:13,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:12:13,031 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 06:12:13,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:12:13,034 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 06:12:13,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2022-12-14 06:12:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:12:14,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 129 conjunts are in the unsatisfiable core [2022-12-14 06:12:14,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:12:14,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 06:12:14,938 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-12-14 06:12:15,033 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 06:12:15,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 06:12:15,107 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-12-14 06:12:15,126 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-12-14 06:12:15,398 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 18 treesize of output 10 [2022-12-14 06:12:15,405 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 7 treesize of output 3 [2022-12-14 06:12:19,632 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:12:19,633 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-12-14 06:12:19,641 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-12-14 06:12:19,890 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:12:19,890 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-12-14 06:12:19,898 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-12-14 06:12:20,096 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:12:20,096 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-12-14 06:12:20,113 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-12-14 06:12:20,313 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 06:12:20,313 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-12-14 06:12:20,321 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-12-14 06:12:20,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 06:12:20,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-14 06:12:20,466 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-12-14 06:12:20,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:12:20,796 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-12-14 06:12:20,847 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-12-14 06:12:21,004 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12172) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12171))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12172) .cse2 v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_12173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-12-14 06:12:21,063 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_12173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12171))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12172) .cse1 v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_12173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12172) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2022-12-14 06:12:34,187 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12170))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_12171))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12169) .cse1 v_ArrVal_12172) .cse2 v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_12173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12170))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12169) .cse7 v_ArrVal_12172) (select (select (store .cse8 .cse7 v_ArrVal_12171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12174))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2022-12-14 06:12:37,935 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12266))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_12170))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12265) .cse1 v_ArrVal_12169) .cse2 v_ArrVal_12172) (select (select (store .cse3 .cse2 v_ArrVal_12171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_12174))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12266))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_12170))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_12171))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12265) .cse6 v_ArrVal_12169) .cse7 v_ArrVal_12172) .cse8 v_ArrVal_12174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_12173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2022-12-14 06:12:37,974 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:12:37,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060760237] [2022-12-14 06:12:37,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060760237] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:12:37,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [500541810] [2022-12-14 06:12:37,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:12:37,974 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 06:12:37,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 06:12:37,975 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 06:12:37,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee40455e-da10-443c-9805-37dbe3235d16/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process