./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b 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_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS --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 bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 --- 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-8393723 [2022-11-19 08:10:51,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:10:51,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:10:51,724 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:10:51,726 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:10:51,730 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:10:51,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:10:51,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:10:51,739 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:10:51,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:10:51,747 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:10:51,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:10:51,750 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:10:51,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:10:51,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:10:51,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:10:51,759 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:10:51,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:10:51,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:10:51,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:10:51,771 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:10:51,773 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:10:51,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:10:51,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:10:51,787 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:10:51,788 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:10:51,788 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:10:51,789 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:10:51,790 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:10:51,791 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:10:51,791 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:10:51,793 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:10:51,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:10:51,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:10:51,798 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:10:51,798 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:10:51,799 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:10:51,799 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:10:51,799 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:10:51,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:10:51,801 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:10:51,802 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-19 08:10:51,848 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:10:51,848 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:10:51,849 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:10:51,849 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:10:51,850 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:10:51,851 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:10:51,851 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:10:51,851 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:10:51,851 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:10:51,852 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 08:10:51,853 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:10:51,853 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:10:51,853 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 08:10:51,853 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 08:10:51,854 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:10:51,854 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 08:10:51,854 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 08:10:51,854 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 08:10:51,855 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 08:10:51,856 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 08:10:51,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:10:51,856 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:10:51,856 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 08:10:51,858 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:10:51,858 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:10:51,858 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:10:51,859 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 08:10:51,859 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 08:10:51,859 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 08:10:51,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:10:51,860 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 08:10:51,860 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:10:51,860 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:10:51,861 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:10:51,861 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:10:51,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:10:51,861 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:10:51,861 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 08:10:51,862 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:10:51,862 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 08:10:51,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 08:10:51,862 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:10:51,863 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_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS 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 -> bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 [2022-11-19 08:10:52,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:10:52,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:10:52,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:10:52,219 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:10:52,220 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:10:52,221 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2022-11-19 08:10:52,303 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/data/d6155add9/1e07094e4b9d448cbac9ed8b1c26b854/FLAGd17c66bf9 [2022-11-19 08:10:52,951 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:10:52,952 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2022-11-19 08:10:52,967 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/data/d6155add9/1e07094e4b9d448cbac9ed8b1c26b854/FLAGd17c66bf9 [2022-11-19 08:10:53,186 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/data/d6155add9/1e07094e4b9d448cbac9ed8b1c26b854 [2022-11-19 08:10:53,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:10:53,190 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:10:53,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:10:53,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:10:53,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:10:53,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:10:53" (1/1) ... [2022-11-19 08:10:53,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@105b1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:53, skipping insertion in model container [2022-11-19 08:10:53,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:10:53" (1/1) ... [2022-11-19 08:10:53,208 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:10:53,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:10:53,862 WARN L234 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_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[44118,44131] [2022-11-19 08:10:53,873 WARN L234 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_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[44660,44673] [2022-11-19 08:10:54,005 WARN L234 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_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[56247,56260] [2022-11-19 08:10:54,016 WARN L234 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_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[56368,56381] [2022-11-19 08:10:54,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:10:54,067 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-11-19 08:10:54,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@330bafe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:54, skipping insertion in model container [2022-11-19 08:10:54,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:10:54,068 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-19 08:10:54,069 INFO L158 Benchmark]: Toolchain (without parser) took 879.32ms. Allocated memory is still 102.8MB. Free memory was 71.9MB in the beginning and 65.6MB in the end (delta: 6.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 08:10:54,070 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 102.8MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 08:10:54,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 873.94ms. Allocated memory is still 102.8MB. Free memory was 71.6MB in the beginning and 65.6MB in the end (delta: 6.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 08:10:54,072 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.27ms. Allocated memory is still 102.8MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 873.94ms. Allocated memory is still 102.8MB. Free memory was 71.6MB in the beginning and 65.6MB in the end (delta: 6.0MB). Peak memory consumption was 10.5MB. 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_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS --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 bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 --- 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-8393723 [2022-11-19 08:10:56,267 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:10:56,270 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:10:56,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:10:56,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:10:56,313 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:10:56,316 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:10:56,320 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:10:56,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:10:56,330 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:10:56,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:10:56,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:10:56,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:10:56,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:10:56,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:10:56,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:10:56,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:10:56,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:10:56,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:10:56,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:10:56,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:10:56,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:10:56,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:10:56,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:10:56,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:10:56,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:10:56,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:10:56,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:10:56,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:10:56,374 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:10:56,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:10:56,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:10:56,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:10:56,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:10:56,378 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:10:56,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:10:56,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:10:56,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:10:56,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:10:56,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:10:56,382 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:10:56,388 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-19 08:10:56,430 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:10:56,431 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:10:56,432 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:10:56,432 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:10:56,433 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:10:56,434 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:10:56,434 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:10:56,434 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:10:56,435 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:10:56,435 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:10:56,436 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:10:56,437 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:10:56,438 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 08:10:56,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 08:10:56,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:10:56,439 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:10:56,440 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 08:10:56,440 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:10:56,440 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:10:56,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:10:56,441 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 08:10:56,441 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 08:10:56,441 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 08:10:56,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:10:56,442 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 08:10:56,442 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-19 08:10:56,442 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-19 08:10:56,443 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:10:56,443 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:10:56,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:10:56,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-19 08:10:56,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:10:56,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:10:56,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:10:56,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:10:56,446 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-19 08:10:56,446 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-19 08:10:56,446 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:10:56,447 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-19 08:10:56,447 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_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS 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 -> bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 [2022-11-19 08:10:56,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:10:56,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:10:56,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:10:56,842 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:10:56,843 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:10:56,844 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2022-11-19 08:10:56,903 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/data/4855584b1/f449a68ebb6044deb178f2aa23386653/FLAGe61eeaa21 [2022-11-19 08:10:57,586 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:10:57,586 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2022-11-19 08:10:57,607 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/data/4855584b1/f449a68ebb6044deb178f2aa23386653/FLAGe61eeaa21 [2022-11-19 08:10:57,774 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/data/4855584b1/f449a68ebb6044deb178f2aa23386653 [2022-11-19 08:10:57,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:10:57,778 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:10:57,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:10:57,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:10:57,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:10:57,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:10:57" (1/1) ... [2022-11-19 08:10:57,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e2b458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:57, skipping insertion in model container [2022-11-19 08:10:57,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:10:57" (1/1) ... [2022-11-19 08:10:57,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:10:57,853 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:10:58,518 WARN L234 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_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[44118,44131] [2022-11-19 08:10:58,543 WARN L234 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_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[44660,44673] [2022-11-19 08:10:58,672 WARN L234 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_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[56247,56260] [2022-11-19 08:10:58,674 WARN L234 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_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[56368,56381] [2022-11-19 08:10:58,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:10:58,705 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-19 08:10:58,721 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:10:58,752 WARN L234 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_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[44118,44131] [2022-11-19 08:10:58,760 WARN L234 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_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[44660,44673] [2022-11-19 08:10:58,842 WARN L234 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_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[56247,56260] [2022-11-19 08:10:58,843 WARN L234 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_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[56368,56381] [2022-11-19 08:10:58,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:10:58,859 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 08:10:58,905 WARN L234 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_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[44118,44131] [2022-11-19 08:10:58,913 WARN L234 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_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[44660,44673] [2022-11-19 08:10:59,004 WARN L234 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_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[56247,56260] [2022-11-19 08:10:59,005 WARN L234 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_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i[56368,56381] [2022-11-19 08:10:59,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:10:59,113 INFO L208 MainTranslator]: Completed translation [2022-11-19 08:10:59,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:59 WrapperNode [2022-11-19 08:10:59,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:10:59,115 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 08:10:59,115 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 08:10:59,116 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 08:10:59,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:59" (1/1) ... [2022-11-19 08:10:59,169 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:59" (1/1) ... [2022-11-19 08:10:59,237 INFO L138 Inliner]: procedures = 285, calls = 347, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1200 [2022-11-19 08:10:59,238 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 08:10:59,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 08:10:59,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 08:10:59,239 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 08:10:59,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:59" (1/1) ... [2022-11-19 08:10:59,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:59" (1/1) ... [2022-11-19 08:10:59,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:59" (1/1) ... [2022-11-19 08:10:59,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:59" (1/1) ... [2022-11-19 08:10:59,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:59" (1/1) ... [2022-11-19 08:10:59,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:59" (1/1) ... [2022-11-19 08:10:59,331 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:59" (1/1) ... [2022-11-19 08:10:59,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:59" (1/1) ... [2022-11-19 08:10:59,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 08:10:59,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 08:10:59,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 08:10:59,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 08:10:59,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:59" (1/1) ... [2022-11-19 08:10:59,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:10:59,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:10:59,391 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 08:10:59,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 08:10:59,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-19 08:10:59,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-19 08:10:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 08:10:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-19 08:10:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-19 08:10:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 08:10:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-19 08:10:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-19 08:10:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2022-11-19 08:10:59,446 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2022-11-19 08:10:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-19 08:10:59,446 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-19 08:10:59,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-19 08:10:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 08:10:59,448 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2022-11-19 08:10:59,450 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2022-11-19 08:10:59,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-19 08:10:59,450 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2022-11-19 08:10:59,450 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2022-11-19 08:10:59,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 08:10:59,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 08:10:59,793 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 08:10:59,796 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 08:11:05,436 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 08:11:05,457 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 08:11:05,457 INFO L300 CfgBuilder]: Removed 72 assume(true) statements. [2022-11-19 08:11:05,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:11:05 BoogieIcfgContainer [2022-11-19 08:11:05,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 08:11:05,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 08:11:05,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 08:11:05,467 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 08:11:05,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:10:57" (1/3) ... [2022-11-19 08:11:05,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75596756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:11:05, skipping insertion in model container [2022-11-19 08:11:05,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:10:59" (2/3) ... [2022-11-19 08:11:05,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75596756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:11:05, skipping insertion in model container [2022-11-19 08:11:05,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:11:05" (3/3) ... [2022-11-19 08:11:05,471 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test6-2.i [2022-11-19 08:11:05,490 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 08:11:05,490 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 634 error locations. [2022-11-19 08:11:05,569 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 08:11:05,577 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;@7ceaed9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 08:11:05,578 INFO L358 AbstractCegarLoop]: Starting to check reachability of 634 error locations. [2022-11-19 08:11:05,589 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-11-19 08:11:05,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-19 08:11:05,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:11:05,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-19 08:11:05,597 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-11-19 08:11:05,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:11:05,603 INFO L85 PathProgramCache]: Analyzing trace with hash 77521, now seen corresponding path program 1 times [2022-11-19 08:11:05,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:11:05,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135422836] [2022-11-19 08:11:05,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:11:05,618 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-11-19 08:11:05,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:11:05,631 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:05,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:11:05,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:11:05,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:11:05,960 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-11-19 08:11:05,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:11:05,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:11:05,980 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:11:05,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135422836] [2022-11-19 08:11:05,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135422836] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:11:05,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:11:05,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:11:05,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538639561] [2022-11-19 08:11:05,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:11:05,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:11:05,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:11:06,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:11:06,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:11:06,043 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-11-19 08:11:08,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:11:08,954 INFO L93 Difference]: Finished difference Result 1536 states and 1625 transitions. [2022-11-19 08:11:08,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:11:08,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-19 08:11:08,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:11:08,978 INFO L225 Difference]: With dead ends: 1536 [2022-11-19 08:11:08,979 INFO L226 Difference]: Without dead ends: 1534 [2022-11-19 08:11:08,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:11:08,984 INFO L413 NwaCegarLoop]: 909 mSDtfsCounter, 906 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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, 2.8s IncrementalHoareTripleChecker+Time [2022-11-19 08:11:08,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 1254 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-19 08:11:09,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2022-11-19 08:11:09,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1299. [2022-11-19 08:11:09,132 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-11-19 08:11:09,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1418 transitions. [2022-11-19 08:11:09,146 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1418 transitions. Word has length 3 [2022-11-19 08:11:09,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:11:09,147 INFO L495 AbstractCegarLoop]: Abstraction has 1299 states and 1418 transitions. [2022-11-19 08:11:09,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:11:09,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1418 transitions. [2022-11-19 08:11:09,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-19 08:11:09,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:11:09,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-19 08:11:09,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:09,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:09,351 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-11-19 08:11:09,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:11:09,352 INFO L85 PathProgramCache]: Analyzing trace with hash 77522, now seen corresponding path program 1 times [2022-11-19 08:11:09,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:11:09,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444257912] [2022-11-19 08:11:09,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:11:09,353 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-11-19 08:11:09,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:11:09,354 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:09,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:11:09,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:11:09,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:11:09,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:11:09,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:11:09,523 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:11:09,523 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:11:09,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444257912] [2022-11-19 08:11:09,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444257912] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:11:09,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:11:09,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:11:09,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790102794] [2022-11-19 08:11:09,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:11:09,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:11:09,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:11:09,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:11:09,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:11:09,527 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-11-19 08:11:13,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:11:13,988 INFO L93 Difference]: Finished difference Result 1890 states and 2056 transitions. [2022-11-19 08:11:13,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:11:13,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-19 08:11:13,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:11:13,995 INFO L225 Difference]: With dead ends: 1890 [2022-11-19 08:11:13,996 INFO L226 Difference]: Without dead ends: 1890 [2022-11-19 08:11:13,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:11:13,997 INFO L413 NwaCegarLoop]: 1053 mSDtfsCounter, 624 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s 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, 4.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:11:13,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 1754 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-11-19 08:11:14,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2022-11-19 08:11:14,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1503. [2022-11-19 08:11:14,037 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-11-19 08:11:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1834 transitions. [2022-11-19 08:11:14,045 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1834 transitions. Word has length 3 [2022-11-19 08:11:14,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:11:14,046 INFO L495 AbstractCegarLoop]: Abstraction has 1503 states and 1834 transitions. [2022-11-19 08:11:14,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:11:14,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1834 transitions. [2022-11-19 08:11:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-19 08:11:14,048 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:11:14,048 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:11:14,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 08:11:14,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:14,260 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-11-19 08:11:14,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:11:14,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1111693489, now seen corresponding path program 1 times [2022-11-19 08:11:14,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:11:14,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376128348] [2022-11-19 08:11:14,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:11:14,262 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-11-19 08:11:14,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:11:14,266 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:14,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:11:14,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-19 08:11:14,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:11:14,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:11:14,481 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-11-19 08:11:14,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:11:14,549 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-11-19 08:11:14,567 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:11:14,568 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-11-19 08:11:14,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:11:14,599 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:11:14,600 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:11:14,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376128348] [2022-11-19 08:11:14,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1376128348] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:11:14,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:11:14,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:11:14,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189801834] [2022-11-19 08:11:14,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:11:14,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:11:14,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:11:14,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:11:14,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:11:14,602 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-11-19 08:11:21,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:11:21,986 INFO L93 Difference]: Finished difference Result 2568 states and 2977 transitions. [2022-11-19 08:11:21,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:11:21,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-19 08:11:21,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:11:21,995 INFO L225 Difference]: With dead ends: 2568 [2022-11-19 08:11:21,995 INFO L226 Difference]: Without dead ends: 2568 [2022-11-19 08:11:21,995 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-11-19 08:11:21,997 INFO L413 NwaCegarLoop]: 716 mSDtfsCounter, 1111 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 2206 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 1808 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:11:21,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 1808 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2206 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2022-11-19 08:11:22,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2022-11-19 08:11:22,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 1648. [2022-11-19 08:11:22,035 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-11-19 08:11:22,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2117 transitions. [2022-11-19 08:11:22,041 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2117 transitions. Word has length 8 [2022-11-19 08:11:22,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:11:22,042 INFO L495 AbstractCegarLoop]: Abstraction has 1648 states and 2117 transitions. [2022-11-19 08:11:22,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:11:22,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2117 transitions. [2022-11-19 08:11:22,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-19 08:11:22,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:11:22,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:11:22,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:22,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:22,256 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-11-19 08:11:22,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:11:22,256 INFO L85 PathProgramCache]: Analyzing trace with hash -102759776, now seen corresponding path program 1 times [2022-11-19 08:11:22,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:11:22,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180483024] [2022-11-19 08:11:22,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:11:22,257 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-11-19 08:11:22,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:11:22,259 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:22,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:11:22,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 08:11:22,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:11:22,436 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-11-19 08:11:22,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:11:22,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:11:22,461 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:11:22,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180483024] [2022-11-19 08:11:22,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180483024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:11:22,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:11:22,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:11:22,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402763595] [2022-11-19 08:11:22,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:11:22,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:11:22,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:11:22,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:11:22,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:11:22,470 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-11-19 08:11:27,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:11:27,235 INFO L93 Difference]: Finished difference Result 2810 states and 3510 transitions. [2022-11-19 08:11:27,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:11:27,237 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-11-19 08:11:27,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:11:27,245 INFO L225 Difference]: With dead ends: 2810 [2022-11-19 08:11:27,245 INFO L226 Difference]: Without dead ends: 2810 [2022-11-19 08:11:27,246 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-11-19 08:11:27,247 INFO L413 NwaCegarLoop]: 1319 mSDtfsCounter, 2331 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s 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, 4.6s IncrementalHoareTripleChecker+Time [2022-11-19 08:11:27,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2337 Valid, 2575 Invalid, 1841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1784 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-11-19 08:11:27,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2022-11-19 08:11:27,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 1603. [2022-11-19 08:11:27,284 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-11-19 08:11:27,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2058 transitions. [2022-11-19 08:11:27,290 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2058 transitions. Word has length 9 [2022-11-19 08:11:27,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:11:27,291 INFO L495 AbstractCegarLoop]: Abstraction has 1603 states and 2058 transitions. [2022-11-19 08:11:27,291 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-11-19 08:11:27,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2058 transitions. [2022-11-19 08:11:27,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-19 08:11:27,292 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:11:27,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:11:27,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 08:11:27,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:27,503 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-11-19 08:11:27,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:11:27,504 INFO L85 PathProgramCache]: Analyzing trace with hash -102759775, now seen corresponding path program 1 times [2022-11-19 08:11:27,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:11:27,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420875235] [2022-11-19 08:11:27,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:11:27,504 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-11-19 08:11:27,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:11:27,506 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:27,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:11:27,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-19 08:11:27,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:11:27,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:11:27,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:11:27,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:11:27,750 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:11:27,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420875235] [2022-11-19 08:11:27,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420875235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:11:27,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:11:27,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:11:27,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023235146] [2022-11-19 08:11:27,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:11:27,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:11:27,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:11:27,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:11:27,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:11:27,752 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-11-19 08:11:33,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:11:33,319 INFO L93 Difference]: Finished difference Result 2439 states and 3103 transitions. [2022-11-19 08:11:33,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:11:33,320 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-11-19 08:11:33,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:11:33,329 INFO L225 Difference]: With dead ends: 2439 [2022-11-19 08:11:33,329 INFO L226 Difference]: Without dead ends: 2439 [2022-11-19 08:11:33,330 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-11-19 08:11:33,331 INFO L413 NwaCegarLoop]: 1511 mSDtfsCounter, 1581 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s 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, 5.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:11:33,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1586 Valid, 2714 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-11-19 08:11:33,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states. [2022-11-19 08:11:33,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 1593. [2022-11-19 08:11:33,362 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-11-19 08:11:33,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2034 transitions. [2022-11-19 08:11:33,367 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2034 transitions. Word has length 9 [2022-11-19 08:11:33,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:11:33,368 INFO L495 AbstractCegarLoop]: Abstraction has 1593 states and 2034 transitions. [2022-11-19 08:11:33,368 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-11-19 08:11:33,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2034 transitions. [2022-11-19 08:11:33,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 08:11:33,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:11:33,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:11:33,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:33,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:33,581 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-11-19 08:11:33,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:11:33,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1033799265, now seen corresponding path program 1 times [2022-11-19 08:11:33,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:11:33,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757518438] [2022-11-19 08:11:33,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:11:33,582 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-11-19 08:11:33,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:11:33,585 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:33,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:11:33,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 08:11:33,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:11:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:11:33,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:11:33,824 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:11:33,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757518438] [2022-11-19 08:11:33,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [757518438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:11:33,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:11:33,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:11:33,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115358488] [2022-11-19 08:11:33,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:11:33,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:11:33,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:11:33,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:11:33,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:11:33,827 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-11-19 08:11:34,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:11:34,865 INFO L93 Difference]: Finished difference Result 2263 states and 2807 transitions. [2022-11-19 08:11:34,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:11:34,866 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-11-19 08:11:34,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:11:34,873 INFO L225 Difference]: With dead ends: 2263 [2022-11-19 08:11:34,873 INFO L226 Difference]: Without dead ends: 2263 [2022-11-19 08:11:34,873 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-11-19 08:11:34,874 INFO L413 NwaCegarLoop]: 1452 mSDtfsCounter, 749 mSDsluCounter, 2415 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:11:34,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 3867 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-19 08:11:34,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2022-11-19 08:11:34,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 1851. [2022-11-19 08:11:34,923 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-11-19 08:11:34,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 2552 transitions. [2022-11-19 08:11:34,929 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 2552 transitions. Word has length 11 [2022-11-19 08:11:34,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:11:34,932 INFO L495 AbstractCegarLoop]: Abstraction has 1851 states and 2552 transitions. [2022-11-19 08:11:34,932 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-11-19 08:11:34,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2552 transitions. [2022-11-19 08:11:34,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:11:34,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:11:34,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:11:34,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 08:11:35,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:35,144 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-11-19 08:11:35,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:11:35,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1306900600, now seen corresponding path program 1 times [2022-11-19 08:11:35,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:11:35,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56750020] [2022-11-19 08:11:35,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:11:35,145 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-11-19 08:11:35,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:11:35,151 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:35,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:11:35,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-19 08:11:35,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:11:35,384 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:11:35,384 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:11:35,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:11:35,388 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-11-19 08:11:35,444 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 08:11:35,444 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-11-19 08:11:35,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:11:35,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:11:35,463 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:11:35,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56750020] [2022-11-19 08:11:35,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56750020] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:11:35,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:11:35,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:11:35,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082751041] [2022-11-19 08:11:35,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:11:35,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:11:35,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:11:35,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:11:35,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:11:35,466 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-11-19 08:11:37,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:11:37,539 INFO L93 Difference]: Finished difference Result 1999 states and 2407 transitions. [2022-11-19 08:11:37,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:11:37,541 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-11-19 08:11:37,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:11:37,545 INFO L225 Difference]: With dead ends: 1999 [2022-11-19 08:11:37,546 INFO L226 Difference]: Without dead ends: 1999 [2022-11-19 08:11:37,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:11:37,547 INFO L413 NwaCegarLoop]: 1384 mSDtfsCounter, 502 mSDsluCounter, 2472 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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, 2.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:11:37,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 3856 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-19 08:11:37,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2022-11-19 08:11:37,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1493. [2022-11-19 08:11:37,584 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-11-19 08:11:37,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1826 transitions. [2022-11-19 08:11:37,588 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1826 transitions. Word has length 14 [2022-11-19 08:11:37,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:11:37,589 INFO L495 AbstractCegarLoop]: Abstraction has 1493 states and 1826 transitions. [2022-11-19 08:11:37,589 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-11-19 08:11:37,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1826 transitions. [2022-11-19 08:11:37,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 08:11:37,590 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:11:37,590 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:11:37,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 08:11:37,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:37,803 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-11-19 08:11:37,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:11:37,803 INFO L85 PathProgramCache]: Analyzing trace with hash 769788685, now seen corresponding path program 1 times [2022-11-19 08:11:37,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:11:37,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287170562] [2022-11-19 08:11:37,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:11:37,804 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-11-19 08:11:37,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:11:37,805 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:37,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:11:38,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 08:11:38,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:11:38,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:11:38,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:11:38,041 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:11:38,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287170562] [2022-11-19 08:11:38,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287170562] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:11:38,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:11:38,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:11:38,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621854738] [2022-11-19 08:11:38,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:11:38,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:11:38,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:11:38,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:11:38,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:11:38,044 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-11-19 08:11:38,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:11:38,076 INFO L93 Difference]: Finished difference Result 1433 states and 1740 transitions. [2022-11-19 08:11:38,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:11:38,077 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-11-19 08:11:38,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:11:38,083 INFO L225 Difference]: With dead ends: 1433 [2022-11-19 08:11:38,083 INFO L226 Difference]: Without dead ends: 1433 [2022-11-19 08:11:38,083 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-11-19 08:11:38,084 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-11-19 08:11:38,084 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-11-19 08:11:38,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2022-11-19 08:11:38,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1433. [2022-11-19 08:11:38,108 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-11-19 08:11:38,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1740 transitions. [2022-11-19 08:11:38,120 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 1740 transitions. Word has length 19 [2022-11-19 08:11:38,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:11:38,120 INFO L495 AbstractCegarLoop]: Abstraction has 1433 states and 1740 transitions. [2022-11-19 08:11:38,121 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-11-19 08:11:38,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1740 transitions. [2022-11-19 08:11:38,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 08:11:38,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:11:38,122 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:11:38,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:38,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:38,335 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-11-19 08:11:38,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:11:38,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1032548102, now seen corresponding path program 1 times [2022-11-19 08:11:38,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:11:38,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839073693] [2022-11-19 08:11:38,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:11:38,337 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-11-19 08:11:38,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:11:38,338 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:38,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:11:38,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:11:38,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:11:38,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:11:38,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:11:38,602 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:11:38,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1839073693] [2022-11-19 08:11:38,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1839073693] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:11:38,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:11:38,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:11:38,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28269836] [2022-11-19 08:11:38,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:11:38,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:11:38,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:11:38,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:11:38,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:11:38,605 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-11-19 08:11:38,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:11:38,690 INFO L93 Difference]: Finished difference Result 1405 states and 1684 transitions. [2022-11-19 08:11:38,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:11:38,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-19 08:11:38,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:11:38,697 INFO L225 Difference]: With dead ends: 1405 [2022-11-19 08:11:38,698 INFO L226 Difference]: Without dead ends: 1405 [2022-11-19 08:11:38,698 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-11-19 08:11:38,701 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.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:11:38,701 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.1s Time] [2022-11-19 08:11:38,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2022-11-19 08:11:38,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1403. [2022-11-19 08:11:38,721 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-11-19 08:11:38,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 1682 transitions. [2022-11-19 08:11:38,724 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 1682 transitions. Word has length 21 [2022-11-19 08:11:38,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:11:38,725 INFO L495 AbstractCegarLoop]: Abstraction has 1403 states and 1682 transitions. [2022-11-19 08:11:38,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:11:38,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1682 transitions. [2022-11-19 08:11:38,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-19 08:11:38,726 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:11:38,726 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:11:38,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 08:11:38,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:38,939 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-11-19 08:11:38,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:11:38,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308372, now seen corresponding path program 1 times [2022-11-19 08:11:38,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:11:38,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788225921] [2022-11-19 08:11:38,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:11:38,940 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-11-19 08:11:38,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:11:38,942 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:38,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:11:39,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 08:11:39,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:11:39,209 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-11-19 08:11:39,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:11:39,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:11:39,312 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:11:39,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788225921] [2022-11-19 08:11:39,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788225921] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:11:39,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:11:39,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:11:39,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192894561] [2022-11-19 08:11:39,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:11:39,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:11:39,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:11:39,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:11:39,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:11:39,314 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-11-19 08:11:44,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:11:44,520 INFO L93 Difference]: Finished difference Result 2571 states and 3078 transitions. [2022-11-19 08:11:44,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:11:44,522 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-11-19 08:11:44,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:11:44,527 INFO L225 Difference]: With dead ends: 2571 [2022-11-19 08:11:44,527 INFO L226 Difference]: Without dead ends: 2571 [2022-11-19 08:11:44,528 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-11-19 08:11:44,528 INFO L413 NwaCegarLoop]: 1147 mSDtfsCounter, 2420 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 2363 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s 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, 5.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:11:44,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2423 Valid, 2731 Invalid, 2381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2363 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-19 08:11:44,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2022-11-19 08:11:44,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 1399. [2022-11-19 08:11:44,568 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-11-19 08:11:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 1674 transitions. [2022-11-19 08:11:44,571 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 1674 transitions. Word has length 35 [2022-11-19 08:11:44,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:11:44,572 INFO L495 AbstractCegarLoop]: Abstraction has 1399 states and 1674 transitions. [2022-11-19 08:11:44,572 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-11-19 08:11:44,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1674 transitions. [2022-11-19 08:11:44,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-19 08:11:44,576 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:11:44,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:11:44,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 08:11:44,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:44,789 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-11-19 08:11:44,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:11:44,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308373, now seen corresponding path program 1 times [2022-11-19 08:11:44,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:11:44,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533450905] [2022-11-19 08:11:44,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:11:44,791 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-11-19 08:11:44,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:11:44,792 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:44,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:11:45,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-19 08:11:45,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:11:45,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:11:45,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:11:45,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:11:45,300 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:11:45,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533450905] [2022-11-19 08:11:45,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1533450905] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:11:45,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:11:45,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:11:45,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348010454] [2022-11-19 08:11:45,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:11:45,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:11:45,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:11:45,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:11:45,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:11:45,302 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-11-19 08:11:51,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:11:51,642 INFO L93 Difference]: Finished difference Result 2213 states and 2657 transitions. [2022-11-19 08:11:51,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:11:51,647 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-11-19 08:11:51,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:11:51,667 INFO L225 Difference]: With dead ends: 2213 [2022-11-19 08:11:51,668 INFO L226 Difference]: Without dead ends: 2213 [2022-11-19 08:11:51,668 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-11-19 08:11:51,668 INFO L413 NwaCegarLoop]: 1538 mSDtfsCounter, 2195 mSDsluCounter, 1753 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s 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, 6.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:11:51,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2195 Valid, 3291 Invalid, 2161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2140 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-11-19 08:11:51,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2213 states. [2022-11-19 08:11:51,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2213 to 1395. [2022-11-19 08:11:51,690 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-11-19 08:11:51,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1666 transitions. [2022-11-19 08:11:51,693 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1666 transitions. Word has length 35 [2022-11-19 08:11:51,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:11:51,693 INFO L495 AbstractCegarLoop]: Abstraction has 1395 states and 1666 transitions. [2022-11-19 08:11:51,693 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-11-19 08:11:51,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1666 transitions. [2022-11-19 08:11:51,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-19 08:11:51,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:11:51,695 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-11-19 08:11:51,713 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:51,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:51,908 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-11-19 08:11:51,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:11:51,908 INFO L85 PathProgramCache]: Analyzing trace with hash -2063651411, now seen corresponding path program 1 times [2022-11-19 08:11:51,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:11:51,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680991363] [2022-11-19 08:11:51,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:11:51,909 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-11-19 08:11:51,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:11:51,911 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:51,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:11:52,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:11:52,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:11:52,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:11:52,264 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:11:52,265 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:11:52,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680991363] [2022-11-19 08:11:52,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680991363] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:11:52,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:11:52,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:11:52,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096465466] [2022-11-19 08:11:52,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:11:52,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:11:52,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:11:52,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:11:52,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:11:52,267 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-11-19 08:11:52,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:11:52,336 INFO L93 Difference]: Finished difference Result 1383 states and 1646 transitions. [2022-11-19 08:11:52,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:11:52,337 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-11-19 08:11:52,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:11:52,341 INFO L225 Difference]: With dead ends: 1383 [2022-11-19 08:11:52,341 INFO L226 Difference]: Without dead ends: 1383 [2022-11-19 08:11:52,342 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-11-19 08:11:52,343 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-11-19 08:11:52,343 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-11-19 08:11:52,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2022-11-19 08:11:52,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1383. [2022-11-19 08:11:52,363 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-11-19 08:11:52,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1646 transitions. [2022-11-19 08:11:52,366 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1646 transitions. Word has length 54 [2022-11-19 08:11:52,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:11:52,369 INFO L495 AbstractCegarLoop]: Abstraction has 1383 states and 1646 transitions. [2022-11-19 08:11:52,369 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-11-19 08:11:52,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1646 transitions. [2022-11-19 08:11:52,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-19 08:11:52,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:11:52,371 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-11-19 08:11:52,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 08:11:52,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:52,593 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-11-19 08:11:52,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:11:52,593 INFO L85 PathProgramCache]: Analyzing trace with hash -202865055, now seen corresponding path program 1 times [2022-11-19 08:11:52,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:11:52,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989961649] [2022-11-19 08:11:52,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:11:52,594 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-11-19 08:11:52,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:11:52,595 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:52,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:11:53,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-19 08:11:53,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:11:53,129 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-19 08:11:53,130 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-11-19 08:11:53,205 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-19 08:11:53,205 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-11-19 08:11:53,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:11:53,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:11:53,697 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:11:53,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989961649] [2022-11-19 08:11:53,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989961649] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:11:53,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:11:53,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:11:53,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298979123] [2022-11-19 08:11:53,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:11:53,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:11:53,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:11:53,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:11:53,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:11:53,700 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-11-19 08:11:59,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:11:59,074 INFO L93 Difference]: Finished difference Result 3211 states and 3774 transitions. [2022-11-19 08:11:59,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:11:59,075 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-11-19 08:11:59,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:11:59,082 INFO L225 Difference]: With dead ends: 3211 [2022-11-19 08:11:59,082 INFO L226 Difference]: Without dead ends: 3211 [2022-11-19 08:11:59,082 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-11-19 08:11:59,083 INFO L413 NwaCegarLoop]: 1188 mSDtfsCounter, 3291 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 1753 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3291 SdHoareTripleChecker+Valid, 2330 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:11:59,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3291 Valid, 2330 Invalid, 1799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1753 Invalid, 0 Unknown, 2 Unchecked, 5.2s Time] [2022-11-19 08:11:59,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3211 states. [2022-11-19 08:11:59,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3211 to 1837. [2022-11-19 08:11:59,115 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-11-19 08:11:59,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2492 transitions. [2022-11-19 08:11:59,120 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2492 transitions. Word has length 62 [2022-11-19 08:11:59,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:11:59,120 INFO L495 AbstractCegarLoop]: Abstraction has 1837 states and 2492 transitions. [2022-11-19 08:11:59,120 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-11-19 08:11:59,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2492 transitions. [2022-11-19 08:11:59,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-19 08:11:59,121 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:11:59,121 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-11-19 08:11:59,141 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 08:11:59,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:59,337 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-11-19 08:11:59,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:11:59,337 INFO L85 PathProgramCache]: Analyzing trace with hash -202865054, now seen corresponding path program 1 times [2022-11-19 08:11:59,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:11:59,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35698187] [2022-11-19 08:11:59,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:11:59,338 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-11-19 08:11:59,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:11:59,339 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:59,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:11:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:11:59,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-19 08:11:59,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:11:59,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:11:59,837 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-11-19 08:11:59,919 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:11:59,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-19 08:12:00,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:12:00,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:12:00,695 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:12:00,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35698187] [2022-11-19 08:12:00,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35698187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:12:00,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:12:00,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:12:00,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373869316] [2022-11-19 08:12:00,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:12:00,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:12:00,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:12:00,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:12:00,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:12:00,697 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-11-19 08:12:04,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:12:04,790 INFO L93 Difference]: Finished difference Result 1843 states and 2499 transitions. [2022-11-19 08:12:04,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:12:04,795 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-11-19 08:12:04,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:12:04,810 INFO L225 Difference]: With dead ends: 1843 [2022-11-19 08:12:04,810 INFO L226 Difference]: Without dead ends: 1843 [2022-11-19 08:12:04,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:12:04,811 INFO L413 NwaCegarLoop]: 1168 mSDtfsCounter, 111 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 2396 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:12:04,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 2396 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-19 08:12:04,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2022-11-19 08:12:04,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1842. [2022-11-19 08:12:04,843 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-11-19 08:12:04,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2498 transitions. [2022-11-19 08:12:04,847 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2498 transitions. Word has length 62 [2022-11-19 08:12:04,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:12:04,848 INFO L495 AbstractCegarLoop]: Abstraction has 1842 states and 2498 transitions. [2022-11-19 08:12:04,848 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-11-19 08:12:04,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2498 transitions. [2022-11-19 08:12:04,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-19 08:12:04,850 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:04,850 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-11-19 08:12:04,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 08:12:05,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:05,065 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-11-19 08:12:05,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:05,065 INFO L85 PathProgramCache]: Analyzing trace with hash -904346310, now seen corresponding path program 1 times [2022-11-19 08:12:05,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:12:05,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766812330] [2022-11-19 08:12:05,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:05,066 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-11-19 08:12:05,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:12:05,069 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:05,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:05,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 08:12:05,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:12:05,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:12:05,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:12:05,451 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:12:05,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766812330] [2022-11-19 08:12:05,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766812330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:12:05,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:12:05,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 08:12:05,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807451310] [2022-11-19 08:12:05,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:12:05,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:12:05,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:12:05,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:12:05,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:12:05,453 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-11-19 08:12:05,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:12:05,597 INFO L93 Difference]: Finished difference Result 1868 states and 2525 transitions. [2022-11-19 08:12:05,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:12:05,598 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-11-19 08:12:05,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:12:05,607 INFO L225 Difference]: With dead ends: 1868 [2022-11-19 08:12:05,608 INFO L226 Difference]: Without dead ends: 1868 [2022-11-19 08:12:05,610 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-11-19 08:12:05,611 INFO L413 NwaCegarLoop]: 1183 mSDtfsCounter, 19 mSDsluCounter, 4722 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:12:05,611 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.1s Time] [2022-11-19 08:12:05,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2022-11-19 08:12:05,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1866. [2022-11-19 08:12:05,651 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-11-19 08:12:05,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2525 transitions. [2022-11-19 08:12:05,676 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2525 transitions. Word has length 68 [2022-11-19 08:12:05,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:12:05,676 INFO L495 AbstractCegarLoop]: Abstraction has 1866 states and 2525 transitions. [2022-11-19 08:12:05,677 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-11-19 08:12:05,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2525 transitions. [2022-11-19 08:12:05,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-19 08:12:05,677 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:05,678 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-11-19 08:12:05,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 08:12:05,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:05,892 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-11-19 08:12:05,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:05,893 INFO L85 PathProgramCache]: Analyzing trace with hash -961994179, now seen corresponding path program 1 times [2022-11-19 08:12:05,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:12:05,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112634632] [2022-11-19 08:12:05,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:05,894 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-11-19 08:12:05,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:12:05,897 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:05,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:06,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 08:12:06,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:12:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:12:06,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:12:06,442 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:12:06,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112634632] [2022-11-19 08:12:06,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112634632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:12:06,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:12:06,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:12:06,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454692937] [2022-11-19 08:12:06,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:12:06,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:12:06,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:12:06,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:12:06,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:12:06,444 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-11-19 08:12:06,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:12:06,685 INFO L93 Difference]: Finished difference Result 1878 states and 2539 transitions. [2022-11-19 08:12:06,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:12:06,685 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-11-19 08:12:06,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:12:06,694 INFO L225 Difference]: With dead ends: 1878 [2022-11-19 08:12:06,694 INFO L226 Difference]: Without dead ends: 1878 [2022-11-19 08:12:06,694 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-11-19 08:12:06,695 INFO L413 NwaCegarLoop]: 1169 mSDtfsCounter, 23 mSDsluCounter, 3444 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 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.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:12:06,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 4613 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:12:06,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2022-11-19 08:12:06,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1869. [2022-11-19 08:12:06,753 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-11-19 08:12:06,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2528 transitions. [2022-11-19 08:12:06,758 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2528 transitions. Word has length 68 [2022-11-19 08:12:06,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:12:06,759 INFO L495 AbstractCegarLoop]: Abstraction has 1869 states and 2528 transitions. [2022-11-19 08:12:06,760 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-11-19 08:12:06,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2528 transitions. [2022-11-19 08:12:06,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-19 08:12:06,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:06,761 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-11-19 08:12:06,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 08:12:06,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:06,976 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-11-19 08:12:06,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:06,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1684223946, now seen corresponding path program 1 times [2022-11-19 08:12:06,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:12:06,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297176125] [2022-11-19 08:12:06,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:06,978 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-11-19 08:12:06,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:12:06,979 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:06,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:07,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-19 08:12:07,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:12:07,454 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-11-19 08:12:07,629 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-11-19 08:12:07,651 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 08:12:07,651 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-11-19 08:12:07,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:12:07,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:12:07,666 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:12:07,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297176125] [2022-11-19 08:12:07,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297176125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:12:07,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:12:07,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:12:07,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237435667] [2022-11-19 08:12:07,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:12:07,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:12:07,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:12:07,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:12:07,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2022-11-19 08:12:07,668 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-11-19 08:12:13,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:12:13,773 INFO L93 Difference]: Finished difference Result 3193 states and 4238 transitions. [2022-11-19 08:12:13,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:12:13,773 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-11-19 08:12:13,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:12:13,781 INFO L225 Difference]: With dead ends: 3193 [2022-11-19 08:12:13,781 INFO L226 Difference]: Without dead ends: 3193 [2022-11-19 08:12:13,781 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-11-19 08:12:13,783 INFO L413 NwaCegarLoop]: 1101 mSDtfsCounter, 1620 mSDsluCounter, 1926 mSDsCounter, 0 mSdLazyCounter, 2738 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s 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, 6.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:12:13,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1626 Valid, 3027 Invalid, 4371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2738 Invalid, 0 Unknown, 1612 Unchecked, 6.0s Time] [2022-11-19 08:12:13,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2022-11-19 08:12:13,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 1868. [2022-11-19 08:12:13,822 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-11-19 08:12:13,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2526 transitions. [2022-11-19 08:12:13,826 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2526 transitions. Word has length 73 [2022-11-19 08:12:13,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:12:13,827 INFO L495 AbstractCegarLoop]: Abstraction has 1868 states and 2526 transitions. [2022-11-19 08:12:13,827 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-11-19 08:12:13,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2526 transitions. [2022-11-19 08:12:13,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-19 08:12:13,834 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:13,834 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-11-19 08:12:13,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 08:12:14,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:14,051 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-11-19 08:12:14,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:14,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1684223945, now seen corresponding path program 1 times [2022-11-19 08:12:14,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:12:14,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062550243] [2022-11-19 08:12:14,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:14,053 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-11-19 08:12:14,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:12:14,054 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:14,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:14,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-19 08:12:14,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:12:14,602 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-11-19 08:12:14,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:12:15,168 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-11-19 08:12:15,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:12:15,190 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-11-19 08:12:15,201 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:12:15,202 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-11-19 08:12:15,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:12:15,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:12:15,225 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:12:15,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062550243] [2022-11-19 08:12:15,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062550243] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:12:15,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:12:15,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 08:12:15,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107440607] [2022-11-19 08:12:15,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:12:15,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 08:12:15,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:12:15,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 08:12:15,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2022-11-19 08:12:15,226 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-11-19 08:12:25,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:12:25,019 INFO L93 Difference]: Finished difference Result 3264 states and 4363 transitions. [2022-11-19 08:12:25,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 08:12:25,021 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-11-19 08:12:25,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:12:25,027 INFO L225 Difference]: With dead ends: 3264 [2022-11-19 08:12:25,027 INFO L226 Difference]: Without dead ends: 3264 [2022-11-19 08:12:25,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2022-11-19 08:12:25,028 INFO L413 NwaCegarLoop]: 1299 mSDtfsCounter, 2396 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 3959 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2402 SdHoareTripleChecker+Valid, 2955 SdHoareTripleChecker+Invalid, 5893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1903 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-11-19 08:12:25,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2402 Valid, 2955 Invalid, 5893 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [31 Valid, 3959 Invalid, 0 Unknown, 1903 Unchecked, 9.6s Time] [2022-11-19 08:12:25,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3264 states. [2022-11-19 08:12:25,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3264 to 1864. [2022-11-19 08:12:25,058 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-11-19 08:12:25,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 2514 transitions. [2022-11-19 08:12:25,062 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 2514 transitions. Word has length 73 [2022-11-19 08:12:25,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:12:25,063 INFO L495 AbstractCegarLoop]: Abstraction has 1864 states and 2514 transitions. [2022-11-19 08:12:25,063 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-11-19 08:12:25,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2514 transitions. [2022-11-19 08:12:25,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-19 08:12:25,064 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:25,064 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-11-19 08:12:25,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 08:12:25,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:25,280 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-11-19 08:12:25,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:25,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1696557543, now seen corresponding path program 1 times [2022-11-19 08:12:25,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:12:25,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216893096] [2022-11-19 08:12:25,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:25,281 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-11-19 08:12:25,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:12:25,282 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:25,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:25,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-19 08:12:25,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:12:25,743 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-11-19 08:12:25,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:12:25,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-19 08:12:25,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-11-19 08:12:25,847 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:12:25,847 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:12:25,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216893096] [2022-11-19 08:12:25,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [216893096] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:12:25,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:12:25,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 08:12:25,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120465109] [2022-11-19 08:12:25,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:12:25,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 08:12:25,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:12:25,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 08:12:25,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:12:25,849 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-11-19 08:12:31,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:12:31,741 INFO L93 Difference]: Finished difference Result 1879 states and 2530 transitions. [2022-11-19 08:12:31,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 08:12:31,743 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-11-19 08:12:31,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:12:31,747 INFO L225 Difference]: With dead ends: 1879 [2022-11-19 08:12:31,747 INFO L226 Difference]: Without dead ends: 1879 [2022-11-19 08:12:31,748 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-11-19 08:12:31,748 INFO L413 NwaCegarLoop]: 1169 mSDtfsCounter, 23 mSDsluCounter, 3748 mSDsCounter, 0 mSdLazyCounter, 3317 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s 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, 5.8s IncrementalHoareTripleChecker+Time [2022-11-19 08:12:31,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4917 Invalid, 3319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3317 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-11-19 08:12:31,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2022-11-19 08:12:31,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1878. [2022-11-19 08:12:31,771 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-11-19 08:12:31,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2530 transitions. [2022-11-19 08:12:31,775 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2530 transitions. Word has length 80 [2022-11-19 08:12:31,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:12:31,776 INFO L495 AbstractCegarLoop]: Abstraction has 1878 states and 2530 transitions. [2022-11-19 08:12:31,776 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-11-19 08:12:31,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2530 transitions. [2022-11-19 08:12:31,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-19 08:12:31,777 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:31,777 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-11-19 08:12:31,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:31,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:31,992 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-11-19 08:12:31,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:31,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1053676349, now seen corresponding path program 1 times [2022-11-19 08:12:31,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:12:31,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805373895] [2022-11-19 08:12:31,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:31,993 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-11-19 08:12:31,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:12:31,994 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:32,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:32,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-19 08:12:32,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:12:32,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:12:32,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:12:32,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:12:32,556 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-11-19 08:12:32,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 19 treesize of output 7 [2022-11-19 08:12:32,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:12:32,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:12:32,671 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:12:32,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805373895] [2022-11-19 08:12:32,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805373895] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:12:32,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:12:32,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-19 08:12:32,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58270934] [2022-11-19 08:12:32,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:12:32,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 08:12:32,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:12:32,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 08:12:32,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-19 08:12:32,674 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-11-19 08:12:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:12:40,914 INFO L93 Difference]: Finished difference Result 1878 states and 2528 transitions. [2022-11-19 08:12:40,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 08:12:40,915 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-11-19 08:12:40,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:12:40,919 INFO L225 Difference]: With dead ends: 1878 [2022-11-19 08:12:40,919 INFO L226 Difference]: Without dead ends: 1878 [2022-11-19 08:12:40,919 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-11-19 08:12:40,920 INFO L413 NwaCegarLoop]: 1164 mSDtfsCounter, 19 mSDsluCounter, 4769 mSDsCounter, 0 mSdLazyCounter, 3477 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s 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, 8.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:12:40,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 5933 Invalid, 3478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3477 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2022-11-19 08:12:40,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2022-11-19 08:12:40,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1878. [2022-11-19 08:12:40,945 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-11-19 08:12:40,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2528 transitions. [2022-11-19 08:12:40,949 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2528 transitions. Word has length 81 [2022-11-19 08:12:40,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:12:40,950 INFO L495 AbstractCegarLoop]: Abstraction has 1878 states and 2528 transitions. [2022-11-19 08:12:40,950 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-11-19 08:12:40,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2528 transitions. [2022-11-19 08:12:40,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-19 08:12:40,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:40,951 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-11-19 08:12:40,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 08:12:41,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:41,167 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-11-19 08:12:41,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:41,167 INFO L85 PathProgramCache]: Analyzing trace with hash 491350102, now seen corresponding path program 1 times [2022-11-19 08:12:41,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:12:41,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743759608] [2022-11-19 08:12:41,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:41,168 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-11-19 08:12:41,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:12:41,170 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:41,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:41,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 08:12:41,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:12:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:12:41,683 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:12:41,683 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:12:41,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743759608] [2022-11-19 08:12:41,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743759608] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:12:41,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:12:41,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:12:41,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672450101] [2022-11-19 08:12:41,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:12:41,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:12:41,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:12:41,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:12:41,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:12:41,685 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-11-19 08:12:41,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:12:41,785 INFO L93 Difference]: Finished difference Result 1894 states and 2546 transitions. [2022-11-19 08:12:41,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:12:41,786 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-11-19 08:12:41,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:12:41,798 INFO L225 Difference]: With dead ends: 1894 [2022-11-19 08:12:41,798 INFO L226 Difference]: Without dead ends: 1888 [2022-11-19 08:12:41,799 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-11-19 08:12:41,800 INFO L413 NwaCegarLoop]: 1172 mSDtfsCounter, 11 mSDsluCounter, 3500 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 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.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:12:41,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 4672 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:12:41,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2022-11-19 08:12:41,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1888. [2022-11-19 08:12:41,829 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-11-19 08:12:41,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2540 transitions. [2022-11-19 08:12:41,834 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2540 transitions. Word has length 88 [2022-11-19 08:12:41,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:12:41,834 INFO L495 AbstractCegarLoop]: Abstraction has 1888 states and 2540 transitions. [2022-11-19 08:12:41,834 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-11-19 08:12:41,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2540 transitions. [2022-11-19 08:12:41,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-19 08:12:41,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:41,836 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-11-19 08:12:41,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 08:12:42,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:42,051 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-11-19 08:12:42,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:42,051 INFO L85 PathProgramCache]: Analyzing trace with hash -385822936, now seen corresponding path program 1 times [2022-11-19 08:12:42,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:12:42,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384339890] [2022-11-19 08:12:42,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:42,052 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-11-19 08:12:42,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:12:42,054 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:42,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:42,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 08:12:42,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:12:42,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:12:42,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:12:42,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:12:42,785 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:12:42,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384339890] [2022-11-19 08:12:42,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384339890] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:12:42,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1097822830] [2022-11-19 08:12:42,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:42,786 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:12:42,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:12:42,793 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:12:42,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-11-19 08:12:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:43,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 08:12:43,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:12:43,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:12:43,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:12:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:12:43,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1097822830] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:12:43,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147007706] [2022-11-19 08:12:43,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:12:43,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:12:43,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:12:43,589 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:12:43,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-19 08:12:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:12:44,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 08:12:44,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:12:44,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:12:44,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:12:44,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:12:44,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147007706] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:12:44,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-19 08:12:44,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 10 [2022-11-19 08:12:44,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669134531] [2022-11-19 08:12:44,158 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-19 08:12:44,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-19 08:12:44,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:12:44,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-19 08:12:44,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-19 08:12:44,159 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-11-19 08:12:44,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:12:44,518 INFO L93 Difference]: Finished difference Result 1914 states and 2570 transitions. [2022-11-19 08:12:44,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-19 08:12:44,519 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-11-19 08:12:44,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:12:44,524 INFO L225 Difference]: With dead ends: 1914 [2022-11-19 08:12:44,525 INFO L226 Difference]: Without dead ends: 1902 [2022-11-19 08:12:44,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-11-19 08:12:44,526 INFO L413 NwaCegarLoop]: 1175 mSDtfsCounter, 45 mSDsluCounter, 7006 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 8181 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:12:44,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 8181 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:12:44,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2022-11-19 08:12:44,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1896. [2022-11-19 08:12:44,549 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-11-19 08:12:44,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2550 transitions. [2022-11-19 08:12:44,553 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2550 transitions. Word has length 89 [2022-11-19 08:12:44,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:12:44,553 INFO L495 AbstractCegarLoop]: Abstraction has 1896 states and 2550 transitions. [2022-11-19 08:12:44,553 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-11-19 08:12:44,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2550 transitions. [2022-11-19 08:12:44,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-19 08:12:44,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:12:44,555 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-11-19 08:12:44,575 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 08:12:44,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2022-11-19 08:12:44,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-19 08:12:45,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:12:45,171 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-11-19 08:12:45,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:12:45,171 INFO L85 PathProgramCache]: Analyzing trace with hash 55938262, now seen corresponding path program 2 times [2022-11-19 08:12:45,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:12:45,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297624498] [2022-11-19 08:12:45,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:12:45,172 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-11-19 08:12:45,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:12:45,173 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:45,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:12:45,864 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:12:45,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:12:45,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-19 08:12:45,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:12:46,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:12:46,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:12:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:12:46,421 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:12:46,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297624498] [2022-11-19 08:12:46,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297624498] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:12:46,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [311224589] [2022-11-19 08:12:46,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:12:46,421 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:12:46,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:12:46,423 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:12:46,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2022-11-19 08:12:48,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:12:48,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:12:48,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-19 08:12:48,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:12:48,965 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:12:48,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:12:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:12:49,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [311224589] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:12:49,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673704568] [2022-11-19 08:12:49,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:12:49,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:12:49,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:12:49,102 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:12:49,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-19 08:13:49,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:13:49,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:13:49,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-19 08:13:49,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:13:49,960 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:13:49,960 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-11-19 08:13:50,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:13:50,645 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:13:50,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-19 08:13:50,731 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-11-19 08:13:50,777 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 08:13:50,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:13:50,973 INFO L321 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-19 08:13:50,973 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-11-19 08:13:51,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673704568] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:13:51,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-19 08:13:51,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 14] total 29 [2022-11-19 08:13:51,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394148261] [2022-11-19 08:13:51,148 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-19 08:13:51,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-19 08:13:51,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:13:51,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-19 08:13:51,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=800, Unknown=14, NotChecked=0, Total=930 [2022-11-19 08:13:51,149 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-11-19 08:14:10,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:14:10,049 INFO L93 Difference]: Finished difference Result 2440 states and 3224 transitions. [2022-11-19 08:14:10,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-19 08:14:10,050 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-11-19 08:14:10,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:14:10,056 INFO L225 Difference]: With dead ends: 2440 [2022-11-19 08:14:10,056 INFO L226 Difference]: Without dead ends: 2428 [2022-11-19 08:14:10,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 431 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=417, Invalid=2617, Unknown=46, NotChecked=0, Total=3080 [2022-11-19 08:14:10,058 INFO L413 NwaCegarLoop]: 760 mSDtfsCounter, 931 mSDsluCounter, 11400 mSDsCounter, 0 mSdLazyCounter, 8707 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 12160 SdHoareTripleChecker+Invalid, 9421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 8707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 657 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:14:10,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 12160 Invalid, 9421 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 8707 Invalid, 0 Unknown, 657 Unchecked, 17.2s Time] [2022-11-19 08:14:10,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2022-11-19 08:14:10,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 1905. [2022-11-19 08:14:10,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1905 states, 1346 states have (on average 1.847696879643388) internal successors, (2487), 1862 states have internal predecessors, (2487), 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-11-19 08:14:10,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 2558 transitions. [2022-11-19 08:14:10,104 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 2558 transitions. Word has length 92 [2022-11-19 08:14:10,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:14:10,105 INFO L495 AbstractCegarLoop]: Abstraction has 1905 states and 2558 transitions. [2022-11-19 08:14:10,105 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-11-19 08:14:10,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 2558 transitions. [2022-11-19 08:14:10,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-19 08:14:10,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:14:10,107 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:14:10,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2022-11-19 08:14:10,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-19 08:14:10,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:14:10,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:14:10,727 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-11-19 08:14:10,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:14:10,728 INFO L85 PathProgramCache]: Analyzing trace with hash 248505897, now seen corresponding path program 1 times [2022-11-19 08:14:10,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:14:10,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390599558] [2022-11-19 08:14:10,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:14:10,728 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-11-19 08:14:10,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:14:10,730 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:14:10,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:14:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:14:11,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 08:14:11,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:14:11,508 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:14:11,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:14:12,447 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:14:12,447 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:14:12,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390599558] [2022-11-19 08:14:12,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1390599558] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:14:12,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1117301585] [2022-11-19 08:14:12,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:14:12,448 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:14:12,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:14:12,449 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:14:12,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-11-19 08:14:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:14:13,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 08:14:13,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:14:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:14:13,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:14:13,634 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:14:13,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1117301585] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:14:13,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440322627] [2022-11-19 08:14:13,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:14:13,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:14:13,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:14:13,636 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:14:13,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-19 08:14:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:14:14,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-19 08:14:14,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:14:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:14:14,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:14:15,867 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:14:15,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440322627] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:14:15,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-19 08:14:15,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2022-11-19 08:14:15,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396527079] [2022-11-19 08:14:15,868 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-19 08:14:15,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-19 08:14:15,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:14:15,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-19 08:14:15,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=1012, Unknown=0, NotChecked=0, Total=1406 [2022-11-19 08:14:15,871 INFO L87 Difference]: Start difference. First operand 1905 states and 2558 transitions. Second operand has 38 states, 38 states have (on average 3.210526315789474) internal successors, (122), 38 states have internal predecessors, (122), 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-11-19 08:14:19,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:14:19,996 INFO L93 Difference]: Finished difference Result 2009 states and 2694 transitions. [2022-11-19 08:14:19,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-19 08:14:19,997 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.210526315789474) internal successors, (122), 38 states have internal predecessors, (122), 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 97 [2022-11-19 08:14:19,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:14:20,000 INFO L225 Difference]: With dead ends: 2009 [2022-11-19 08:14:20,001 INFO L226 Difference]: Without dead ends: 1991 [2022-11-19 08:14:20,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1544, Invalid=3286, Unknown=0, NotChecked=0, Total=4830 [2022-11-19 08:14:20,003 INFO L413 NwaCegarLoop]: 1190 mSDtfsCounter, 305 mSDsluCounter, 20031 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 21221 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-19 08:14:20,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 21221 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-19 08:14:20,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2022-11-19 08:14:20,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1943. [2022-11-19 08:14:20,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1943 states, 1384 states have (on average 1.8345375722543353) internal successors, (2539), 1900 states have internal predecessors, (2539), 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-11-19 08:14:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1943 states and 2610 transitions. [2022-11-19 08:14:20,049 INFO L78 Accepts]: Start accepts. Automaton has 1943 states and 2610 transitions. Word has length 97 [2022-11-19 08:14:20,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:14:20,050 INFO L495 AbstractCegarLoop]: Abstraction has 1943 states and 2610 transitions. [2022-11-19 08:14:20,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.210526315789474) internal successors, (122), 38 states have internal predecessors, (122), 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-11-19 08:14:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 2610 transitions. [2022-11-19 08:14:20,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-19 08:14:20,051 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:14:20,052 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:14:20,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2022-11-19 08:14:20,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-19 08:14:20,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 08:14:20,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:14:20,661 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-11-19 08:14:20,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:14:20,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1246207703, now seen corresponding path program 2 times [2022-11-19 08:14:20,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:14:20,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598559025] [2022-11-19 08:14:20,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:14:20,662 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-11-19 08:14:20,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:14:20,663 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:14:20,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:14:21,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:14:21,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:14:21,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-19 08:14:21,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:14:22,293 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:14:22,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:14:27,340 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:14:27,341 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:14:27,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598559025] [2022-11-19 08:14:27,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598559025] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:14:27,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1002831876] [2022-11-19 08:14:27,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:14:27,341 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:14:27,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:14:27,343 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:14:27,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2022-11-19 08:14:30,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:14:30,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:14:30,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-19 08:14:30,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:14:30,397 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:14:30,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:14:31,988 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:14:31,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1002831876] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:14:31,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395720808] [2022-11-19 08:14:31,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:14:31,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:14:31,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:14:31,990 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:14:31,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-19 08:15:01,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:15:01,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:15:01,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-19 08:15:01,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:15:01,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:15:02,031 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:15:02,035 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-11-19 08:15:02,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:15:02,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:15:02,604 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-11-19 08:15:02,614 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-11-19 08:15:06,636 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:15:06,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:15:06,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:15:06,854 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-11-19 08:15:06,860 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-11-19 08:15:06,999 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-11-19 08:15:06,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:15:07,932 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3642 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3643 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3642 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-19 08:15:07,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395720808] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:15:07,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-19 08:15:07,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 25, 13] total 60 [2022-11-19 08:15:07,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526833745] [2022-11-19 08:15:07,943 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-19 08:15:07,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-19 08:15:07,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:15:07,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-19 08:15:07,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=659, Invalid=3096, Unknown=31, NotChecked=120, Total=3906 [2022-11-19 08:15:07,946 INFO L87 Difference]: Start difference. First operand 1943 states and 2610 transitions. Second operand has 60 states, 59 states have (on average 3.4237288135593222) internal successors, (202), 57 states have internal predecessors, (202), 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-11-19 08:15:19,579 WARN L859 $PredicateComparison]: unable to prove that (and (not (= (_ bv44 32) |c_alt_bzero_#in~n#1|)) (exists ((v_ArrVal_3598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_3598) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_27 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_27) (_ bv44 32))) (exists ((v_ArrVal_3599 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_3599)))) is different from true [2022-11-19 08:16:48,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:16:48,212 INFO L93 Difference]: Finished difference Result 2598 states and 3468 transitions. [2022-11-19 08:16:48,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-11-19 08:16:48,213 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 3.4237288135593222) internal successors, (202), 57 states have internal predecessors, (202), 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 108 [2022-11-19 08:16:48,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:16:48,219 INFO L225 Difference]: With dead ends: 2598 [2022-11-19 08:16:48,219 INFO L226 Difference]: Without dead ends: 2580 [2022-11-19 08:16:48,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 458 SyntacticMatches, 21 SemanticMatches, 135 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5502 ImplicationChecksByTransitivity, 41.7s TimeCoverageRelationStatistics Valid=2916, Invalid=15103, Unknown=79, NotChecked=534, Total=18632 [2022-11-19 08:16:48,224 INFO L413 NwaCegarLoop]: 732 mSDtfsCounter, 1675 mSDsluCounter, 22585 mSDsCounter, 0 mSdLazyCounter, 19503 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1706 SdHoareTripleChecker+Valid, 23317 SdHoareTripleChecker+Invalid, 21995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 19503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2463 IncrementalHoareTripleChecker+Unchecked, 67.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:16:48,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1706 Valid, 23317 Invalid, 21995 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [29 Valid, 19503 Invalid, 0 Unknown, 2463 Unchecked, 67.4s Time] [2022-11-19 08:16:48,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2022-11-19 08:16:48,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2006. [2022-11-19 08:16:48,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2006 states, 1448 states have (on average 1.8100828729281768) internal successors, (2621), 1963 states have internal predecessors, (2621), 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-11-19 08:16:48,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 2692 transitions. [2022-11-19 08:16:48,256 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 2692 transitions. Word has length 108 [2022-11-19 08:16:48,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:16:48,256 INFO L495 AbstractCegarLoop]: Abstraction has 2006 states and 2692 transitions. [2022-11-19 08:16:48,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 3.4237288135593222) internal successors, (202), 57 states have internal predecessors, (202), 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-11-19 08:16:48,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 2692 transitions. [2022-11-19 08:16:48,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-19 08:16:48,258 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:16:48,258 INFO L195 NwaCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:16:48,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 08:16:48,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-19 08:16:48,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2022-11-19 08:16:48,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt [2022-11-19 08:16:48,879 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-11-19 08:16:48,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:16:48,880 INFO L85 PathProgramCache]: Analyzing trace with hash 781298949, now seen corresponding path program 1 times [2022-11-19 08:16:48,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:16:48,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914329241] [2022-11-19 08:16:48,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:16:48,881 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-11-19 08:16:48,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:16:48,883 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:16:48,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:16:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:16:49,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-19 08:16:49,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:16:51,750 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:16:51,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:16:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:16:57,847 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:16:57,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914329241] [2022-11-19 08:16:57,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1914329241] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:16:57,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [140384498] [2022-11-19 08:16:57,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:16:57,848 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:16:57,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:16:57,849 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:16:57,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-11-19 08:16:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:16:59,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-19 08:16:59,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:16:59,472 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:16:59,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:17:00,796 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:17:00,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [140384498] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:17:00,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448109554] [2022-11-19 08:17:00,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:00,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:17:00,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:17:00,798 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:17:00,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-19 08:17:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:01,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-19 08:17:01,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:17:01,925 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:17:01,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:17:21,394 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:17:21,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448109554] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:17:21,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-19 08:17:21,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46, 46, 46, 46] total 134 [2022-11-19 08:17:21,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125794501] [2022-11-19 08:17:21,395 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-19 08:17:21,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 134 states [2022-11-19 08:17:21,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:17:21,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2022-11-19 08:17:21,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3407, Invalid=14415, Unknown=0, NotChecked=0, Total=17822 [2022-11-19 08:17:21,402 INFO L87 Difference]: Start difference. First operand 2006 states and 2692 transitions. Second operand has 134 states, 134 states have (on average 1.6492537313432836) internal successors, (221), 134 states have internal predecessors, (221), 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-11-19 08:18:45,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:18:45,750 INFO L93 Difference]: Finished difference Result 2380 states and 3188 transitions. [2022-11-19 08:18:45,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2022-11-19 08:18:45,751 INFO L78 Accepts]: Start accepts. Automaton has has 134 states, 134 states have (on average 1.6492537313432836) internal successors, (221), 134 states have internal predecessors, (221), 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 132 [2022-11-19 08:18:45,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:18:45,755 INFO L225 Difference]: With dead ends: 2380 [2022-11-19 08:18:45,755 INFO L226 Difference]: Without dead ends: 2362 [2022-11-19 08:18:45,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 912 GetRequests, 654 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12611 ImplicationChecksByTransitivity, 86.8s TimeCoverageRelationStatistics Valid=18243, Invalid=49097, Unknown=0, NotChecked=0, Total=67340 [2022-11-19 08:18:45,763 INFO L413 NwaCegarLoop]: 1249 mSDtfsCounter, 2063 mSDsluCounter, 77963 mSDsCounter, 0 mSdLazyCounter, 8360 mSolverCounterSat, 1756 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2063 SdHoareTripleChecker+Valid, 79212 SdHoareTripleChecker+Invalid, 10116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 1756 IncrementalHoareTripleChecker+Valid, 8360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2022-11-19 08:18:45,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2063 Valid, 79212 Invalid, 10116 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [1756 Valid, 8360 Invalid, 0 Unknown, 0 Unchecked, 20.9s Time] [2022-11-19 08:18:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2022-11-19 08:18:45,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2134. [2022-11-19 08:18:45,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2134 states, 1576 states have (on average 1.7709390862944163) internal successors, (2791), 2091 states have internal predecessors, (2791), 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-11-19 08:18:45,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 2134 states and 2862 transitions. [2022-11-19 08:18:45,795 INFO L78 Accepts]: Start accepts. Automaton has 2134 states and 2862 transitions. Word has length 132 [2022-11-19 08:18:45,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:18:45,796 INFO L495 AbstractCegarLoop]: Abstraction has 2134 states and 2862 transitions. [2022-11-19 08:18:45,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 134 states, 134 states have (on average 1.6492537313432836) internal successors, (221), 134 states have internal predecessors, (221), 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-11-19 08:18:45,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 2862 transitions. [2022-11-19 08:18:45,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-19 08:18:45,798 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:18:45,798 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-11-19 08:18:45,813 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (36)] Ended with exit code 0 [2022-11-19 08:18:46,021 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:18:46,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-11-19 08:18:46,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:18:46,408 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-19 08:18:46,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:18:46,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1849192087, now seen corresponding path program 2 times [2022-11-19 08:18:46,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:18:46,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125741121] [2022-11-19 08:18:46,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:18:46,410 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-11-19 08:18:46,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:18:46,410 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:18:46,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:18:47,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 08:18:47,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:18:47,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-19 08:18:47,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:18:47,514 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-19 08:18:47,515 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 39 treesize of output 29 [2022-11-19 08:18:47,568 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-19 08:18:47,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 17 [2022-11-19 08:18:47,591 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2022-11-19 08:18:47,591 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:18:47,591 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:18:47,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125741121] [2022-11-19 08:18:47,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125741121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:18:47,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:18:47,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 08:18:47,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052199189] [2022-11-19 08:18:47,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:18:47,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 08:18:47,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:18:47,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 08:18:47,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:18:47,593 INFO L87 Difference]: Start difference. First operand 2134 states and 2862 transitions. Second operand has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 7 states have internal predecessors, (86), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 08:18:52,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:18:52,293 INFO L93 Difference]: Finished difference Result 3422 states and 4584 transitions. [2022-11-19 08:18:52,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 08:18:52,294 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 7 states have internal predecessors, (86), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 135 [2022-11-19 08:18:52,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:18:52,300 INFO L225 Difference]: With dead ends: 3422 [2022-11-19 08:18:52,300 INFO L226 Difference]: Without dead ends: 3422 [2022-11-19 08:18:52,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-19 08:18:52,300 INFO L413 NwaCegarLoop]: 2006 mSDtfsCounter, 1856 mSDsluCounter, 5423 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1861 SdHoareTripleChecker+Valid, 7429 SdHoareTripleChecker+Invalid, 2057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 445 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:18:52,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1861 Valid, 7429 Invalid, 2057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1590 Invalid, 0 Unknown, 445 Unchecked, 4.5s Time] [2022-11-19 08:18:52,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3422 states. [2022-11-19 08:18:52,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3422 to 2133. [2022-11-19 08:18:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2133 states, 1576 states have (on average 1.7696700507614214) internal successors, (2789), 2090 states have internal predecessors, (2789), 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-11-19 08:18:52,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2860 transitions. [2022-11-19 08:18:52,327 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2860 transitions. Word has length 135 [2022-11-19 08:18:52,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:18:52,328 INFO L495 AbstractCegarLoop]: Abstraction has 2133 states and 2860 transitions. [2022-11-19 08:18:52,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 7 states have internal predecessors, (86), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 08:18:52,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2860 transitions. [2022-11-19 08:18:52,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-19 08:18:52,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:18:52,330 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-11-19 08:18:52,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:18:52,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:18:52,543 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-19 08:18:52,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:18:52,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1849192088, now seen corresponding path program 1 times [2022-11-19 08:18:52,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:18:52,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031806781] [2022-11-19 08:18:52,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:18:52,545 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-11-19 08:18:52,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:18:52,546 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:18:52,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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 (39)] Waiting until timeout for monitored process [2022-11-19 08:18:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:18:53,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 123 conjunts are in the unsatisfiable core [2022-11-19 08:18:53,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:18:53,916 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-11-19 08:18:54,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:18:54,293 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:18:54,293 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-11-19 08:18:54,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:18:54,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:18:54,492 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-11-19 08:18:54,498 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-11-19 08:18:56,992 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5641 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5641))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_5640 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5640)))) is different from true [2022-11-19 08:18:57,044 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:18:57,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:18:57,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:18:57,204 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:18:57,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:18:57,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:18:57,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-19 08:18:57,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 08:18:57,300 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-19 08:18:57,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:18:57,546 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5642 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5643 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5642) |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_5643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-19 08:18:57,586 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_5642 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5643 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-19 08:18:58,741 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5643 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5735))) (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~mem73#1.base| v_ArrVal_5734) .cse0 v_ArrVal_5642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5642 (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_5734) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5735) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) is different from false [2022-11-19 08:18:58,753 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:18:58,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031806781] [2022-11-19 08:18:58,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031806781] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:18:58,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1215897376] [2022-11-19 08:18:58,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:18:58,754 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:18:58,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:18:58,759 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:18:58,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2022-11-19 08:19:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:19:03,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-19 08:19:03,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:19:03,199 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-11-19 08:19:03,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:19:03,883 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:19:03,883 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-11-19 08:19:03,897 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-11-19 08:19:03,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:19:03,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:19:04,103 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-11-19 08:19:04,193 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-11-19 08:19:08,610 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-11-19 08:19:08,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:19:08,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 60 [2022-11-19 08:19:08,923 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-19 08:19:08,923 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-11-19 08:19:09,071 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 17 treesize of output 9 [2022-11-19 08:19:09,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 08:19:09,192 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-19 08:19:09,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:19:09,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 231 treesize of output 159 [2022-11-19 08:19:15,797 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_6227 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6227))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (not (bvule (bvadd .cse0 (_ bv20 32)) (select |c_#length| v_arrayElimCell_56))) (forall ((v_prenex_5 (_ BitVec 32))) (let ((.cse1 (select (select (store .cse2 v_arrayElimCell_56 (store (select .cse2 v_arrayElimCell_56) (bvadd (_ bv16 32) .cse0) v_prenex_5)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))))) (forall ((v_ArrVal_6178 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_ArrVal_6227 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6227))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse6 (select |c_#length| v_arrayElimCell_56))) (or (bvule (bvadd (_ bv8 32) (select (select (store .cse4 v_arrayElimCell_56 (store (select .cse4 v_arrayElimCell_56) (bvadd (_ bv16 32) .cse5) v_ArrVal_6178)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) .cse6) (not (bvule (bvadd .cse5 (_ bv20 32)) .cse6)))))))) is different from false [2022-11-19 08:19:15,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1215897376] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:19:15,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523334515] [2022-11-19 08:19:15,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:19:15,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:19:15,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:19:15,816 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:19:15,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-11-19 08:19:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:19:16,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 120 conjunts are in the unsatisfiable core [2022-11-19 08:19:16,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:19:16,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:19:16,931 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:19:16,931 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-11-19 08:19:17,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:19:17,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:19:17,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 22 treesize of output 10 [2022-11-19 08:19:17,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 9 treesize of output 3 [2022-11-19 08:19:19,988 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_6711 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6711))) (exists ((v_ArrVal_6710 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6710)))) is different from true [2022-11-19 08:19:20,057 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:19:20,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:19:20,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:19:20,409 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:19:20,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:19:20,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-11-19 08:19:20,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-19 08:19:20,454 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-11-19 08:19:20,460 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-19 08:19:20,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:19:20,525 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6713 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6712) |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_6713) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6712 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6712) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2022-11-19 08:19:20,560 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_6712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6713 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6712) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6713) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6712 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6712) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-19 08:19:21,622 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6804))) (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_6805) .cse0 v_ArrVal_6712) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6713) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6804 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6712 (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_6805) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6804) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6712) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-19 08:19:21,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523334515] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:19:21,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:19:21,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 36 [2022-11-19 08:19:21,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916334324] [2022-11-19 08:19:21,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:19:21,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-19 08:19:21,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:19:21,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-19 08:19:21,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1336, Unknown=46, NotChecked=738, Total=2256 [2022-11-19 08:19:21,633 INFO L87 Difference]: Start difference. First operand 2133 states and 2860 transitions. Second operand has 37 states, 33 states have (on average 7.212121212121212) internal successors, (238), 31 states have internal predecessors, (238), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-19 08:19:24,247 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6177 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6177))) (exists ((v_ArrVal_5641 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5641))) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10| (_ BitVec 32))) (= (select |c_#length| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_10|) (_ bv40 32))) (exists ((v_ArrVal_6711 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6711))) (exists ((v_ArrVal_6710 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6710))) (exists ((v_ArrVal_5640 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5640)))) is different from true [2022-11-19 08:20:05,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:20:05,935 INFO L93 Difference]: Finished difference Result 3454 states and 4566 transitions. [2022-11-19 08:20:05,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-19 08:20:05,936 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 7.212121212121212) internal successors, (238), 31 states have internal predecessors, (238), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 135 [2022-11-19 08:20:05,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:20:05,941 INFO L225 Difference]: With dead ends: 3454 [2022-11-19 08:20:05,941 INFO L226 Difference]: Without dead ends: 3454 [2022-11-19 08:20:05,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 248 SyntacticMatches, 132 SemanticMatches, 61 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1712 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=274, Invalid=2458, Unknown=64, NotChecked=1110, Total=3906 [2022-11-19 08:20:05,942 INFO L413 NwaCegarLoop]: 921 mSDtfsCounter, 2973 mSDsluCounter, 13102 mSDsCounter, 0 mSdLazyCounter, 19376 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2978 SdHoareTripleChecker+Valid, 14023 SdHoareTripleChecker+Invalid, 30671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 19376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11252 IncrementalHoareTripleChecker+Unchecked, 42.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:20:05,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2978 Valid, 14023 Invalid, 30671 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [43 Valid, 19376 Invalid, 0 Unknown, 11252 Unchecked, 42.2s Time] [2022-11-19 08:20:05,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3454 states. [2022-11-19 08:20:05,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3454 to 2132. [2022-11-19 08:20:05,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2132 states, 1576 states have (on average 1.7684010152284264) internal successors, (2787), 2089 states have internal predecessors, (2787), 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-11-19 08:20:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2858 transitions. [2022-11-19 08:20:05,975 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2858 transitions. Word has length 135 [2022-11-19 08:20:05,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:20:05,975 INFO L495 AbstractCegarLoop]: Abstraction has 2132 states and 2858 transitions. [2022-11-19 08:20:05,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 7.212121212121212) internal successors, (238), 31 states have internal predecessors, (238), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-19 08:20:05,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2858 transitions. [2022-11-19 08:20:05,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-19 08:20:05,976 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:20:05,977 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-11-19 08:20:05,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-11-19 08:20:06,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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 (39)] Forceful destruction successful, exit code 0 [2022-11-19 08:20:06,409 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (40)] Forceful destruction successful, exit code 0 [2022-11-19 08:20:06,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt [2022-11-19 08:20:06,595 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-19 08:20:06,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:20:06,595 INFO L85 PathProgramCache]: Analyzing trace with hash 2031259997, now seen corresponding path program 1 times [2022-11-19 08:20:06,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:20:06,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716325261] [2022-11-19 08:20:06,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:20:06,596 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-11-19 08:20:06,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:20:06,598 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:20:06,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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)] Waiting until timeout for monitored process [2022-11-19 08:20:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:20:08,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-19 08:20:08,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:20:08,034 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-11-19 08:20:08,242 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-19 08:20:08,243 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-11-19 08:20:08,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:20:08,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-19 08:20:11,187 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:20:11,188 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-11-19 08:20:11,334 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:20:11,334 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-11-19 08:20:11,464 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:20:11,465 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-11-19 08:20:11,491 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-11-19 08:20:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-19 08:20:11,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:20:11,644 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7261) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2022-11-19 08:20:11,657 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_7261) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-19 08:20:11,677 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7261 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7260 (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~mem74#1.base| v_ArrVal_7260))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7261)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-19 08:20:12,309 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7261 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7260 (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_7307))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7260)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7261)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-19 08:20:12,313 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:20:12,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716325261] [2022-11-19 08:20:12,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716325261] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:20:12,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2095375892] [2022-11-19 08:20:12,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:20:12,314 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:20:12,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:20:12,323 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:20:12,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2022-11-19 08:20:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:20:19,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-19 08:20:19,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:20:19,328 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-11-19 08:20:19,528 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-19 08:20:19,529 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-11-19 08:20:19,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:20:19,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-19 08:20:22,435 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:20:22,436 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-11-19 08:20:22,532 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:20:22,532 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-11-19 08:20:22,597 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:20:22,598 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-11-19 08:20:22,623 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-11-19 08:20:22,634 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-19 08:20:22,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:20:22,659 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7763 (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_7763) |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-11-19 08:20:22,672 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_7763) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-19 08:20:22,691 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7762 (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_7762))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7763)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-19 08:20:22,706 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7762 (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_7762))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7763)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-19 08:20:23,109 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7762 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7809 (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_7809))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7762)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7763)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-19 08:20:23,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2095375892] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:20:23,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858685760] [2022-11-19 08:20:23,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:20:23,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:20:23,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:20:23,119 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:20:23,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-11-19 08:20:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:20:24,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-19 08:20:24,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:20:24,336 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:20:24,336 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-11-19 08:20:24,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:20:28,085 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:20:28,086 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-11-19 08:20:28,327 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:20:28,327 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-11-19 08:20:28,490 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:20:28,490 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-11-19 08:20:28,509 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-11-19 08:20:28,514 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-19 08:20:28,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:20:30,701 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8263 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_8263) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-19 08:20:30,722 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8262 (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~mem74#1.base| v_ArrVal_8262))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8263)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-11-19 08:20:30,738 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8262 (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_8262))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8263)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-19 08:20:31,150 INFO L321 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2022-11-19 08:20:31,150 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-11-19 08:20:31,165 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8262 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8309 (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_8309))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8262)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8263)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem73#1.base|)) is different from false [2022-11-19 08:20:31,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858685760] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:20:31,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:20:31,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 28 [2022-11-19 08:20:31,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067304790] [2022-11-19 08:20:31,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:20:31,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-19 08:20:31,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:20:31,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-19 08:20:31,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=851, Unknown=53, NotChecked=936, Total=1980 [2022-11-19 08:20:31,170 INFO L87 Difference]: Start difference. First operand 2132 states and 2858 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-11-19 08:20:59,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:20:59,571 INFO L93 Difference]: Finished difference Result 3701 states and 4916 transitions. [2022-11-19 08:20:59,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-19 08:20:59,571 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-11-19 08:20:59,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:20:59,581 INFO L225 Difference]: With dead ends: 3701 [2022-11-19 08:20:59,581 INFO L226 Difference]: Without dead ends: 3701 [2022-11-19 08:20:59,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 270 SyntacticMatches, 131 SemanticMatches, 57 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 1837 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=246, Invalid=1807, Unknown=69, NotChecked=1300, Total=3422 [2022-11-19 08:20:59,588 INFO L413 NwaCegarLoop]: 1167 mSDtfsCounter, 1843 mSDsluCounter, 15241 mSDsCounter, 0 mSdLazyCounter, 12719 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1847 SdHoareTripleChecker+Valid, 16408 SdHoareTripleChecker+Invalid, 15837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 12719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3065 IncrementalHoareTripleChecker+Unchecked, 27.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:20:59,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1847 Valid, 16408 Invalid, 15837 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [53 Valid, 12719 Invalid, 0 Unknown, 3065 Unchecked, 27.1s Time] [2022-11-19 08:20:59,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3701 states. [2022-11-19 08:20:59,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3701 to 2129. [2022-11-19 08:20:59,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2129 states, 1576 states have (on average 1.7645939086294415) internal successors, (2781), 2086 states have internal predecessors, (2781), 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-11-19 08:20:59,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 2852 transitions. [2022-11-19 08:20:59,624 INFO L78 Accepts]: Start accepts. Automaton has 2129 states and 2852 transitions. Word has length 138 [2022-11-19 08:20:59,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:20:59,625 INFO L495 AbstractCegarLoop]: Abstraction has 2129 states and 2852 transitions. [2022-11-19 08:20:59,625 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-11-19 08:20:59,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 2852 transitions. [2022-11-19 08:20:59,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-19 08:20:59,635 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:20:59,635 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-11-19 08:20:59,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (43)] Forceful destruction successful, exit code 0 [2022-11-19 08:20:59,883 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 08:21:00,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-11-19 08:21:00,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:21:00,256 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-19 08:21:00,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:21:00,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2031259998, now seen corresponding path program 1 times [2022-11-19 08:21:00,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:21:00,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651106900] [2022-11-19 08:21:00,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:21:00,257 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-11-19 08:21:00,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:21:00,258 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:21:00,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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 (45)] Waiting until timeout for monitored process [2022-11-19 08:21:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:21:01,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 127 conjunts are in the unsatisfiable core [2022-11-19 08:21:01,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:21:01,618 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-11-19 08:21:02,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:21:02,115 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:21:02,116 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-11-19 08:21:02,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:21:02,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:21:02,415 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-11-19 08:21:02,421 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-11-19 08:21:05,223 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8809))) (exists ((v_ArrVal_8808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8808))) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32)))) is different from true [2022-11-19 08:21:05,279 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:21:05,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:21:05,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:21:05,477 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:21:05,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:21:05,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:21:05,648 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:21:05,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:21:05,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:21:05,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 08:21:05,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-19 08:21:05,756 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-19 08:21:05,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:21:06,023 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8812 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2022-11-19 08:21:06,062 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_8812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8812 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-19 08:21:06,140 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8810 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8811))) (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_8810) .cse0 v_ArrVal_8812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8810 (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_8810) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8811) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-11-19 08:21:09,194 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8810 (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_8904))) (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_8905) .cse1 v_ArrVal_8810) (select (select (store .cse2 .cse1 v_ArrVal_8811) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8812))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8810 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8904))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8811))) (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_8905) .cse4 v_ArrVal_8810) .cse5 v_ArrVal_8812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-19 08:21:09,210 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:21:09,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651106900] [2022-11-19 08:21:09,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651106900] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:21:09,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2049219356] [2022-11-19 08:21:09,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:21:09,210 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:21:09,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:21:09,211 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:21:09,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (46)] Waiting until timeout for monitored process [2022-11-19 08:23:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:23:38,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 124 conjunts are in the unsatisfiable core [2022-11-19 08:23:38,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:23:38,655 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-11-19 08:23:39,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:23:39,215 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:23:39,215 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-11-19 08:23:39,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:23:39,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:23:39,741 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-11-19 08:23:39,748 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-11-19 08:23:43,568 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_9404 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_9404) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9405 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_9405)))) is different from true [2022-11-19 08:23:43,670 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:23:43,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:23:43,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:23:44,041 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:23:44,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:23:44,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:23:44,288 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:23:44,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:23:44,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:23:44,346 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-11-19 08:23:44,352 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-11-19 08:23:44,364 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-19 08:23:44,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:23:44,455 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9408 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9409 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2022-11-19 08:23:44,530 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_9409 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9408 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-19 08:23:44,609 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9406 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9407))) (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_9406) .cse0 v_ArrVal_9409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9406 (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_9406) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-11-19 08:23:44,665 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_9409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9406 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9406) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_9409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9406 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9407))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9406) .cse3 v_ArrVal_9409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-11-19 08:23:46,073 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9500 (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_9501))) (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_9500) .cse1 v_ArrVal_9406) (select (select (store .cse2 .cse1 v_ArrVal_9407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9409))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9406 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9500 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9501))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9407))) (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_9500) .cse4 v_ArrVal_9406) .cse5 v_ArrVal_9409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-19 08:23:46,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2049219356] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:23:46,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131468070] [2022-11-19 08:23:46,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:23:46,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:23:46,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:23:46,100 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:23:46,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-11-19 08:23:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:23:47,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 123 conjunts are in the unsatisfiable core [2022-11-19 08:23:47,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:23:47,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:23:47,479 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:23:47,479 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-11-19 08:23:47,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:23:47,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:23:47,630 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-11-19 08:23:47,638 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-11-19 08:23:51,490 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_9999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_9999))) (exists ((v_ArrVal_10000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_10000)))) is different from true [2022-11-19 08:23:51,590 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:23:51,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:23:51,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:23:51,813 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:23:51,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:23:51,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:23:51,939 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:23:51,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-19 08:23:51,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-19 08:23:51,994 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-11-19 08:23:51,999 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-11-19 08:23:52,011 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-19 08:23:52,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:23:52,102 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10003 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10004 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_10003 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2022-11-19 08:23:52,148 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_10003 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_10003 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10004 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-19 08:23:52,220 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10003 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10004 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10002 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10002))) (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_10001) .cse0 v_ArrVal_10003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10003 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10002 (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_10001) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10002) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-11-19 08:23:52,272 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_10003 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10004 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10002 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10002))) (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_10001) .cse1 v_ArrVal_10003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_10003 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10002 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10001) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10002) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2022-11-19 08:23:53,662 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10096 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10003 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10004 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10095 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10096))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10002))) (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_10095) .cse0 v_ArrVal_10001) .cse1 v_ArrVal_10003) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10096 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10003 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10095 (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_10096))) (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_10095) .cse6 v_ArrVal_10001) (select (select (store .cse7 .cse6 v_ArrVal_10002) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10003))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2022-11-19 08:23:53,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131468070] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:23:53,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:23:53,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 25 [2022-11-19 08:23:53,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072681903] [2022-11-19 08:23:53,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:23:53,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-19 08:23:53,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:23:53,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-19 08:23:53,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=573, Unknown=27, NotChecked=1088, Total=1806 [2022-11-19 08:23:53,676 INFO L87 Difference]: Start difference. First operand 2129 states and 2852 transitions. Second operand has 26 states, 23 states have (on average 7.478260869565218) internal successors, (172), 22 states have internal predecessors, (172), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-19 08:23:55,942 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8809 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8809))) (exists ((v_ArrVal_8808 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8808))) (exists ((v_arrayElimCell_91 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_91) (_ bv44 32))) (exists ((v_ArrVal_9404 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_9404) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_9999))) (exists ((v_ArrVal_9405 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_9405))) (exists ((v_ArrVal_10000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_10000)))) is different from true [2022-11-19 08:24:40,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:24:40,086 INFO L93 Difference]: Finished difference Result 3450 states and 4558 transitions. [2022-11-19 08:24:40,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-19 08:24:40,087 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.478260869565218) internal successors, (172), 22 states have internal predecessors, (172), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 138 [2022-11-19 08:24:40,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:24:40,092 INFO L225 Difference]: With dead ends: 3450 [2022-11-19 08:24:40,092 INFO L226 Difference]: Without dead ends: 3450 [2022-11-19 08:24:40,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 268 SyntacticMatches, 134 SemanticMatches, 52 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 1429 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=206, Invalid=1097, Unknown=29, NotChecked=1530, Total=2862 [2022-11-19 08:24:40,093 INFO L413 NwaCegarLoop]: 1100 mSDtfsCounter, 2939 mSDsluCounter, 9508 mSDsCounter, 0 mSdLazyCounter, 14075 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2944 SdHoareTripleChecker+Valid, 10608 SdHoareTripleChecker+Invalid, 22408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 14075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8295 IncrementalHoareTripleChecker+Unchecked, 45.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:24:40,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2944 Valid, 10608 Invalid, 22408 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [38 Valid, 14075 Invalid, 0 Unknown, 8295 Unchecked, 45.0s Time] [2022-11-19 08:24:40,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3450 states. [2022-11-19 08:24:40,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3450 to 2128. [2022-11-19 08:24:40,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2128 states, 1576 states have (on average 1.7633248730964468) internal successors, (2779), 2085 states have internal predecessors, (2779), 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-11-19 08:24:40,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 2850 transitions. [2022-11-19 08:24:40,125 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 2850 transitions. Word has length 138 [2022-11-19 08:24:40,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:24:40,126 INFO L495 AbstractCegarLoop]: Abstraction has 2128 states and 2850 transitions. [2022-11-19 08:24:40,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.478260869565218) internal successors, (172), 22 states have internal predecessors, (172), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-19 08:24:40,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 2850 transitions. [2022-11-19 08:24:40,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-19 08:24:40,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:24:40,127 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-11-19 08:24:40,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (46)] Forceful destruction successful, exit code 0 [2022-11-19 08:24:40,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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 (45)] Forceful destruction successful, exit code 0 [2022-11-19 08:24:40,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-11-19 08:24:40,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:24:40,766 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2022-11-19 08:24:40,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:24:40,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1472678910, now seen corresponding path program 1 times [2022-11-19 08:24:40,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:24:40,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1556457512] [2022-11-19 08:24:40,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:24:40,768 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-11-19 08:24:40,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:24:40,769 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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-11-19 08:24:40,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/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 (48)] Waiting until timeout for monitored process [2022-11-19 08:24:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:24:42,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-19 08:24:42,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:24:42,297 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-11-19 08:24:42,684 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-19 08:24:42,684 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-11-19 08:24:42,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:24:42,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-19 08:24:46,743 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:24:46,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-19 08:24:46,951 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:24:46,951 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-11-19 08:24:47,135 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:24:47,136 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-11-19 08:24:47,317 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:24:47,318 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-11-19 08:24:47,359 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-11-19 08:24:47,454 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-19 08:24:47,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:24:47,605 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10568 (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_10568) |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-11-19 08:24:47,623 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10568 (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_10568) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2022-11-19 08:24:47,661 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10567 (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~mem75#1.base| v_ArrVal_10567))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10568)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-19 08:24:47,682 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10567 (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_10567))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10568)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-19 08:24:47,715 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10566 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10567 (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_10566))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10567)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10568)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-19 08:24:47,741 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10566 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10567 (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 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10566))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10567)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10568)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-19 08:24:48,240 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10566 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10567 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10614 (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_10614))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10566)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10567)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10568)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-19 08:24:48,246 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:24:48,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1556457512] [2022-11-19 08:24:48,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1556457512] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:24:48,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [161345884] [2022-11-19 08:24:48,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:24:48,247 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:24:48,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:24:48,248 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:24:48,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (49)] Waiting until timeout for monitored process [2022-11-19 08:24:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:24:57,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-19 08:24:57,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:24:57,240 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-11-19 08:24:57,566 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-19 08:24:57,567 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-11-19 08:24:57,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:24:57,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-19 08:25:01,445 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:25:01,445 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-11-19 08:25:01,603 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:25:01,603 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-11-19 08:25:01,692 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:25:01,693 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-11-19 08:25:01,778 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:25:01,778 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-11-19 08:25:01,819 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-11-19 08:25:01,835 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2022-11-19 08:25:01,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:25:01,867 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11086 (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_11086) |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-11-19 08:25:01,886 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11086 (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_11086) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-19 08:25:01,912 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11086 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11085 (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~mem75#1.base| v_ArrVal_11085))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11086)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-19 08:25:01,933 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11086 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11085 (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_11085))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11086)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-19 08:25:01,965 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11086 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11084 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11085 (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_11084))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11085)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11086)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-19 08:25:01,991 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11086 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11084 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11085 (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_11084))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11085)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11086)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-19 08:25:02,502 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11086 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11084 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11085 (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_11132))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11084)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11085)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11086)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-19 08:25:02,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [161345884] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:25:02,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164364111] [2022-11-19 08:25:02,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:25:02,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:25:02,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:25:02,509 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:25:02,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89d34fd7-0fe6-453c-8d42-85aa63ea2ae9/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-11-19 08:25:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:25:03,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-19 08:25:03,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:25:03,959 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 08:25:03,959 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-11-19 08:25:04,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 08:25:08,875 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_11599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_11599) |c_#memory_$Pointer$.base|)) is different from true [2022-11-19 08:25:08,920 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:25:08,920 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-11-19 08:25:09,077 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:25:09,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 36 treesize of output 37 [2022-11-19 08:25:09,358 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:25:09,358 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-11-19 08:25:09,541 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 08:25:09,542 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-11-19 08:25:09,570 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-11-19 08:25:09,576 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-19 08:25:09,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:25:09,619 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11602 (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_11602) |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-11-19 08:25:09,638 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11602 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_11602) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-19 08:25:09,667 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11602 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11601 (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~mem75#1.base| v_ArrVal_11601))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11602)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-19 08:25:09,689 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11602 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11601 (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_11601))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11602)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-19 08:25:09,736 INFO L321 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2022-11-19 08:25:09,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 60 [2022-11-19 08:25:09,753 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11602 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11600 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11601 (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~mem74#1.base| v_ArrVal_11600))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11601)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11602)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem74#1.base|)) is different from false [2022-11-19 08:25:09,774 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11602 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11600 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11601 (Array (_ BitVec 32) (_ BitVec 32)))) (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))) (= .cse0 (select (select (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11600))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11601)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11602)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2022-11-19 08:25:10,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164364111] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:25:10,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:25:10,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 29 [2022-11-19 08:25:10,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009462340] [2022-11-19 08:25:10,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:25:10,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-19 08:25:10,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:25:10,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-19 08:25:10,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=799, Unknown=63, NotChecked=1638, Total=2652 [2022-11-19 08:25:10,552 INFO L87 Difference]: Start difference. First operand 2128 states and 2850 transitions. Second operand has 30 states, 27 states have (on average 4.703703703703703) internal successors, (127), 26 states have internal predecessors, (127), 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-11-19 08:25:12,436 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_10565))) (exists ((v_ArrVal_11599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_11599) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_127 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_127)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26|) (_ bv1 1))) (not (= v_arrayElimCell_127 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_26|))))) is different from true