./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI --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 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 01:36:36,811 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:36:36,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:36:36,861 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:36:36,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:36:36,862 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:36:36,864 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:36:36,866 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:36:36,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:36:36,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:36:36,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:36:36,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:36:36,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:36:36,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:36:36,873 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:36:36,874 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:36:36,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:36:36,881 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:36:36,883 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:36:36,885 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:36:36,889 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:36:36,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:36:36,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:36:36,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:36:36,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:36:36,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:36:36,898 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:36:36,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:36:36,899 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:36:36,900 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:36:36,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:36:36,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:36:36,902 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:36:36,903 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:36:36,904 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:36:36,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:36:36,905 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:36:36,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:36:36,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:36:36,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:36:36,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:36:36,909 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-03 01:36:36,933 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:36:36,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:36:36,933 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:36:36,933 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:36:36,934 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:36:36,934 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:36:36,935 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:36:36,935 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:36:36,935 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:36:36,935 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:36:36,935 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:36:36,936 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:36:36,936 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:36:36,936 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:36:36,936 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:36:36,936 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:36:36,937 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:36:36,937 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:36:36,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 01:36:36,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 01:36:36,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:36:36,938 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:36:36,938 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 01:36:36,939 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:36:36,939 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:36:36,939 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:36:36,939 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 01:36:36,939 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 01:36:36,940 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 01:36:36,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:36:36,940 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 01:36:36,940 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:36:36,940 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:36:36,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:36:36,941 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:36:36,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:36:36,941 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:36:36,942 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:36:36,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:36:36,942 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:36:36,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:36:36,942 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:36:36,943 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_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/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_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI 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 -> 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 [2022-11-03 01:36:37,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:36:37,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:36:37,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:36:37,253 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:36:37,254 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:36:37,255 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2022-11-03 01:36:37,323 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/data/b3cba2322/d701065bbecc4a6b8154d68f11e784cd/FLAGe5d5f4e1c [2022-11-03 01:36:37,944 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:36:37,945 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2022-11-03 01:36:37,970 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/data/b3cba2322/d701065bbecc4a6b8154d68f11e784cd/FLAGe5d5f4e1c [2022-11-03 01:36:38,190 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/data/b3cba2322/d701065bbecc4a6b8154d68f11e784cd [2022-11-03 01:36:38,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:36:38,194 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:36:38,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:36:38,199 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:36:38,203 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:36:38,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:36:38" (1/1) ... [2022-11-03 01:36:38,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6057ecd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:38, skipping insertion in model container [2022-11-03 01:36:38,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:36:38" (1/1) ... [2022-11-03 01:36:38,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:36:38,293 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:36:38,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44118,44131] [2022-11-03 01:36:39,013 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44660,44673] [2022-11-03 01:36:39,153 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56247,56260] [2022-11-03 01:36:39,156 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56368,56381] [2022-11-03 01:36:39,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:36:39,188 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-03 01:36:39,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@18930216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:39, skipping insertion in model container [2022-11-03 01:36:39,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:36:39,190 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-03 01:36:39,192 INFO L158 Benchmark]: Toolchain (without parser) took 996.58ms. Allocated memory is still 92.3MB. Free memory was 49.8MB in the beginning and 56.8MB in the end (delta: -7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 01:36:39,192 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 92.3MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 01:36:39,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 990.63ms. Allocated memory is still 92.3MB. Free memory was 49.6MB in the beginning and 56.8MB in the end (delta: -7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 01:36:39,196 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.26ms. Allocated memory is still 92.3MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 990.63ms. Allocated memory is still 92.3MB. Free memory was 49.6MB in the beginning and 56.8MB in the end (delta: -7.2MB). Peak memory consumption was 8.4MB. 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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI --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 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 01:36:41,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:36:41,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:36:41,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:36:41,464 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:36:41,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:36:41,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:36:41,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:36:41,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:36:41,481 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:36:41,482 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:36:41,483 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:36:41,483 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:36:41,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:36:41,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:36:41,487 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:36:41,487 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:36:41,488 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:36:41,490 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:36:41,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:36:41,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:36:41,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:36:41,511 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:36:41,512 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:36:41,515 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:36:41,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:36:41,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:36:41,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:36:41,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:36:41,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:36:41,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:36:41,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:36:41,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:36:41,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:36:41,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:36:41,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:36:41,532 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:36:41,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:36:41,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:36:41,534 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:36:41,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:36:41,539 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-03 01:36:41,570 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:36:41,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:36:41,570 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:36:41,571 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:36:41,571 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:36:41,571 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:36:41,572 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:36:41,572 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:36:41,572 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:36:41,572 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:36:41,573 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:36:41,573 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:36:41,573 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 01:36:41,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 01:36:41,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:36:41,574 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:36:41,574 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 01:36:41,575 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:36:41,575 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:36:41,575 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:36:41,575 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 01:36:41,575 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 01:36:41,576 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 01:36:41,576 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:36:41,576 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 01:36:41,576 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 01:36:41,577 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 01:36:41,577 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:36:41,577 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:36:41,577 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:36:41,577 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 01:36:41,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:36:41,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:36:41,578 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:36:41,578 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:36:41,579 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 01:36:41,579 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 01:36:41,579 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:36:41,579 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 01:36:41,579 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_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/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_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI 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 -> 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 [2022-11-03 01:36:41,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:36:41,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:36:41,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:36:41,996 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:36:41,997 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:36:41,999 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2022-11-03 01:36:42,079 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/data/c035836f6/17c7fa94449d41988159d9f7cd116cc2/FLAGe1d34083a [2022-11-03 01:36:42,760 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:36:42,760 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2022-11-03 01:36:42,778 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/data/c035836f6/17c7fa94449d41988159d9f7cd116cc2/FLAGe1d34083a [2022-11-03 01:36:42,980 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/data/c035836f6/17c7fa94449d41988159d9f7cd116cc2 [2022-11-03 01:36:42,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:36:42,984 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:36:42,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:36:42,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:36:42,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:36:42,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:36:42" (1/1) ... [2022-11-03 01:36:42,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f879048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:42, skipping insertion in model container [2022-11-03 01:36:42,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:36:42" (1/1) ... [2022-11-03 01:36:43,000 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:36:43,083 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:36:43,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44118,44131] [2022-11-03 01:36:43,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44660,44673] [2022-11-03 01:36:43,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56247,56260] [2022-11-03 01:36:43,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56368,56381] [2022-11-03 01:36:43,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:36:43,857 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-03 01:36:43,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:36:43,929 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44118,44131] [2022-11-03 01:36:43,932 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44660,44673] [2022-11-03 01:36:44,042 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56247,56260] [2022-11-03 01:36:44,053 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56368,56381] [2022-11-03 01:36:44,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:36:44,083 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:36:44,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44118,44131] [2022-11-03 01:36:44,140 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44660,44673] [2022-11-03 01:36:44,224 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56247,56260] [2022-11-03 01:36:44,225 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56368,56381] [2022-11-03 01:36:44,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:36:44,310 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:36:44,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44 WrapperNode [2022-11-03 01:36:44,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:36:44,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:36:44,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:36:44,313 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:36:44,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44" (1/1) ... [2022-11-03 01:36:44,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44" (1/1) ... [2022-11-03 01:36:44,457 INFO L138 Inliner]: procedures = 285, calls = 294, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1042 [2022-11-03 01:36:44,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:36:44,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:36:44,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:36:44,458 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:36:44,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44" (1/1) ... [2022-11-03 01:36:44,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44" (1/1) ... [2022-11-03 01:36:44,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44" (1/1) ... [2022-11-03 01:36:44,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44" (1/1) ... [2022-11-03 01:36:44,517 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44" (1/1) ... [2022-11-03 01:36:44,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44" (1/1) ... [2022-11-03 01:36:44,533 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44" (1/1) ... [2022-11-03 01:36:44,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44" (1/1) ... [2022-11-03 01:36:44,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:36:44,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:36:44,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:36:44,547 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:36:44,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44" (1/1) ... [2022-11-03 01:36:44,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:36:44,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:36:44,586 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:36:44,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:36:44,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-03 01:36:44,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-03 01:36:44,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 01:36:44,630 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-03 01:36:44,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 01:36:44,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 01:36:44,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-03 01:36:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 01:36:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2022-11-03 01:36:44,632 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2022-11-03 01:36:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-03 01:36:44,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-03 01:36:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 01:36:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:36:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2022-11-03 01:36:44,636 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2022-11-03 01:36:44,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 01:36:44,637 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2022-11-03 01:36:44,637 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2022-11-03 01:36:44,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:36:44,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:36:44,944 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:36:44,946 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:36:50,125 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:36:50,150 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:36:50,151 INFO L300 CfgBuilder]: Removed 63 assume(true) statements. [2022-11-03 01:36:50,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:36:50 BoogieIcfgContainer [2022-11-03 01:36:50,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:36:50,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:36:50,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:36:50,163 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:36:50,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:36:42" (1/3) ... [2022-11-03 01:36:50,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5bdf5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:36:50, skipping insertion in model container [2022-11-03 01:36:50,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:36:44" (2/3) ... [2022-11-03 01:36:50,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5bdf5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:36:50, skipping insertion in model container [2022-11-03 01:36:50,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:36:50" (3/3) ... [2022-11-03 01:36:50,167 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test6-1.i [2022-11-03 01:36:50,186 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:36:50,186 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 531 error locations. [2022-11-03 01:36:50,292 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:36:50,299 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;@3d0e7d11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:36:50,299 INFO L358 AbstractCegarLoop]: Starting to check reachability of 531 error locations. [2022-11-03 01:36:50,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 1083 states, 534 states have (on average 2.2284644194756553) internal successors, (1190), 1065 states have internal predecessors, (1190), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-03 01:36:50,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 01:36:50,316 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:50,316 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 01:36:50,317 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:36:50,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:50,324 INFO L85 PathProgramCache]: Analyzing trace with hash 77521, now seen corresponding path program 1 times [2022-11-03 01:36:50,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:36:50,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814505502] [2022-11-03 01:36:50,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:50,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:36:50,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:36:50,346 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:36:50,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 01:36:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:50,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:36:50,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:36:50,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 01:36:50,649 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-03 01:36:50,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:36:50,650 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:36:50,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814505502] [2022-11-03 01:36:50,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814505502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:50,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:36:50,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:36:50,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440665940] [2022-11-03 01:36:50,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:50,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:36:50,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:36:50,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:36:50,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:36:50,729 INFO L87 Difference]: Start difference. First operand has 1083 states, 534 states have (on average 2.2284644194756553) internal successors, (1190), 1065 states have internal predecessors, (1190), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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-03 01:36:53,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:36:53,038 INFO L93 Difference]: Finished difference Result 1162 states and 1229 transitions. [2022-11-03 01:36:53,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:36:53,041 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-03 01:36:53,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:36:53,059 INFO L225 Difference]: With dead ends: 1162 [2022-11-03 01:36:53,059 INFO L226 Difference]: Without dead ends: 1160 [2022-11-03 01:36:53,061 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-03 01:36:53,064 INFO L413 NwaCegarLoop]: 798 mSDtfsCounter, 714 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:36:53,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1044 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-03 01:36:53,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2022-11-03 01:36:53,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1103. [2022-11-03 01:36:53,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 568 states have (on average 2.084507042253521) internal successors, (1184), 1086 states have internal predecessors, (1184), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-03 01:36:53,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1210 transitions. [2022-11-03 01:36:53,152 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1210 transitions. Word has length 3 [2022-11-03 01:36:53,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:36:53,152 INFO L495 AbstractCegarLoop]: Abstraction has 1103 states and 1210 transitions. [2022-11-03 01:36:53,153 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-03 01:36:53,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1210 transitions. [2022-11-03 01:36:53,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 01:36:53,153 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:53,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 01:36:53,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-03 01:36:53,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:36:53,366 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:36:53,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:53,366 INFO L85 PathProgramCache]: Analyzing trace with hash 77522, now seen corresponding path program 1 times [2022-11-03 01:36:53,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:36:53,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009582926] [2022-11-03 01:36:53,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:53,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:36:53,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:36:53,369 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:36:53,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 01:36:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:53,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 01:36:53,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:36:53,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:36:53,529 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-03 01:36:53,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:36:53,530 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:36:53,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009582926] [2022-11-03 01:36:53,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009582926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:53,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:36:53,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:36:53,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425726168] [2022-11-03 01:36:53,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:53,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:36:53,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:36:53,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:36:53,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:36:53,533 INFO L87 Difference]: Start difference. First operand 1103 states and 1210 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-03 01:36:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:36:56,986 INFO L93 Difference]: Finished difference Result 1497 states and 1638 transitions. [2022-11-03 01:36:56,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:36:56,987 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-03 01:36:56,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:36:56,992 INFO L225 Difference]: With dead ends: 1497 [2022-11-03 01:36:56,993 INFO L226 Difference]: Without dead ends: 1497 [2022-11-03 01:36:56,993 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-03 01:36:56,994 INFO L413 NwaCegarLoop]: 943 mSDtfsCounter, 418 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:36:56,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1538 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-11-03 01:36:56,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2022-11-03 01:36:57,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1307. [2022-11-03 01:36:57,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1307 states, 771 states have (on average 2.0700389105058368) internal successors, (1596), 1288 states have internal predecessors, (1596), 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-03 01:36:57,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1626 transitions. [2022-11-03 01:36:57,054 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1626 transitions. Word has length 3 [2022-11-03 01:36:57,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:36:57,058 INFO L495 AbstractCegarLoop]: Abstraction has 1307 states and 1626 transitions. [2022-11-03 01:36:57,059 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-03 01:36:57,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1626 transitions. [2022-11-03 01:36:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 01:36:57,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:36:57,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:36:57,076 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-03 01:36:57,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:36:57,276 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:36:57,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:36:57,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1111693489, now seen corresponding path program 1 times [2022-11-03 01:36:57,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:36:57,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718338256] [2022-11-03 01:36:57,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:36:57,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:36:57,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:36:57,284 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:36:57,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 01:36:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:36:57,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 01:36:57,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:36:57,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 01:36:57,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:36:57,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:57,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:36:57,581 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:36:57,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 01:36:57,617 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-03 01:36:57,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:36:57,618 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:36:57,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718338256] [2022-11-03 01:36:57,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718338256] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:36:57,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:36:57,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:36:57,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867479322] [2022-11-03 01:36:57,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:36:57,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:36:57,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:36:57,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:36:57,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:36:57,620 INFO L87 Difference]: Start difference. First operand 1307 states and 1626 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-03 01:37:03,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:03,289 INFO L93 Difference]: Finished difference Result 1997 states and 2371 transitions. [2022-11-03 01:37:03,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:37:03,292 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-03 01:37:03,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:03,299 INFO L225 Difference]: With dead ends: 1997 [2022-11-03 01:37:03,299 INFO L226 Difference]: Without dead ends: 1997 [2022-11-03 01:37:03,300 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-03 01:37:03,301 INFO L413 NwaCegarLoop]: 655 mSDtfsCounter, 719 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:03,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1587 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-11-03 01:37:03,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2022-11-03 01:37:03,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1452. [2022-11-03 01:37:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 916 states have (on average 2.0513100436681224) internal successors, (1879), 1433 states have internal predecessors, (1879), 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-03 01:37:03,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1909 transitions. [2022-11-03 01:37:03,338 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1909 transitions. Word has length 8 [2022-11-03 01:37:03,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:03,339 INFO L495 AbstractCegarLoop]: Abstraction has 1452 states and 1909 transitions. [2022-11-03 01:37:03,339 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-03 01:37:03,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1909 transitions. [2022-11-03 01:37:03,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 01:37:03,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:03,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:37:03,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-03 01:37:03,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:37:03,553 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:37:03,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:03,554 INFO L85 PathProgramCache]: Analyzing trace with hash -102759776, now seen corresponding path program 1 times [2022-11-03 01:37:03,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:37:03,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224486579] [2022-11-03 01:37:03,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:03,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:37:03,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:37:03,558 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:37:03,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-03 01:37:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:03,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 01:37:03,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:03,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 01:37:03,748 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-03 01:37:03,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:37:03,750 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:37:03,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1224486579] [2022-11-03 01:37:03,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1224486579] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:37:03,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:37:03,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:37:03,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707460150] [2022-11-03 01:37:03,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:37:03,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:37:03,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:37:03,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:37:03,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:37:03,760 INFO L87 Difference]: Start difference. First operand 1452 states and 1909 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-03 01:37:07,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:07,544 INFO L93 Difference]: Finished difference Result 2430 states and 3107 transitions. [2022-11-03 01:37:07,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:37:07,545 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-03 01:37:07,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:07,553 INFO L225 Difference]: With dead ends: 2430 [2022-11-03 01:37:07,553 INFO L226 Difference]: Without dead ends: 2430 [2022-11-03 01:37:07,554 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-03 01:37:07,555 INFO L413 NwaCegarLoop]: 1014 mSDtfsCounter, 2141 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2147 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:07,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2147 Valid, 1973 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-11-03 01:37:07,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2022-11-03 01:37:07,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 1407. [2022-11-03 01:37:07,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 916 states have (on average 1.9868995633187774) internal successors, (1820), 1388 states have internal predecessors, (1820), 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-03 01:37:07,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1850 transitions. [2022-11-03 01:37:07,593 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1850 transitions. Word has length 9 [2022-11-03 01:37:07,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:07,594 INFO L495 AbstractCegarLoop]: Abstraction has 1407 states and 1850 transitions. [2022-11-03 01:37:07,594 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-03 01:37:07,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1850 transitions. [2022-11-03 01:37:07,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 01:37:07,595 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:07,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:37:07,607 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-11-03 01:37:07,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:37:07,807 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:37:07,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:07,807 INFO L85 PathProgramCache]: Analyzing trace with hash -102759775, now seen corresponding path program 1 times [2022-11-03 01:37:07,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:37:07,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625004020] [2022-11-03 01:37:07,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:07,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:37:07,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:37:07,810 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:37:07,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-03 01:37:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:07,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 01:37:07,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:07,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:37:08,045 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-03 01:37:08,045 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:37:08,046 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:37:08,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625004020] [2022-11-03 01:37:08,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625004020] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:37:08,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:37:08,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:37:08,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331219546] [2022-11-03 01:37:08,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:37:08,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:37:08,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:37:08,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:37:08,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:37:08,048 INFO L87 Difference]: Start difference. First operand 1407 states and 1850 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-03 01:37:12,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:12,250 INFO L93 Difference]: Finished difference Result 2046 states and 2685 transitions. [2022-11-03 01:37:12,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:37:12,251 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-03 01:37:12,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:12,258 INFO L225 Difference]: With dead ends: 2046 [2022-11-03 01:37:12,259 INFO L226 Difference]: Without dead ends: 2046 [2022-11-03 01:37:12,259 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-03 01:37:12,260 INFO L413 NwaCegarLoop]: 1193 mSDtfsCounter, 1375 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 2096 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:12,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 2096 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-11-03 01:37:12,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2022-11-03 01:37:12,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1397. [2022-11-03 01:37:12,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 916 states have (on average 1.960698689956332) internal successors, (1796), 1378 states have internal predecessors, (1796), 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-03 01:37:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 1826 transitions. [2022-11-03 01:37:12,295 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 1826 transitions. Word has length 9 [2022-11-03 01:37:12,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:12,295 INFO L495 AbstractCegarLoop]: Abstraction has 1397 states and 1826 transitions. [2022-11-03 01:37:12,295 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-03 01:37:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1826 transitions. [2022-11-03 01:37:12,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:37:12,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:12,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:37:12,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-03 01:37:12,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:37:12,509 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr516ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:37:12,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:12,509 INFO L85 PathProgramCache]: Analyzing trace with hash -856298529, now seen corresponding path program 1 times [2022-11-03 01:37:12,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:37:12,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864796686] [2022-11-03 01:37:12,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:12,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:37:12,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:37:12,511 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:37:12,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-03 01:37:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:12,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 01:37:12,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:12,747 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-03 01:37:12,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:37:12,748 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:37:12,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864796686] [2022-11-03 01:37:12,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864796686] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:37:12,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:37:12,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:37:12,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602616717] [2022-11-03 01:37:12,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:37:12,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:37:12,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:37:12,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:37:12,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:37:12,750 INFO L87 Difference]: Start difference. First operand 1397 states and 1826 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-03 01:37:13,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:13,623 INFO L93 Difference]: Finished difference Result 1873 states and 2393 transitions. [2022-11-03 01:37:13,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:37:13,624 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-03 01:37:13,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:13,630 INFO L225 Difference]: With dead ends: 1873 [2022-11-03 01:37:13,630 INFO L226 Difference]: Without dead ends: 1873 [2022-11-03 01:37:13,631 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-03 01:37:13,631 INFO L413 NwaCegarLoop]: 1156 mSDtfsCounter, 546 mSDsluCounter, 1966 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 3122 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:13,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 3122 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-03 01:37:13,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2022-11-03 01:37:13,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1648. [2022-11-03 01:37:13,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1167 states have (on average 1.974293059125964) internal successors, (2304), 1629 states have internal predecessors, (2304), 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-03 01:37:13,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2334 transitions. [2022-11-03 01:37:13,674 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2334 transitions. Word has length 11 [2022-11-03 01:37:13,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:13,674 INFO L495 AbstractCegarLoop]: Abstraction has 1648 states and 2334 transitions. [2022-11-03 01:37:13,674 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-03 01:37:13,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2334 transitions. [2022-11-03 01:37:13,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:37:13,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:13,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:37:13,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-03 01:37:13,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:37:13,888 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:37:13,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:13,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2117571646, now seen corresponding path program 1 times [2022-11-03 01:37:13,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:37:13,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925884937] [2022-11-03 01:37:13,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:13,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:37:13,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:37:13,890 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:37:13,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-03 01:37:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:14,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 01:37:14,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:14,101 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:37:14,101 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:37:14,102 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:37:14,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2022-11-03 01:37:14,175 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:37:14,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2022-11-03 01:37:14,196 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-03 01:37:14,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:37:14,196 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:37:14,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925884937] [2022-11-03 01:37:14,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925884937] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:37:14,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:37:14,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:37:14,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993116316] [2022-11-03 01:37:14,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:37:14,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:37:14,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:37:14,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:37:14,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:37:14,199 INFO L87 Difference]: Start difference. First operand 1648 states and 2334 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-03 01:37:15,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:15,879 INFO L93 Difference]: Finished difference Result 1654 states and 2037 transitions. [2022-11-03 01:37:15,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:37:15,881 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-03 01:37:15,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:15,886 INFO L225 Difference]: With dead ends: 1654 [2022-11-03 01:37:15,886 INFO L226 Difference]: Without dead ends: 1654 [2022-11-03 01:37:15,886 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-03 01:37:15,887 INFO L413 NwaCegarLoop]: 1040 mSDtfsCounter, 357 mSDsluCounter, 1937 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 2977 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:15,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 2977 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-03 01:37:15,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2022-11-03 01:37:15,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1290. [2022-11-03 01:37:15,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 811 states have (on average 1.9506781750924784) internal successors, (1582), 1273 states have internal predecessors, (1582), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-03 01:37:15,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1608 transitions. [2022-11-03 01:37:15,915 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1608 transitions. Word has length 14 [2022-11-03 01:37:15,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:15,916 INFO L495 AbstractCegarLoop]: Abstraction has 1290 states and 1608 transitions. [2022-11-03 01:37:15,916 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-03 01:37:15,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1608 transitions. [2022-11-03 01:37:15,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 01:37:15,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:15,917 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-03 01:37:15,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-03 01:37:16,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:37:16,130 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:37:16,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:16,130 INFO L85 PathProgramCache]: Analyzing trace with hash 769788685, now seen corresponding path program 1 times [2022-11-03 01:37:16,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:37:16,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670384546] [2022-11-03 01:37:16,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:16,131 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:37:16,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:37:16,132 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:37:16,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-03 01:37:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:16,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 01:37:16,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:16,347 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-03 01:37:16,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:37:16,348 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:37:16,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670384546] [2022-11-03 01:37:16,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1670384546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:37:16,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:37:16,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:37:16,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742216641] [2022-11-03 01:37:16,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:37:16,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:37:16,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:37:16,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:37:16,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:37:16,351 INFO L87 Difference]: Start difference. First operand 1290 states and 1608 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-03 01:37:16,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:16,382 INFO L93 Difference]: Finished difference Result 1230 states and 1522 transitions. [2022-11-03 01:37:16,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:37:16,383 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-03 01:37:16,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:16,386 INFO L225 Difference]: With dead ends: 1230 [2022-11-03 01:37:16,387 INFO L226 Difference]: Without dead ends: 1230 [2022-11-03 01:37:16,387 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-03 01:37:16,388 INFO L413 NwaCegarLoop]: 1029 mSDtfsCounter, 959 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 1096 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-03 01:37:16,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 1096 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:37:16,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2022-11-03 01:37:16,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2022-11-03 01:37:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 775 states have (on average 1.9303225806451614) internal successors, (1496), 1213 states have internal predecessors, (1496), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-03 01:37:16,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1522 transitions. [2022-11-03 01:37:16,416 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1522 transitions. Word has length 19 [2022-11-03 01:37:16,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:16,417 INFO L495 AbstractCegarLoop]: Abstraction has 1230 states and 1522 transitions. [2022-11-03 01:37:16,417 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-03 01:37:16,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1522 transitions. [2022-11-03 01:37:16,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 01:37:16,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:16,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:37:16,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-03 01:37:16,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:37:16,646 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:37:16,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:16,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1032548102, now seen corresponding path program 1 times [2022-11-03 01:37:16,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:37:16,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738027230] [2022-11-03 01:37:16,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:16,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:37:16,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:37:16,648 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:37:16,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-03 01:37:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:16,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:37:16,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:16,892 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-03 01:37:16,893 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:37:16,893 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:37:16,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738027230] [2022-11-03 01:37:16,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1738027230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:37:16,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:37:16,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:37:16,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898942964] [2022-11-03 01:37:16,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:37:16,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:37:16,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:37:16,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:37:16,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:37:16,896 INFO L87 Difference]: Start difference. First operand 1230 states and 1522 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-03 01:37:16,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:16,978 INFO L93 Difference]: Finished difference Result 1202 states and 1466 transitions. [2022-11-03 01:37:16,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:37:16,979 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-03 01:37:16,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:16,983 INFO L225 Difference]: With dead ends: 1202 [2022-11-03 01:37:16,983 INFO L226 Difference]: Without dead ends: 1202 [2022-11-03 01:37:16,983 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-03 01:37:16,983 INFO L413 NwaCegarLoop]: 984 mSDtfsCounter, 930 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 2028 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:16,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 2028 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:37:16,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2022-11-03 01:37:17,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1200. [2022-11-03 01:37:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 759 states have (on average 1.8945981554677207) internal successors, (1438), 1183 states have internal predecessors, (1438), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-03 01:37:17,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1464 transitions. [2022-11-03 01:37:17,006 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1464 transitions. Word has length 21 [2022-11-03 01:37:17,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:17,007 INFO L495 AbstractCegarLoop]: Abstraction has 1200 states and 1464 transitions. [2022-11-03 01:37:17,007 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-03 01:37:17,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1464 transitions. [2022-11-03 01:37:17,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 01:37:17,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:17,008 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-03 01:37:17,021 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-03 01:37:17,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:37:17,221 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:37:17,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:17,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308372, now seen corresponding path program 1 times [2022-11-03 01:37:17,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:37:17,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834156821] [2022-11-03 01:37:17,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:17,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:37:17,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:37:17,224 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:37:17,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-03 01:37:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:17,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 01:37:17,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:17,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 01:37:17,559 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-03 01:37:17,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:37:17,559 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:37:17,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834156821] [2022-11-03 01:37:17,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834156821] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:37:17,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:37:17,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:37:17,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776386071] [2022-11-03 01:37:17,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:37:17,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:37:17,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:37:17,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:37:17,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:37:17,562 INFO L87 Difference]: Start difference. First operand 1200 states and 1464 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-03 01:37:21,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:21,721 INFO L93 Difference]: Finished difference Result 2184 states and 2665 transitions. [2022-11-03 01:37:21,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:37:21,723 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-03 01:37:21,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:21,729 INFO L225 Difference]: With dead ends: 2184 [2022-11-03 01:37:21,729 INFO L226 Difference]: Without dead ends: 2184 [2022-11-03 01:37:21,729 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-03 01:37:21,730 INFO L413 NwaCegarLoop]: 841 mSDtfsCounter, 2037 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2040 SdHoareTripleChecker+Valid, 2019 SdHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:21,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2040 Valid, 2019 Invalid, 1860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1841 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-11-03 01:37:21,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2022-11-03 01:37:21,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 1196. [2022-11-03 01:37:21,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 759 states have (on average 1.8840579710144927) internal successors, (1430), 1179 states have internal predecessors, (1430), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-03 01:37:21,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1456 transitions. [2022-11-03 01:37:21,755 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1456 transitions. Word has length 35 [2022-11-03 01:37:21,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:21,756 INFO L495 AbstractCegarLoop]: Abstraction has 1196 states and 1456 transitions. [2022-11-03 01:37:21,756 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-03 01:37:21,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1456 transitions. [2022-11-03 01:37:21,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 01:37:21,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:21,757 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-03 01:37:21,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-03 01:37:21,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:37:21,972 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:37:21,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:21,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308373, now seen corresponding path program 1 times [2022-11-03 01:37:21,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:37:21,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258544388] [2022-11-03 01:37:21,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:21,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:37:21,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:37:21,974 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:37:21,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-03 01:37:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:22,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 01:37:22,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:22,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:37:22,438 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-03 01:37:22,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:37:22,438 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:37:22,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258544388] [2022-11-03 01:37:22,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [258544388] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:37:22,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:37:22,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:37:22,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980048031] [2022-11-03 01:37:22,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:37:22,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:37:22,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:37:22,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:37:22,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:37:22,440 INFO L87 Difference]: Start difference. First operand 1196 states and 1456 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-03 01:37:27,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:27,259 INFO L93 Difference]: Finished difference Result 1806 states and 2219 transitions. [2022-11-03 01:37:27,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:37:27,260 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-03 01:37:27,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:27,265 INFO L225 Difference]: With dead ends: 1806 [2022-11-03 01:37:27,265 INFO L226 Difference]: Without dead ends: 1806 [2022-11-03 01:37:27,265 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-03 01:37:27,266 INFO L413 NwaCegarLoop]: 1234 mSDtfsCounter, 1782 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1782 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:27,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1782 Valid, 2595 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-11-03 01:37:27,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2022-11-03 01:37:27,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1192. [2022-11-03 01:37:27,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 759 states have (on average 1.8735177865612649) internal successors, (1422), 1175 states have internal predecessors, (1422), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-03 01:37:27,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1448 transitions. [2022-11-03 01:37:27,288 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1448 transitions. Word has length 35 [2022-11-03 01:37:27,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:27,289 INFO L495 AbstractCegarLoop]: Abstraction has 1192 states and 1448 transitions. [2022-11-03 01:37:27,289 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-03 01:37:27,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1448 transitions. [2022-11-03 01:37:27,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-03 01:37:27,290 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:27,290 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-03 01:37:27,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-03 01:37:27,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:37:27,503 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:37:27,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:27,504 INFO L85 PathProgramCache]: Analyzing trace with hash -2063927218, now seen corresponding path program 1 times [2022-11-03 01:37:27,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:37:27,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60753318] [2022-11-03 01:37:27,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:27,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:37:27,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:37:27,506 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:37:27,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-03 01:37:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:27,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:37:27,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:27,857 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-03 01:37:27,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:37:27,858 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:37:27,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60753318] [2022-11-03 01:37:27,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60753318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:37:27,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:37:27,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:37:27,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118076746] [2022-11-03 01:37:27,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:37:27,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:37:27,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:37:27,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:37:27,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:37:27,860 INFO L87 Difference]: Start difference. First operand 1192 states and 1448 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-03 01:37:27,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:27,926 INFO L93 Difference]: Finished difference Result 1180 states and 1428 transitions. [2022-11-03 01:37:27,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:37:27,927 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-03 01:37:27,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:27,931 INFO L225 Difference]: With dead ends: 1180 [2022-11-03 01:37:27,931 INFO L226 Difference]: Without dead ends: 1180 [2022-11-03 01:37:27,931 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-03 01:37:27,932 INFO L413 NwaCegarLoop]: 978 mSDtfsCounter, 906 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:27,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 2006 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:37:27,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2022-11-03 01:37:27,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1180. [2022-11-03 01:37:27,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 747 states have (on average 1.8768406961178046) internal successors, (1402), 1163 states have internal predecessors, (1402), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-03 01:37:27,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1428 transitions. [2022-11-03 01:37:27,951 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1428 transitions. Word has length 54 [2022-11-03 01:37:27,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:27,951 INFO L495 AbstractCegarLoop]: Abstraction has 1180 states and 1428 transitions. [2022-11-03 01:37:27,951 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-03 01:37:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1428 transitions. [2022-11-03 01:37:27,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-03 01:37:27,952 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:27,953 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-03 01:37:27,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-11-03 01:37:28,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:37:28,165 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:37:28,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:28,166 INFO L85 PathProgramCache]: Analyzing trace with hash -203140862, now seen corresponding path program 1 times [2022-11-03 01:37:28,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:37:28,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477602504] [2022-11-03 01:37:28,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:28,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:37:28,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:37:28,168 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:37:28,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-03 01:37:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:28,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 01:37:28,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:28,700 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 01:37:28,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:37:28,771 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 01:37:28,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:37:29,251 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-03 01:37:29,251 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:37:29,251 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:37:29,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477602504] [2022-11-03 01:37:29,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477602504] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:37:29,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:37:29,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:37:29,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219047616] [2022-11-03 01:37:29,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:37:29,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:37:29,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:37:29,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:37:29,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:37:29,254 INFO L87 Difference]: Start difference. First operand 1180 states and 1428 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-03 01:37:33,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:33,820 INFO L93 Difference]: Finished difference Result 2641 states and 3168 transitions. [2022-11-03 01:37:33,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:37:33,820 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-03 01:37:33,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:33,826 INFO L225 Difference]: With dead ends: 2641 [2022-11-03 01:37:33,826 INFO L226 Difference]: Without dead ends: 2641 [2022-11-03 01:37:33,826 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-03 01:37:33,827 INFO L413 NwaCegarLoop]: 883 mSDtfsCounter, 1427 mSDsluCounter, 2133 mSDsCounter, 0 mSdLazyCounter, 1541 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 3016 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 450 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:33,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1427 Valid, 3016 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1541 Invalid, 0 Unknown, 450 Unchecked, 4.4s Time] [2022-11-03 01:37:33,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2022-11-03 01:37:33,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 1617. [2022-11-03 01:37:33,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1169 states have (on average 1.872540633019675) internal successors, (2189), 1588 states have internal predecessors, (2189), 25 states have call successors, (25), 8 states have call predecessors, (25), 7 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-03 01:37:33,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2239 transitions. [2022-11-03 01:37:33,858 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2239 transitions. Word has length 62 [2022-11-03 01:37:33,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:33,858 INFO L495 AbstractCegarLoop]: Abstraction has 1617 states and 2239 transitions. [2022-11-03 01:37:33,859 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-03 01:37:33,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2239 transitions. [2022-11-03 01:37:33,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-03 01:37:33,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:33,860 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-03 01:37:33,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-03 01:37:34,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:37:34,076 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:37:34,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:34,077 INFO L85 PathProgramCache]: Analyzing trace with hash -203140861, now seen corresponding path program 1 times [2022-11-03 01:37:34,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:37:34,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636583126] [2022-11-03 01:37:34,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:34,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:37:34,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:37:34,079 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:37:34,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-03 01:37:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:34,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-03 01:37:34,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:34,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:34,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:37:34,712 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:37:34,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:37:35,461 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-03 01:37:35,461 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:37:35,461 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:37:35,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636583126] [2022-11-03 01:37:35,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636583126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:37:35,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:37:35,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:37:35,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152692465] [2022-11-03 01:37:35,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:37:35,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:37:35,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:37:35,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:37:35,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:37:35,463 INFO L87 Difference]: Start difference. First operand 1617 states and 2239 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-03 01:37:40,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:40,900 INFO L93 Difference]: Finished difference Result 1623 states and 2246 transitions. [2022-11-03 01:37:40,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:37:40,901 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-03 01:37:40,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:40,907 INFO L225 Difference]: With dead ends: 1623 [2022-11-03 01:37:40,907 INFO L226 Difference]: Without dead ends: 1623 [2022-11-03 01:37:40,907 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-03 01:37:40,908 INFO L413 NwaCegarLoop]: 960 mSDtfsCounter, 111 mSDsluCounter, 1835 mSDsCounter, 0 mSdLazyCounter, 2104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 2795 SdHoareTripleChecker+Invalid, 2108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:40,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 2795 Invalid, 2108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2104 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-11-03 01:37:40,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2022-11-03 01:37:40,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1622. [2022-11-03 01:37:40,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1173 states have (on average 1.8695652173913044) internal successors, (2193), 1592 states have internal predecessors, (2193), 26 states have call successors, (26), 9 states have call predecessors, (26), 7 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-03 01:37:40,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2245 transitions. [2022-11-03 01:37:40,935 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2245 transitions. Word has length 62 [2022-11-03 01:37:40,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:40,936 INFO L495 AbstractCegarLoop]: Abstraction has 1622 states and 2245 transitions. [2022-11-03 01:37:40,936 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-03 01:37:40,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2245 transitions. [2022-11-03 01:37:40,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-03 01:37:40,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:40,937 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-03 01:37:40,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-03 01:37:41,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:37:41,155 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:37:41,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:41,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1864793253, now seen corresponding path program 1 times [2022-11-03 01:37:41,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:37:41,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389228855] [2022-11-03 01:37:41,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:41,156 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:37:41,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:37:41,157 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:37:41,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-03 01:37:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:41,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 01:37:41,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:41,588 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-03 01:37:41,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:37:41,588 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:37:41,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389228855] [2022-11-03 01:37:41,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389228855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:37:41,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:37:41,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:37:41,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239686714] [2022-11-03 01:37:41,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:37:41,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:37:41,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:37:41,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:37:41,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:37:41,590 INFO L87 Difference]: Start difference. First operand 1622 states and 2245 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-03 01:37:41,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:41,704 INFO L93 Difference]: Finished difference Result 1648 states and 2272 transitions. [2022-11-03 01:37:41,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:37:41,705 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-03 01:37:41,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:41,710 INFO L225 Difference]: With dead ends: 1648 [2022-11-03 01:37:41,711 INFO L226 Difference]: Without dead ends: 1648 [2022-11-03 01:37:41,711 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-03 01:37:41,711 INFO L413 NwaCegarLoop]: 975 mSDtfsCounter, 19 mSDsluCounter, 3890 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4865 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-03 01:37:41,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4865 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:37:41,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2022-11-03 01:37:41,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1646. [2022-11-03 01:37:41,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1646 states, 1191 states have (on average 1.8606213266162888) internal successors, (2216), 1612 states have internal predecessors, (2216), 28 states have call successors, (28), 13 states have call predecessors, (28), 11 states have return successors, (28), 24 states have call predecessors, (28), 28 states have call successors, (28) [2022-11-03 01:37:41,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2272 transitions. [2022-11-03 01:37:41,746 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2272 transitions. Word has length 68 [2022-11-03 01:37:41,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:41,747 INFO L495 AbstractCegarLoop]: Abstraction has 1646 states and 2272 transitions. [2022-11-03 01:37:41,747 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-03 01:37:41,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2272 transitions. [2022-11-03 01:37:41,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-03 01:37:41,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:41,748 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-03 01:37:41,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-11-03 01:37:41,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:37:41,965 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:37:41,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:41,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1913615011, now seen corresponding path program 1 times [2022-11-03 01:37:41,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:37:41,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1179631861] [2022-11-03 01:37:41,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:41,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:37:41,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:37:41,967 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:37:41,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-03 01:37:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:42,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 01:37:42,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:42,508 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-03 01:37:42,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:37:42,508 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:37:42,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1179631861] [2022-11-03 01:37:42,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1179631861] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:37:42,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:37:42,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:37:42,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538619365] [2022-11-03 01:37:42,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:37:42,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:37:42,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:37:42,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:37:42,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:37:42,510 INFO L87 Difference]: Start difference. First operand 1646 states and 2272 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-03 01:37:42,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:42,722 INFO L93 Difference]: Finished difference Result 1658 states and 2286 transitions. [2022-11-03 01:37:42,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:37:42,723 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-03 01:37:42,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:42,729 INFO L225 Difference]: With dead ends: 1658 [2022-11-03 01:37:42,729 INFO L226 Difference]: Without dead ends: 1658 [2022-11-03 01:37:42,729 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-03 01:37:42,730 INFO L413 NwaCegarLoop]: 975 mSDtfsCounter, 23 mSDsluCounter, 2824 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3799 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:42,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3799 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:37:42,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2022-11-03 01:37:42,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1649. [2022-11-03 01:37:42,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1193 states have (on average 1.859178541492037) internal successors, (2218), 1614 states have internal predecessors, (2218), 28 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2022-11-03 01:37:42,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2275 transitions. [2022-11-03 01:37:42,772 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2275 transitions. Word has length 68 [2022-11-03 01:37:42,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:42,773 INFO L495 AbstractCegarLoop]: Abstraction has 1649 states and 2275 transitions. [2022-11-03 01:37:42,773 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-03 01:37:42,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2275 transitions. [2022-11-03 01:37:42,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-03 01:37:42,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:42,774 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-03 01:37:42,800 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-03 01:37:43,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:37:43,000 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:37:43,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:43,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1847999061, now seen corresponding path program 1 times [2022-11-03 01:37:43,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:37:43,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839055300] [2022-11-03 01:37:43,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:43,001 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:37:43,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:37:43,002 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:37:43,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-03 01:37:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:43,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 01:37:43,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:43,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 01:37:43,716 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 01:37:43,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:37:43,727 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-03 01:37:43,728 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:37:43,728 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:37:43,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1839055300] [2022-11-03 01:37:43,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1839055300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:37:43,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:37:43,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:37:43,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753112380] [2022-11-03 01:37:43,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:37:43,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:37:43,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:37:43,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:37:43,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:37:43,730 INFO L87 Difference]: Start difference. First operand 1649 states and 2275 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-03 01:37:48,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:48,243 INFO L93 Difference]: Finished difference Result 2771 states and 3753 transitions. [2022-11-03 01:37:48,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:37:48,243 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-03 01:37:48,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:48,261 INFO L225 Difference]: With dead ends: 2771 [2022-11-03 01:37:48,262 INFO L226 Difference]: Without dead ends: 2771 [2022-11-03 01:37:48,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:37:48,263 INFO L413 NwaCegarLoop]: 807 mSDtfsCounter, 1430 mSDsluCounter, 2180 mSDsCounter, 0 mSdLazyCounter, 2110 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 2987 SdHoareTripleChecker+Invalid, 3053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 924 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:48,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1436 Valid, 2987 Invalid, 3053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2110 Invalid, 0 Unknown, 924 Unchecked, 4.4s Time] [2022-11-03 01:37:48,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2771 states. [2022-11-03 01:37:48,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2771 to 1648. [2022-11-03 01:37:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1193 states have (on average 1.8575020955574182) internal successors, (2216), 1613 states have internal predecessors, (2216), 28 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2022-11-03 01:37:48,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2273 transitions. [2022-11-03 01:37:48,329 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2273 transitions. Word has length 73 [2022-11-03 01:37:48,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:48,330 INFO L495 AbstractCegarLoop]: Abstraction has 1648 states and 2273 transitions. [2022-11-03 01:37:48,330 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-03 01:37:48,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2273 transitions. [2022-11-03 01:37:48,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-03 01:37:48,330 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:48,330 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-03 01:37:48,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-03 01:37:48,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:37:48,542 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:37:48,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:48,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1847999062, now seen corresponding path program 1 times [2022-11-03 01:37:48,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:37:48,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075204883] [2022-11-03 01:37:48,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:48,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:37:48,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:37:48,544 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:37:48,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-03 01:37:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:48,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-03 01:37:48,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:48,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 01:37:49,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:37:51,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:51,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:37:51,601 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:37:51,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 01:37:51,636 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-03 01:37:51,636 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:37:51,636 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:37:51,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075204883] [2022-11-03 01:37:51,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2075204883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:37:51,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:37:51,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:37:51,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625346095] [2022-11-03 01:37:51,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:37:51,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:37:51,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:37:51,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:37:51,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=29, Unknown=1, NotChecked=0, Total=42 [2022-11-03 01:37:51,638 INFO L87 Difference]: Start difference. First operand 1648 states and 2273 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-03 01:37:59,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:59,233 INFO L93 Difference]: Finished difference Result 2842 states and 3878 transitions. [2022-11-03 01:37:59,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:37:59,234 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-03 01:37:59,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:59,239 INFO L225 Difference]: With dead ends: 2842 [2022-11-03 01:37:59,239 INFO L226 Difference]: Without dead ends: 2842 [2022-11-03 01:37:59,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=17, Invalid=38, Unknown=1, NotChecked=0, Total=56 [2022-11-03 01:37:59,240 INFO L413 NwaCegarLoop]: 1061 mSDtfsCounter, 2203 mSDsluCounter, 2066 mSDsCounter, 0 mSdLazyCounter, 3073 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2209 SdHoareTripleChecker+Valid, 3127 SdHoareTripleChecker+Invalid, 4166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1063 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:59,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2209 Valid, 3127 Invalid, 4166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3073 Invalid, 0 Unknown, 1063 Unchecked, 7.5s Time] [2022-11-03 01:37:59,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2022-11-03 01:37:59,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 1644. [2022-11-03 01:37:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1644 states, 1197 states have (on average 1.8412698412698412) internal successors, (2204), 1609 states have internal predecessors, (2204), 28 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2022-11-03 01:37:59,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2261 transitions. [2022-11-03 01:37:59,274 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2261 transitions. Word has length 73 [2022-11-03 01:37:59,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:59,274 INFO L495 AbstractCegarLoop]: Abstraction has 1644 states and 2261 transitions. [2022-11-03 01:37:59,274 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-03 01:37:59,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2261 transitions. [2022-11-03 01:37:59,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-03 01:37:59,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:59,275 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-03 01:37:59,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-03 01:37:59,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:37:59,493 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:37:59,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:59,493 INFO L85 PathProgramCache]: Analyzing trace with hash 816968073, now seen corresponding path program 1 times [2022-11-03 01:37:59,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:37:59,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718311956] [2022-11-03 01:37:59,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:59,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:37:59,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:37:59,495 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:37:59,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-03 01:37:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:59,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 01:37:59,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:59,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 01:37:59,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:37:59,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 01:38:00,001 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-03 01:38:00,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:38:00,001 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:38:00,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718311956] [2022-11-03 01:38:00,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718311956] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:38:00,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:38:00,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 01:38:00,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273412659] [2022-11-03 01:38:00,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:38:00,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:38:00,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:38:00,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:38:00,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:38:00,003 INFO L87 Difference]: Start difference. First operand 1644 states and 2261 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-03 01:38:04,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:38:04,812 INFO L93 Difference]: Finished difference Result 1659 states and 2277 transitions. [2022-11-03 01:38:04,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 01:38:04,812 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-03 01:38:04,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:38:04,815 INFO L225 Difference]: With dead ends: 1659 [2022-11-03 01:38:04,815 INFO L226 Difference]: Without dead ends: 1659 [2022-11-03 01:38:04,815 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-03 01:38:04,816 INFO L413 NwaCegarLoop]: 961 mSDtfsCounter, 23 mSDsluCounter, 3121 mSDsCounter, 0 mSdLazyCounter, 2696 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4082 SdHoareTripleChecker+Invalid, 2698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:38:04,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4082 Invalid, 2698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2696 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-11-03 01:38:04,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2022-11-03 01:38:04,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1658. [2022-11-03 01:38:04,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1209 states have (on average 1.836228287841191) internal successors, (2220), 1621 states have internal predecessors, (2220), 28 states have call successors, (28), 15 states have call predecessors, (28), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2022-11-03 01:38:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2277 transitions. [2022-11-03 01:38:04,842 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2277 transitions. Word has length 80 [2022-11-03 01:38:04,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:38:04,842 INFO L495 AbstractCegarLoop]: Abstraction has 1658 states and 2277 transitions. [2022-11-03 01:38:04,842 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-03 01:38:04,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2277 transitions. [2022-11-03 01:38:04,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-03 01:38:04,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:38:04,843 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-03 01:38:04,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-03 01:38:05,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:38:05,060 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:38:05,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:38:05,061 INFO L85 PathProgramCache]: Analyzing trace with hash -443793445, now seen corresponding path program 1 times [2022-11-03 01:38:05,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:38:05,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459087072] [2022-11-03 01:38:05,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:05,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:38:05,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:38:05,062 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:38:05,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-03 01:38:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:05,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-03 01:38:05,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:38:05,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:38:05,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:38:05,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:38:05,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-03 01:38:05,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 01:38:05,711 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-03 01:38:05,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:38:05,711 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:38:05,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459087072] [2022-11-03 01:38:05,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459087072] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:38:05,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:38:05,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 01:38:05,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448647255] [2022-11-03 01:38:05,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:38:05,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 01:38:05,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:38:05,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 01:38:05,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:38:05,714 INFO L87 Difference]: Start difference. First operand 1658 states and 2277 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-03 01:38:12,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:38:12,380 INFO L93 Difference]: Finished difference Result 1658 states and 2275 transitions. [2022-11-03 01:38:12,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 01:38:12,381 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-03 01:38:12,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:38:12,383 INFO L225 Difference]: With dead ends: 1658 [2022-11-03 01:38:12,383 INFO L226 Difference]: Without dead ends: 1658 [2022-11-03 01:38:12,383 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-03 01:38:12,397 INFO L413 NwaCegarLoop]: 956 mSDtfsCounter, 19 mSDsluCounter, 3924 mSDsCounter, 0 mSdLazyCounter, 2866 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4880 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:38:12,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4880 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2866 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-11-03 01:38:12,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2022-11-03 01:38:12,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1658. [2022-11-03 01:38:12,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1209 states have (on average 1.8345740281224152) internal successors, (2218), 1621 states have internal predecessors, (2218), 28 states have call successors, (28), 15 states have call predecessors, (28), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2022-11-03 01:38:12,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2275 transitions. [2022-11-03 01:38:12,426 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2275 transitions. Word has length 81 [2022-11-03 01:38:12,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:38:12,427 INFO L495 AbstractCegarLoop]: Abstraction has 1658 states and 2275 transitions. [2022-11-03 01:38:12,427 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-03 01:38:12,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2275 transitions. [2022-11-03 01:38:12,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-03 01:38:12,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:38:12,428 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-03 01:38:12,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-03 01:38:12,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:38:12,645 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:38:12,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:38:12,646 INFO L85 PathProgramCache]: Analyzing trace with hash 540063607, now seen corresponding path program 1 times [2022-11-03 01:38:12,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:38:12,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088343671] [2022-11-03 01:38:12,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:12,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:38:12,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:38:12,649 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:38:12,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-03 01:38:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:13,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 01:38:13,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:38:13,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:38:13,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:38:13,096 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:38:13,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088343671] [2022-11-03 01:38:13,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088343671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:38:13,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:38:13,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:38:13,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790083602] [2022-11-03 01:38:13,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:38:13,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:38:13,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:38:13,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:38:13,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:38:13,099 INFO L87 Difference]: Start difference. First operand 1658 states and 2275 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-03 01:38:13,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:38:13,179 INFO L93 Difference]: Finished difference Result 1674 states and 2293 transitions. [2022-11-03 01:38:13,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:38:13,180 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-03 01:38:13,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:38:13,182 INFO L225 Difference]: With dead ends: 1674 [2022-11-03 01:38:13,182 INFO L226 Difference]: Without dead ends: 1668 [2022-11-03 01:38:13,182 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-03 01:38:13,183 INFO L413 NwaCegarLoop]: 964 mSDtfsCounter, 13 mSDsluCounter, 1920 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2884 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:38:13,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2884 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:38:13,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2022-11-03 01:38:13,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1668. [2022-11-03 01:38:13,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1217 states have (on average 1.8307313064913722) internal successors, (2228), 1631 states have internal predecessors, (2228), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-03 01:38:13,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2287 transitions. [2022-11-03 01:38:13,209 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 2287 transitions. Word has length 88 [2022-11-03 01:38:13,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:38:13,210 INFO L495 AbstractCegarLoop]: Abstraction has 1668 states and 2287 transitions. [2022-11-03 01:38:13,210 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-03 01:38:13,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2287 transitions. [2022-11-03 01:38:13,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-03 01:38:13,211 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:38:13,211 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-03 01:38:13,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-03 01:38:13,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:38:13,428 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:38:13,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:38:13,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1380796229, now seen corresponding path program 1 times [2022-11-03 01:38:13,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:38:13,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883764635] [2022-11-03 01:38:13,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:13,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:38:13,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:38:13,430 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:38:13,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-03 01:38:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:13,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 01:38:13,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:38:13,953 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-03 01:38:13,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:38:14,136 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-03 01:38:14,137 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:38:14,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883764635] [2022-11-03 01:38:14,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883764635] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:38:14,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [195669330] [2022-11-03 01:38:14,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:14,138 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:38:14,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:38:14,142 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:38:14,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-11-03 01:38:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:14,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 01:38:14,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:38:14,823 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-03 01:38:14,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:38:14,905 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-03 01:38:14,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [195669330] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:38:14,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386194590] [2022-11-03 01:38:14,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:38:14,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:14,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:38:14,913 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:38:14,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-03 01:38:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:38:15,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 01:38:15,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:38:15,331 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-03 01:38:15,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:38:15,407 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-03 01:38:15,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386194590] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:38:15,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 01:38:15,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 10 [2022-11-03 01:38:15,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266300041] [2022-11-03 01:38:15,408 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 01:38:15,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 01:38:15,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:38:15,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 01:38:15,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-03 01:38:15,410 INFO L87 Difference]: Start difference. First operand 1668 states and 2287 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-03 01:38:15,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:38:15,707 INFO L93 Difference]: Finished difference Result 1694 states and 2317 transitions. [2022-11-03 01:38:15,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 01:38:15,710 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-03 01:38:15,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:38:15,713 INFO L225 Difference]: With dead ends: 1694 [2022-11-03 01:38:15,714 INFO L226 Difference]: Without dead ends: 1682 [2022-11-03 01:38:15,714 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-03 01:38:15,715 INFO L413 NwaCegarLoop]: 967 mSDtfsCounter, 50 mSDsluCounter, 3847 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 4814 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:38:15,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 4814 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:38:15,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2022-11-03 01:38:15,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1676. [2022-11-03 01:38:15,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1676 states, 1225 states have (on average 1.826938775510204) internal successors, (2238), 1639 states have internal predecessors, (2238), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-03 01:38:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 2297 transitions. [2022-11-03 01:38:15,739 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 2297 transitions. Word has length 89 [2022-11-03 01:38:15,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:38:15,739 INFO L495 AbstractCegarLoop]: Abstraction has 1676 states and 2297 transitions. [2022-11-03 01:38:15,740 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-03 01:38:15,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2297 transitions. [2022-11-03 01:38:15,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-03 01:38:15,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:38:15,741 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-03 01:38:15,754 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2022-11-03 01:38:15,969 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-11-03 01:38:16,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-03 01:38:16,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:16,356 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:38:16,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:38:16,357 INFO L85 PathProgramCache]: Analyzing trace with hash 180173559, now seen corresponding path program 2 times [2022-11-03 01:38:16,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:38:16,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887066237] [2022-11-03 01:38:16,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 01:38:16,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:38:16,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:38:16,359 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:38:16,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-03 01:38:17,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 01:38:17,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:38:17,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 01:38:17,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:38:17,218 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-03 01:38:17,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:38:17,634 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-03 01:38:17,634 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:38:17,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887066237] [2022-11-03 01:38:17,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887066237] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:38:17,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1455637892] [2022-11-03 01:38:17,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 01:38:17,634 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:38:17,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:38:17,636 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:38:17,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2022-11-03 01:38:19,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 01:38:19,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:38:19,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 01:38:19,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:38:19,963 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-03 01:38:19,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:38:20,093 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-03 01:38:20,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1455637892] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:38:20,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641977636] [2022-11-03 01:38:20,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 01:38:20,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:38:20,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:38:20,099 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:38:20,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-03 01:38:41,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 01:38:41,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:38:41,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-03 01:38:41,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:38:41,639 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:38:41,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 01:38:41,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:38:42,291 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:38:42,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 01:38:42,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-03 01:38:42,421 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-03 01:38:42,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:38:42,584 INFO L356 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-03 01:38:42,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 01:38:42,594 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_2306) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem73#1.base|)) is different from false [2022-11-03 01:38:42,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641977636] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:38:42,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-03 01:38:42,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 14] total 29 [2022-11-03 01:38:42,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896548893] [2022-11-03 01:38:42,597 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-03 01:38:42,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 01:38:42,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:38:42,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 01:38:42,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=756, Unknown=3, NotChecked=56, Total=930 [2022-11-03 01:38:42,599 INFO L87 Difference]: Start difference. First operand 1676 states and 2297 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-03 01:39:00,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:00,278 INFO L93 Difference]: Finished difference Result 2220 states and 2971 transitions. [2022-11-03 01:39:00,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-03 01:39:00,279 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-03 01:39:00,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:00,282 INFO L225 Difference]: With dead ends: 2220 [2022-11-03 01:39:00,282 INFO L226 Difference]: Without dead ends: 2208 [2022-11-03 01:39:00,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 431 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=415, Invalid=2526, Unknown=33, NotChecked=106, Total=3080 [2022-11-03 01:39:00,284 INFO L413 NwaCegarLoop]: 570 mSDtfsCounter, 906 mSDsluCounter, 9636 mSDsCounter, 0 mSdLazyCounter, 8989 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 10206 SdHoareTripleChecker+Invalid, 9758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 8989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 712 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:00,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 10206 Invalid, 9758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 8989 Invalid, 0 Unknown, 712 Unchecked, 16.2s Time] [2022-11-03 01:39:00,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2022-11-03 01:39:00,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 1685. [2022-11-03 01:39:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1685 states, 1235 states have (on average 1.8186234817813764) internal successors, (2246), 1648 states have internal predecessors, (2246), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-03 01:39:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 2305 transitions. [2022-11-03 01:39:00,311 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 2305 transitions. Word has length 92 [2022-11-03 01:39:00,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:00,312 INFO L495 AbstractCegarLoop]: Abstraction has 1685 states and 2305 transitions. [2022-11-03 01:39:00,312 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-03 01:39:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 2305 transitions. [2022-11-03 01:39:00,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-03 01:39:00,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:00,313 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-03 01:39:00,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-03 01:39:00,541 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2022-11-03 01:39:00,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-11-03 01:39:00,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:39:00,927 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:39:00,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:00,928 INFO L85 PathProgramCache]: Analyzing trace with hash -343220154, now seen corresponding path program 1 times [2022-11-03 01:39:00,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:39:00,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459726889] [2022-11-03 01:39:00,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:00,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:39:00,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:39:00,930 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:39:00,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-11-03 01:39:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:01,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 01:39:01,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:39:01,689 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-03 01:39:01,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:39:02,593 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-03 01:39:02,594 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:39:02,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459726889] [2022-11-03 01:39:02,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459726889] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:39:02,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1679512921] [2022-11-03 01:39:02,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:02,595 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:39:02,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:39:02,599 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:39:02,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-11-03 01:39:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:03,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 01:39:03,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:39:03,504 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-03 01:39:03,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:39:03,719 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-03 01:39:03,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1679512921] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:39:03,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403615174] [2022-11-03 01:39:03,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:39:03,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:03,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:39:03,724 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:39:03,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-03 01:39:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:39:04,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 01:39:04,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:39:04,268 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-03 01:39:04,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:39:05,892 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-03 01:39:05,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403615174] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:39:05,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 01:39:05,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2022-11-03 01:39:05,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765498209] [2022-11-03 01:39:05,893 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 01:39:05,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 01:39:05,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:39:05,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 01:39:05,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=1012, Unknown=0, NotChecked=0, Total=1406 [2022-11-03 01:39:05,895 INFO L87 Difference]: Start difference. First operand 1685 states and 2305 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-03 01:39:09,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:39:09,690 INFO L93 Difference]: Finished difference Result 1789 states and 2441 transitions. [2022-11-03 01:39:09,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-03 01:39:09,691 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-03 01:39:09,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:39:09,695 INFO L225 Difference]: With dead ends: 1789 [2022-11-03 01:39:09,695 INFO L226 Difference]: Without dead ends: 1771 [2022-11-03 01:39:09,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1544, Invalid=3286, Unknown=0, NotChecked=0, Total=4830 [2022-11-03 01:39:09,697 INFO L413 NwaCegarLoop]: 982 mSDtfsCounter, 205 mSDsluCounter, 18406 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 19388 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:39:09,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 19388 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-03 01:39:09,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2022-11-03 01:39:09,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1723. [2022-11-03 01:39:09,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1723 states, 1273 states have (on average 1.805184603299293) internal successors, (2298), 1686 states have internal predecessors, (2298), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-03 01:39:09,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2357 transitions. [2022-11-03 01:39:09,740 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2357 transitions. Word has length 97 [2022-11-03 01:39:09,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:39:09,741 INFO L495 AbstractCegarLoop]: Abstraction has 1723 states and 2357 transitions. [2022-11-03 01:39:09,741 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-03 01:39:09,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2357 transitions. [2022-11-03 01:39:09,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-03 01:39:09,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:39:09,742 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-03 01:39:09,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-11-03 01:39:09,987 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-03 01:39:10,165 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2022-11-03 01:39:10,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 01:39:10,360 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:39:10,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:39:10,360 INFO L85 PathProgramCache]: Analyzing trace with hash 744868088, now seen corresponding path program 2 times [2022-11-03 01:39:10,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:39:10,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904198929] [2022-11-03 01:39:10,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 01:39:10,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:39:10,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:39:10,362 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:39:10,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-11-03 01:39:11,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 01:39:11,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:39:11,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-03 01:39:11,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:39:11,926 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-03 01:39:11,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:39:16,355 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-03 01:39:16,355 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:39:16,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904198929] [2022-11-03 01:39:16,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904198929] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:39:16,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1636330833] [2022-11-03 01:39:16,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 01:39:16,356 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:39:16,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:39:16,357 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:39:16,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2022-11-03 01:39:19,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 01:39:19,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:39:19,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-03 01:39:19,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:39:19,254 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-03 01:39:19,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:39:20,750 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-03 01:39:20,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1636330833] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:39:20,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46818088] [2022-11-03 01:39:20,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 01:39:20,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:39:20,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:39:20,751 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:39:20,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-03 01:40:11,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 01:40:11,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:40:11,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-03 01:40:12,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:40:12,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:40:12,546 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:40:12,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 01:40:12,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:40:12,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:40:13,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 01:40:13,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 01:40:16,569 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3598 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_3598))) (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$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_3599)))) is different from true [2022-11-03 01:40:16,620 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:40:16,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 01:40:16,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 01:40:16,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-03 01:40:16,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 01:40:16,985 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 171 trivial. 20 not checked. [2022-11-03 01:40:16,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:40:17,922 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3643 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3642 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3643 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2022-11-03 01:40:17,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46818088] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:40:17,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-03 01:40:17,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 25, 13] total 60 [2022-11-03 01:40:17,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039996794] [2022-11-03 01:40:17,931 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-03 01:40:17,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-03 01:40:17,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:40:17,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-03 01:40:17,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=658, Invalid=3007, Unknown=3, NotChecked=238, Total=3906 [2022-11-03 01:40:17,934 INFO L87 Difference]: Start difference. First operand 1723 states and 2357 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-03 01:41:47,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:41:47,478 INFO L93 Difference]: Finished difference Result 2378 states and 3215 transitions. [2022-11-03 01:41:47,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-11-03 01:41:47,479 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-03 01:41:47,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:41:47,484 INFO L225 Difference]: With dead ends: 2378 [2022-11-03 01:41:47,485 INFO L226 Difference]: Without dead ends: 2360 [2022-11-03 01:41:47,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 460 SyntacticMatches, 21 SemanticMatches, 136 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5669 ImplicationChecksByTransitivity, 37.0s TimeCoverageRelationStatistics Valid=2907, Invalid=15416, Unknown=45, NotChecked=538, Total=18906 [2022-11-03 01:41:47,490 INFO L413 NwaCegarLoop]: 570 mSDtfsCounter, 1973 mSDsluCounter, 15415 mSDsCounter, 0 mSdLazyCounter, 18532 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2004 SdHoareTripleChecker+Valid, 15985 SdHoareTripleChecker+Invalid, 22186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 18532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3540 IncrementalHoareTripleChecker+Unchecked, 60.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:41:47,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2004 Valid, 15985 Invalid, 22186 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [114 Valid, 18532 Invalid, 0 Unknown, 3540 Unchecked, 60.4s Time] [2022-11-03 01:41:47,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2022-11-03 01:41:47,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 1786. [2022-11-03 01:41:47,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1786 states, 1337 states have (on average 1.780104712041885) internal successors, (2380), 1749 states have internal predecessors, (2380), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-03 01:41:47,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2439 transitions. [2022-11-03 01:41:47,544 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2439 transitions. Word has length 108 [2022-11-03 01:41:47,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:41:47,544 INFO L495 AbstractCegarLoop]: Abstraction has 1786 states and 2439 transitions. [2022-11-03 01:41:47,545 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-03 01:41:47,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2439 transitions. [2022-11-03 01:41:47,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-03 01:41:47,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:41:47,548 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-03 01:41:47,575 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-11-03 01:41:47,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-03 01:41:47,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2022-11-03 01:41:48,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 01:41:48,171 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:41:48,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:41:48,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1178166840, now seen corresponding path program 1 times [2022-11-03 01:41:48,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:41:48,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32210842] [2022-11-03 01:41:48,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:48,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:41:48,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:41:48,173 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:41:48,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-11-03 01:41:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:48,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 01:41:48,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:41:50,989 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-03 01:41:50,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:41:57,106 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-03 01:41:57,107 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:41:57,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32210842] [2022-11-03 01:41:57,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32210842] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:41:57,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [254927030] [2022-11-03 01:41:57,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:41:57,107 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:41:57,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:41:57,108 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:41:57,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-11-03 01:41:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:41:58,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 01:41:58,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:41:58,746 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-03 01:41:58,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:42:00,136 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-03 01:42:00,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [254927030] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:42:00,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694395112] [2022-11-03 01:42:00,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:42:00,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:42:00,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:42:00,139 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:42:00,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-03 01:42:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:42:00,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 01:42:00,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:42:01,285 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-03 01:42:01,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:42:25,514 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-03 01:42:25,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694395112] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:42:25,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 01:42:25,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46, 46, 46, 46] total 134 [2022-11-03 01:42:25,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898626969] [2022-11-03 01:42:25,515 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 01:42:25,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 134 states [2022-11-03 01:42:25,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:42:25,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2022-11-03 01:42:25,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3407, Invalid=14415, Unknown=0, NotChecked=0, Total=17822 [2022-11-03 01:42:25,522 INFO L87 Difference]: Start difference. First operand 1786 states and 2439 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-03 01:43:53,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:53,502 INFO L93 Difference]: Finished difference Result 2160 states and 2935 transitions. [2022-11-03 01:43:53,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2022-11-03 01:43:53,507 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-03 01:43:53,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:53,512 INFO L225 Difference]: With dead ends: 2160 [2022-11-03 01:43:53,512 INFO L226 Difference]: Without dead ends: 2142 [2022-11-03 01:43:53,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 912 GetRequests, 654 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12611 ImplicationChecksByTransitivity, 94.6s TimeCoverageRelationStatistics Valid=18243, Invalid=49097, Unknown=0, NotChecked=0, Total=67340 [2022-11-03 01:43:53,522 INFO L413 NwaCegarLoop]: 1041 mSDtfsCounter, 1721 mSDsluCounter, 70381 mSDsCounter, 0 mSdLazyCounter, 8593 mSolverCounterSat, 1895 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1721 SdHoareTripleChecker+Valid, 71422 SdHoareTripleChecker+Invalid, 10488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1895 IncrementalHoareTripleChecker+Valid, 8593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:53,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1721 Valid, 71422 Invalid, 10488 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1895 Valid, 8593 Invalid, 0 Unknown, 0 Unchecked, 21.6s Time] [2022-11-03 01:43:53,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2022-11-03 01:43:53,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 1914. [2022-11-03 01:43:53,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1465 states have (on average 1.7406143344709897) internal successors, (2550), 1877 states have internal predecessors, (2550), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-03 01:43:53,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2609 transitions. [2022-11-03 01:43:53,551 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2609 transitions. Word has length 132 [2022-11-03 01:43:53,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:53,552 INFO L495 AbstractCegarLoop]: Abstraction has 1914 states and 2609 transitions. [2022-11-03 01:43:53,552 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-03 01:43:53,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2609 transitions. [2022-11-03 01:43:53,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-03 01:43:53,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:53,554 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-03 01:43:53,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-11-03 01:43:53,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2022-11-03 01:43:53,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-11-03 01:43:54,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:43:54,171 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:43:54,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:54,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1570895146, now seen corresponding path program 2 times [2022-11-03 01:43:54,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:43:54,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308956095] [2022-11-03 01:43:54,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 01:43:54,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:43:54,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:43:54,173 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:43:54,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-11-03 01:43:55,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-03 01:43:55,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:43:55,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 01:43:55,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:43:55,201 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-03 01:43:55,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2022-11-03 01:43:55,263 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-03 01:43:55,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 17 [2022-11-03 01:43:55,285 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-03 01:43:55,286 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:43:55,286 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:43:55,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308956095] [2022-11-03 01:43:55,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308956095] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:43:55,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:43:55,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:43:55,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360678483] [2022-11-03 01:43:55,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:43:55,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:43:55,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:43:55,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:43:55,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:43:55,287 INFO L87 Difference]: Start difference. First operand 1914 states and 2609 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-03 01:43:58,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:58,504 INFO L93 Difference]: Finished difference Result 2982 states and 4078 transitions. [2022-11-03 01:43:58,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:43:58,504 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-03 01:43:58,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:58,510 INFO L225 Difference]: With dead ends: 2982 [2022-11-03 01:43:58,510 INFO L226 Difference]: Without dead ends: 2982 [2022-11-03 01:43:58,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:43:58,511 INFO L413 NwaCegarLoop]: 1418 mSDtfsCounter, 1649 mSDsluCounter, 3913 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1652 SdHoareTripleChecker+Valid, 5331 SdHoareTripleChecker+Invalid, 1917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 865 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:58,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1652 Valid, 5331 Invalid, 1917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1030 Invalid, 0 Unknown, 865 Unchecked, 3.1s Time] [2022-11-03 01:43:58,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2022-11-03 01:43:58,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 1913. [2022-11-03 01:43:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1913 states, 1465 states have (on average 1.7392491467576792) internal successors, (2548), 1876 states have internal predecessors, (2548), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-03 01:43:58,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 2607 transitions. [2022-11-03 01:43:58,547 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 2607 transitions. Word has length 135 [2022-11-03 01:43:58,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:58,548 INFO L495 AbstractCegarLoop]: Abstraction has 1913 states and 2607 transitions. [2022-11-03 01:43:58,548 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-03 01:43:58,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2607 transitions. [2022-11-03 01:43:58,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-03 01:43:58,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:58,550 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-03 01:43:58,572 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2022-11-03 01:43:58,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:43:58,763 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:43:58,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:58,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1570895145, now seen corresponding path program 1 times [2022-11-03 01:43:58,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:43:58,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856897596] [2022-11-03 01:43:58,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:58,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:43:58,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:43:58,766 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:43:58,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-11-03 01:43:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:00,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 123 conjunts are in the unsatisfiable core [2022-11-03 01:44:00,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:00,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 01:44:00,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:44:00,442 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:44:00,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 01:44:00,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:44:00,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:44:00,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-11-03 01:44:00,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:44:03,189 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:44:03,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 01:44:03,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 01:44:03,373 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:44:03,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 01:44:03,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 01:44:03,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-03 01:44:03,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:44:03,473 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-03 01:44:03,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:44:03,751 WARN L833 $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-03 01:44:03,793 WARN L833 $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-03 01:44:04,836 WARN L833 $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_5734))) (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_5735) .cse0 v_ArrVal_5642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (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_5735) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5734) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-03 01:44:04,844 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:44:04,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1856897596] [2022-11-03 01:44:04,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1856897596] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:44:04,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1214133638] [2022-11-03 01:44:04,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:04,845 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:44:04,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:44:04,846 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:44:04,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2022-11-03 01:44:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:09,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-03 01:44:09,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:09,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:44:09,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 01:44:10,071 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:44:10,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 01:44:10,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 01:44:10,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:44:10,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:44:10,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-03 01:44:10,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:44:15,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 01:44:15,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:15,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 60 [2022-11-03 01:44:15,464 INFO L356 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-03 01:44:15,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 44 [2022-11-03 01:44:15,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-03 01:44:15,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:44:15,741 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-03 01:44:15,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:44:16,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 159 [2022-11-03 01:44:26,665 WARN L234 SmtUtils]: Spent 8.87s on a formula simplification. DAG size of input: 63 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:44:27,208 WARN L833 $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-03 01:44:27,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1214133638] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:44:27,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943399875] [2022-11-03 01:44:27,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:27,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:44:27,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:44:27,227 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:44:27,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-11-03 01:44:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:28,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 120 conjunts are in the unsatisfiable core [2022-11-03 01:44:28,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:28,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:44:28,490 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:44:28,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 01:44:28,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:44:28,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:44:29,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 01:44:29,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 01:44:31,827 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6711) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_38 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_38) (_ bv44 32))) (exists ((v_ArrVal_6710 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6710) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:44:31,894 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:44:31,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 01:44:31,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 01:44:32,305 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:44:32,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 01:44:32,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 01:44:32,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-03 01:44:32,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 01:44:32,367 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-03 01:44:32,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:44:32,442 WARN L833 $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-03 01:44:32,478 WARN L833 $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-03 01:44:33,728 WARN L833 $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_6805))) (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_6804) .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_6804) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6805) |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-03 01:44:33,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943399875] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:44:33,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:44:33,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 36 [2022-11-03 01:44:33,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985978811] [2022-11-03 01:44:33,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:44:33,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 01:44:33,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:44:33,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 01:44:33,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1376, Unknown=79, NotChecked=664, Total=2256 [2022-11-03 01:44:33,742 INFO L87 Difference]: Start difference. First operand 1913 states and 2607 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-03 01:44:36,923 WARN L855 $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_6711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6711) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5640 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5640))) (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_6710 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6710) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5641 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5641) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:45:15,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:15,265 INFO L93 Difference]: Finished difference Result 3032 states and 4081 transitions. [2022-11-03 01:45:15,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 01:45:15,266 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-03 01:45:15,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:15,269 INFO L225 Difference]: With dead ends: 3032 [2022-11-03 01:45:15,269 INFO L226 Difference]: Without dead ends: 3032 [2022-11-03 01:45:15,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 248 SyntacticMatches, 133 SemanticMatches, 62 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1884 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=286, Invalid=2605, Unknown=115, NotChecked=1026, Total=4032 [2022-11-03 01:45:15,270 INFO L413 NwaCegarLoop]: 678 mSDtfsCounter, 3086 mSDsluCounter, 12399 mSDsCounter, 0 mSdLazyCounter, 16001 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3091 SdHoareTripleChecker+Valid, 13077 SdHoareTripleChecker+Invalid, 28127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 16001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12075 IncrementalHoareTripleChecker+Unchecked, 39.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:15,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3091 Valid, 13077 Invalid, 28127 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [51 Valid, 16001 Invalid, 0 Unknown, 12075 Unchecked, 39.0s Time] [2022-11-03 01:45:15,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3032 states. [2022-11-03 01:45:15,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3032 to 1912. [2022-11-03 01:45:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1912 states, 1465 states have (on average 1.7378839590443687) internal successors, (2546), 1875 states have internal predecessors, (2546), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-03 01:45:15,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 2605 transitions. [2022-11-03 01:45:15,292 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 2605 transitions. Word has length 135 [2022-11-03 01:45:15,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:15,293 INFO L495 AbstractCegarLoop]: Abstraction has 1912 states and 2605 transitions. [2022-11-03 01:45:15,293 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-03 01:45:15,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2605 transitions. [2022-11-03 01:45:15,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-03 01:45:15,305 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:15,305 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-03 01:45:15,331 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (40)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:15,557 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:15,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:15,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:45:15,927 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:45:15,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:15,927 INFO L85 PathProgramCache]: Analyzing trace with hash -573302594, now seen corresponding path program 1 times [2022-11-03 01:45:15,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:45:15,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301805323] [2022-11-03 01:45:15,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:15,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:45:15,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:45:15,930 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:45:15,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2022-11-03 01:45:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:17,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-03 01:45:17,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:17,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 01:45:17,651 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 01:45:17,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 01:45:17,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:45:17,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-03 01:45:20,917 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:45:20,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 01:45:21,084 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:45:21,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 01:45:21,225 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:45:21,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 01:45:21,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-03 01:45:21,324 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-03 01:45:21,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:45:21,453 WARN L833 $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-03 01:45:21,468 WARN L833 $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-03 01:45:21,490 WARN L833 $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-03 01:45:21,505 WARN L833 $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 (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_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-03 01:45:21,942 WARN L833 $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-03 01:45:21,949 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:45:21,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301805323] [2022-11-03 01:45:21,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301805323] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:45:21,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1452370356] [2022-11-03 01:45:21,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:21,950 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:45:21,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:45:21,951 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:45:21,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2022-11-03 01:45:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:28,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-03 01:45:28,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:28,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 01:45:29,142 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 01:45:29,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 01:45:29,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:45:29,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-03 01:45:32,181 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:45:32,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 01:45:32,294 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:45:32,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 01:45:32,361 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:45:32,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 01:45:32,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-03 01:45:32,406 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-03 01:45:32,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:45:32,431 WARN L833 $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-03 01:45:32,446 WARN L833 $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-03 01:45:32,467 WARN L833 $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-03 01:45:32,484 WARN L833 $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-03 01:45:32,908 WARN L833 $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-03 01:45:32,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1452370356] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:45:32,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359230632] [2022-11-03 01:45:32,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:32,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:45:32,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:45:32,912 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:45:32,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-11-03 01:45:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:33,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-03 01:45:33,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:33,984 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:45:33,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 01:45:34,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:45:37,632 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8261) |c_#memory_$Pointer$.base|)) is different from true [2022-11-03 01:45:37,666 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:45:37,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-03 01:45:37,782 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:45:37,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-03 01:45:37,914 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:45:37,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 01:45:38,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-03 01:45:38,034 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-03 01:45:38,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:45:38,075 INFO L356 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2022-11-03 01:45:38,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 01:45:38,086 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8263 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8263) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem75#1.base|)) is different from false [2022-11-03 01:45:38,100 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8263 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8263) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2022-11-03 01:45:38,120 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8262 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8262)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_8263) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2022-11-03 01:45:38,135 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8262 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8262))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_8263) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2022-11-03 01:45:38,545 WARN L833 $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 ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8309))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8262)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_8263) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2022-11-03 01:45:38,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359230632] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:45:38,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:45:38,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 27 [2022-11-03 01:45:38,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242759571] [2022-11-03 01:45:38,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:45:38,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-03 01:45:38,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:45:38,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-03 01:45:38,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=657, Unknown=40, NotChecked=1072, Total=1892 [2022-11-03 01:45:38,550 INFO L87 Difference]: Start difference. First operand 1912 states and 2605 transitions. Second operand has 28 states, 25 states have (on average 4.84) internal successors, (121), 24 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-03 01:45:39,967 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8261) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_69 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_69) (_ bv1 1))) (not (= v_arrayElimCell_69 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_14|)))) (exists ((v_ArrVal_7259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_7259)))) is different from true [2022-11-03 01:45:57,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:57,368 INFO L93 Difference]: Finished difference Result 3281 states and 4435 transitions. [2022-11-03 01:45:57,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-03 01:45:57,368 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 4.84) internal successors, (121), 24 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-03 01:45:57,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:57,373 INFO L225 Difference]: With dead ends: 3281 [2022-11-03 01:45:57,374 INFO L226 Difference]: Without dead ends: 3281 [2022-11-03 01:45:57,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 270 SyntacticMatches, 133 SemanticMatches, 54 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 1498 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=210, Invalid=1284, Unknown=56, NotChecked=1530, Total=3080 [2022-11-03 01:45:57,375 INFO L413 NwaCegarLoop]: 883 mSDtfsCounter, 1648 mSDsluCounter, 10491 mSDsCounter, 0 mSdLazyCounter, 8079 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1652 SdHoareTripleChecker+Valid, 11374 SdHoareTripleChecker+Invalid, 14119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 8079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5987 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:57,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1652 Valid, 11374 Invalid, 14119 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [53 Valid, 8079 Invalid, 0 Unknown, 5987 Unchecked, 17.9s Time] [2022-11-03 01:45:57,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3281 states. [2022-11-03 01:45:57,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3281 to 1909. [2022-11-03 01:45:57,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1909 states, 1465 states have (on average 1.733788395904437) internal successors, (2540), 1872 states have internal predecessors, (2540), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-03 01:45:57,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1909 states to 1909 states and 2599 transitions. [2022-11-03 01:45:57,400 INFO L78 Accepts]: Start accepts. Automaton has 1909 states and 2599 transitions. Word has length 138 [2022-11-03 01:45:57,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:57,401 INFO L495 AbstractCegarLoop]: Abstraction has 1909 states and 2599 transitions. [2022-11-03 01:45:57,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 4.84) internal successors, (121), 24 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-03 01:45:57,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1909 states and 2599 transitions. [2022-11-03 01:45:57,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-03 01:45:57,403 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:57,403 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-03 01:45:57,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:57,637 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:57,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (43)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:58,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 01:45:58,019 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:45:58,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:58,020 INFO L85 PathProgramCache]: Analyzing trace with hash -573302593, now seen corresponding path program 1 times [2022-11-03 01:45:58,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:45:58,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552637526] [2022-11-03 01:45:58,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:58,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:45:58,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:45:58,021 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:45:58,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2022-11-03 01:45:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:59,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 127 conjunts are in the unsatisfiable core [2022-11-03 01:45:59,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:59,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 01:45:59,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:46:00,061 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:46:00,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 01:46:00,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:46:00,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:46:00,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-11-03 01:46:00,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:46:03,430 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:46:03,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 01:46:03,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 01:46:03,639 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:46:03,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 01:46:03,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 01:46:03,827 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:46:03,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 01:46:03,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 01:46:03,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:46:03,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-03 01:46:03,969 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-03 01:46:03,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:46:04,359 WARN L833 $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-03 01:46:04,402 WARN L833 $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-03 01:46:04,476 WARN L833 $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-03 01:46:04,715 WARN L833 $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))) (v_ArrVal_8811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8810 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8810) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8811) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 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))) (v_ArrVal_8811 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8810 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8811))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8810) .cse3 v_ArrVal_8812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2022-11-03 01:46:06,231 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (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_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 ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8905))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8811))) (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_8904) .cse0 v_ArrVal_8810) .cse1 v_ArrVal_8812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (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 ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8905))) (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_8904) .cse6 v_ArrVal_8810) (select (select (store .cse7 .cse6 v_ArrVal_8811) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8812))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2022-11-03 01:46:06,242 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:46:06,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [552637526] [2022-11-03 01:46:06,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [552637526] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:46:06,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [740912557] [2022-11-03 01:46:06,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:06,243 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:46:06,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:46:06,244 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:46:06,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (46)] Waiting until timeout for monitored process [2022-11-03 01:48:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:48:39,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 124 conjunts are in the unsatisfiable core [2022-11-03 01:48:39,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:48:39,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 01:48:40,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:48:40,134 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:48:40,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 01:48:40,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:48:40,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:48:40,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 01:48:40,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 01:48:44,559 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:48:44,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 01:48:44,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 01:48:44,930 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:48:44,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 01:48:44,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 01:48:45,181 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:48:45,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 01:48:45,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 01:48:45,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 01:48:45,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-03 01:48:45,260 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-03 01:48:45,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:48:45,361 WARN L833 $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-03 01:48:45,405 WARN L833 $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-03 01:48:45,499 WARN L833 $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-03 01:48:45,562 WARN L833 $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-03 01:48:46,920 WARN L833 $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_9500))) (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_9501) .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_9500))) (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_9501) .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-03 01:48:46,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [740912557] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:48:46,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812239631] [2022-11-03 01:48:46,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:48:46,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:48:46,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:48:46,934 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:48:46,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-11-03 01:48:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:48:47,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 123 conjunts are in the unsatisfiable core [2022-11-03 01:48:47,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:48:48,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:48:48,255 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:48:48,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 01:48:48,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:48:48,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:48:48,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 01:48:48,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 01:48:52,586 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:48:52,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 01:48:52,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 01:48:52,822 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:48:52,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 01:48:52,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 01:48:52,943 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:48:52,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 01:48:52,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 01:48:53,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 01:48:53,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-03 01:48:53,046 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-03 01:48:53,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:48:53,140 WARN L833 $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-03 01:48:53,199 WARN L833 $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-03 01:48:53,274 WARN L833 $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-03 01:48:53,344 WARN L833 $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-03 01:48:55,471 WARN L833 $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_10095))) (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_10096) .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_10095))) (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_10096) .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-03 01:48:55,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812239631] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:48:55,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:48:55,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 23 [2022-11-03 01:48:55,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283380934] [2022-11-03 01:48:55,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:48:55,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-03 01:48:55,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:48:55,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-03 01:48:55,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=568, Unknown=35, NotChecked=930, Total=1640 [2022-11-03 01:48:55,487 INFO L87 Difference]: Start difference. First operand 1909 states and 2599 transitions. Second operand has 24 states, 21 states have (on average 7.809523809523809) internal successors, (164), 20 states have internal predecessors, (164), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-03 01:49:35,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:49:35,387 INFO L93 Difference]: Finished difference Result 3028 states and 4073 transitions. [2022-11-03 01:49:35,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-03 01:49:35,388 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.809523809523809) internal successors, (164), 20 states have internal predecessors, (164), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 138 [2022-11-03 01:49:35,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:49:35,392 INFO L225 Difference]: With dead ends: 3028 [2022-11-03 01:49:35,392 INFO L226 Difference]: Without dead ends: 3028 [2022-11-03 01:49:35,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 268 SyntacticMatches, 135 SemanticMatches, 49 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1434 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=187, Invalid=1088, Unknown=45, NotChecked=1230, Total=2550 [2022-11-03 01:49:35,393 INFO L413 NwaCegarLoop]: 803 mSDtfsCounter, 1959 mSDsluCounter, 8075 mSDsCounter, 0 mSdLazyCounter, 11603 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1964 SdHoareTripleChecker+Valid, 8878 SdHoareTripleChecker+Invalid, 15650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 11603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4010 IncrementalHoareTripleChecker+Unchecked, 38.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:49:35,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1964 Valid, 8878 Invalid, 15650 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [37 Valid, 11603 Invalid, 0 Unknown, 4010 Unchecked, 38.6s Time] [2022-11-03 01:49:35,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3028 states. [2022-11-03 01:49:35,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3028 to 1908. [2022-11-03 01:49:35,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1908 states, 1465 states have (on average 1.7324232081911264) internal successors, (2538), 1871 states have internal predecessors, (2538), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-03 01:49:35,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 2597 transitions. [2022-11-03 01:49:35,415 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 2597 transitions. Word has length 138 [2022-11-03 01:49:35,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:49:35,416 INFO L495 AbstractCegarLoop]: Abstraction has 1908 states and 2597 transitions. [2022-11-03 01:49:35,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.809523809523809) internal successors, (164), 20 states have internal predecessors, (164), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-03 01:49:35,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2597 transitions. [2022-11-03 01:49:35,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-03 01:49:35,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:49:35,418 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-03 01:49:35,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (46)] Forceful destruction successful, exit code 0 [2022-11-03 01:49:35,694 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-11-03 01:49:35,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (45)] Forceful destruction successful, exit code 0 [2022-11-03 01:49:36,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:49:36,044 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:49:36,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:49:36,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1827699965, now seen corresponding path program 1 times [2022-11-03 01:49:36,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:49:36,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835715599] [2022-11-03 01:49:36,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:36,045 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:49:36,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:49:36,046 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:49:36,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2022-11-03 01:49:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:37,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-03 01:49:37,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:49:37,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 01:49:38,040 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 01:49:38,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 01:49:38,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:49:38,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-03 01:49:42,519 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:49:42,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 01:49:42,744 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:49:42,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 01:49:42,938 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:49:42,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 01:49:43,156 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:49:43,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 01:49:43,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-03 01:49:43,323 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-03 01:49:43,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:49:43,630 WARN L833 $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-03 01:49:43,657 WARN L833 $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-03 01:49:43,678 WARN L833 $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-03 01:49:43,707 WARN L833 $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-03 01:49:43,731 WARN L833 $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-03 01:49:44,275 WARN L833 $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-03 01:49:44,279 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:49:44,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835715599] [2022-11-03 01:49:44,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835715599] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:49:44,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1435852328] [2022-11-03 01:49:44,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:44,280 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:49:44,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:49:44,281 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:49:44,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (49)] Waiting until timeout for monitored process [2022-11-03 01:49:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:53,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-03 01:49:53,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:49:53,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 01:49:53,845 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 01:49:53,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 01:49:53,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:49:53,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-03 01:49:58,108 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:49:58,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 01:49:58,265 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:49:58,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 01:49:58,362 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:49:58,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 01:49:58,463 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:49:58,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 01:49:58,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-03 01:49:58,523 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-03 01:49:58,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:49:58,558 WARN L833 $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-03 01:49:58,578 WARN L833 $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-03 01:49:58,607 WARN L833 $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-03 01:49:58,636 WARN L833 $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-03 01:49:58,679 WARN L833 $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-03 01:49:58,712 WARN L833 $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-03 01:49:59,276 WARN L833 $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-03 01:49:59,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1435852328] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:49:59,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363900705] [2022-11-03 01:49:59,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:59,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:49:59,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:49:59,281 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:49:59,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-11-03 01:50:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:00,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-03 01:50:00,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:50:00,640 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:50:00,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 01:50:00,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:50:05,933 WARN L855 $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-03 01:50:05,988 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:50:05,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-03 01:50:06,161 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:50:06,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 01:50:06,500 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:50:06,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 01:50:06,702 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:50:06,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-03 01:50:06,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-03 01:50:06,738 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-03 01:50:06,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:50:06,784 WARN L833 $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-03 01:50:06,805 WARN L833 $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-03 01:50:06,834 WARN L833 $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-03 01:50:06,855 WARN L833 $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-03 01:50:06,898 INFO L356 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2022-11-03 01:50:06,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 60 [2022-11-03 01:50:06,914 WARN L833 $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-03 01:50:06,933 WARN L833 $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-03 01:50:07,460 WARN L833 $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))) (v_ArrVal_11648 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_11648)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (let ((.cse3 (store .cse4 .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-03 01:50:07,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363900705] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:50:07,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:50:07,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 29 [2022-11-03 01:50:07,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205941797] [2022-11-03 01:50:07,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:50:07,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-03 01:50:07,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 01:50:07,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-03 01:50:07,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=805, Unknown=57, NotChecked=1638, Total=2652 [2022-11-03 01:50:07,472 INFO L87 Difference]: Start difference. First operand 1908 states and 2597 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-03 01:50:09,511 WARN L855 $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 [2022-11-03 01:50:36,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:36,314 INFO L93 Difference]: Finished difference Result 3279 states and 4431 transitions. [2022-11-03 01:50:36,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-03 01:50:36,314 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 141 [2022-11-03 01:50:36,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:36,325 INFO L225 Difference]: With dead ends: 3279 [2022-11-03 01:50:36,325 INFO L226 Difference]: Without dead ends: 3279 [2022-11-03 01:50:36,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 280 SyntacticMatches, 133 SemanticMatches, 61 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 1684 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=234, Invalid=1422, Unknown=72, NotChecked=2178, Total=3906 [2022-11-03 01:50:36,327 INFO L413 NwaCegarLoop]: 882 mSDtfsCounter, 1652 mSDsluCounter, 11202 mSDsCounter, 0 mSdLazyCounter, 8830 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1656 SdHoareTripleChecker+Valid, 12084 SdHoareTripleChecker+Invalid, 11720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 8830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2839 IncrementalHoareTripleChecker+Unchecked, 27.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:36,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1656 Valid, 12084 Invalid, 11720 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [51 Valid, 8830 Invalid, 0 Unknown, 2839 Unchecked, 27.6s Time] [2022-11-03 01:50:36,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2022-11-03 01:50:36,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 1907. [2022-11-03 01:50:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1907 states, 1465 states have (on average 1.7310580204778157) internal successors, (2536), 1870 states have internal predecessors, (2536), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2022-11-03 01:50:36,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 2595 transitions. [2022-11-03 01:50:36,355 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 2595 transitions. Word has length 141 [2022-11-03 01:50:36,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:36,356 INFO L495 AbstractCegarLoop]: Abstraction has 1907 states and 2595 transitions. [2022-11-03 01:50:36,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-03 01:50:36,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2595 transitions. [2022-11-03 01:50:36,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-03 01:50:36,357 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:36,357 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-03 01:50:36,406 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-11-03 01:50:36,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (49)] Forceful destruction successful, exit code 0 [2022-11-03 01:50:36,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (48)] Forceful destruction successful, exit code 0 [2022-11-03 01:50:36,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 01:50:36,975 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2022-11-03 01:50:36,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:36,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1827699966, now seen corresponding path program 1 times [2022-11-03 01:50:36,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 01:50:36,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400350349] [2022-11-03 01:50:36,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:36,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 01:50:36,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 01:50:36,978 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 01:50:36,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (51)] Waiting until timeout for monitored process [2022-11-03 01:50:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:38,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 129 conjunts are in the unsatisfiable core [2022-11-03 01:50:38,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:50:38,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 01:50:39,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:50:39,293 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 01:50:39,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 01:50:39,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:50:39,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:50:39,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-11-03 01:50:39,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:50:43,512 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_12162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_12162) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_152 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_152) (_ bv44 32))) (exists ((v_ArrVal_12163 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_12163) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:50:43,593 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:50:43,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 01:50:43,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 01:50:43,877 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:50:43,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 01:50:43,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 01:50:44,087 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:50:44,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 01:50:44,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 01:50:44,329 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:50:44,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-03 01:50:44,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 01:50:44,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:50:44,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-03 01:50:44,497 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-03 01:50:44,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:50:44,835 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2022-11-03 01:50:44,879 WARN L833 $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_12169 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-03 01:50:45,034 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12167))) (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~mem75#1.base| v_ArrVal_12166) .cse0 v_ArrVal_12169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_12168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_12166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12166) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2022-11-03 01:50:45,246 WARN L833 $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_12166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12167))) (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_12166) .cse1 v_ArrVal_12169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_12168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_12166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12166) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2022-11-03 01:50:46,227 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12164))) (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~mem74#1.base| v_ArrVal_12165) .cse1 v_ArrVal_12166) (select (select (store .cse2 .cse1 v_ArrVal_12167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12169))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12164))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_12167))) (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~mem74#1.base| v_ArrVal_12165) .cse4 v_ArrVal_12166) .cse5 v_ArrVal_12169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_12168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-03 01:50:47,352 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (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|) .cse4))) (and (forall ((v_ArrVal_12166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12164))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12165) .cse2 v_ArrVal_12166) (select (select (store .cse3 .cse2 v_ArrVal_12167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_12169))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12164))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_12167))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12165) .cse5 v_ArrVal_12166) .cse6 v_ArrVal_12169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_12168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2022-11-03 01:50:49,698 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12261 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12260 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12260))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_12164))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_12167))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12261) .cse0 v_ArrVal_12165) .cse1 v_ArrVal_12166) .cse2 v_ArrVal_12169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_12168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_12166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12261 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12260 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12260))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_12164))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12261) .cse8 v_ArrVal_12165) .cse9 v_ArrVal_12166) (select (select (store .cse10 .cse9 v_ArrVal_12167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12169))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2022-11-03 01:50:49,708 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 01:50:49,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400350349] [2022-11-03 01:50:49,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1400350349] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:50:49,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1602782210] [2022-11-03 01:50:49,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:49,709 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 01:50:49,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 01:50:49,710 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 01:50:49,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22810db7-416f-4589-a0ca-faa5eb9f1b3c/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (52)] Waiting until timeout for monitored process