./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0102-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0102-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur --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 d10910cb8c44ec8f982d35122d9e66670129ee7c874265953b685f7f63a30072 --- 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-38b53e6 [2022-11-25 22:36:26,110 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:36:26,113 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:36:26,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:36:26,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:36:26,154 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:36:26,156 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:36:26,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:36:26,163 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:36:26,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:36:26,171 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:36:26,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:36:26,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:36:26,177 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:36:26,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:36:26,182 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:36:26,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:36:26,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:36:26,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:36:26,192 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:36:26,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:36:26,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:36:26,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:36:26,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:36:26,209 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:36:26,209 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:36:26,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:36:26,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:36:26,215 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:36:26,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:36:26,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:36:26,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:36:26,219 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:36:26,220 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:36:26,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:36:26,221 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:36:26,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:36:26,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:36:26,222 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:36:26,223 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:36:26,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:36:26,225 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-25 22:36:26,266 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:36:26,266 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:36:26,267 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:36:26,267 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:36:26,268 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:36:26,269 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:36:26,269 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:36:26,269 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:36:26,269 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:36:26,269 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 22:36:26,270 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:36:26,271 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:36:26,271 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 22:36:26,271 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 22:36:26,271 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:36:26,272 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 22:36:26,272 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 22:36:26,272 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 22:36:26,273 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 22:36:26,273 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 22:36:26,273 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:36:26,273 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:36:26,274 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 22:36:26,274 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:36:26,274 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:36:26,274 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:36:26,274 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 22:36:26,275 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 22:36:26,275 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 22:36:26,275 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:36:26,276 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 22:36:26,276 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:36:26,276 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:36:26,276 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:36:26,276 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:36:26,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:36:26,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:36:26,277 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 22:36:26,277 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:36:26,278 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 22:36:26,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 22:36:26,278 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:36:26,278 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_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/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_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur 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 -> d10910cb8c44ec8f982d35122d9e66670129ee7c874265953b685f7f63a30072 [2022-11-25 22:36:26,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:36:26,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:36:26,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:36:26,564 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:36:26,565 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:36:26,566 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/memsafety/test-0102-2.i [2022-11-25 22:36:29,703 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:36:29,956 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:36:29,956 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/sv-benchmarks/c/memsafety/test-0102-2.i [2022-11-25 22:36:29,971 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/data/6534e83fd/da9cd96420384e00aa8a4da21b7ff7a4/FLAGf9d0ef2cc [2022-11-25 22:36:29,985 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/data/6534e83fd/da9cd96420384e00aa8a4da21b7ff7a4 [2022-11-25 22:36:29,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:36:29,989 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:36:29,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:36:29,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:36:29,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:36:29,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:36:29" (1/1) ... [2022-11-25 22:36:29,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d434d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:29, skipping insertion in model container [2022-11-25 22:36:29,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:36:29" (1/1) ... [2022-11-25 22:36:30,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:36:30,041 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:36:30,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:36:30,348 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-25 22:36:30,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@31e4441f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:30, skipping insertion in model container [2022-11-25 22:36:30,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:36:30,350 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-25 22:36:30,352 INFO L158 Benchmark]: Toolchain (without parser) took 361.98ms. Allocated memory is still 161.5MB. Free memory was 117.8MB in the beginning and 106.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 22:36:30,353 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 117.4MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 22:36:30,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.55ms. Allocated memory is still 161.5MB. Free memory was 117.8MB in the beginning and 106.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 22:36:30,356 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 117.4MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.55ms. Allocated memory is still 161.5MB. Free memory was 117.8MB in the beginning and 106.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 551]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0102-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur --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 d10910cb8c44ec8f982d35122d9e66670129ee7c874265953b685f7f63a30072 --- 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-38b53e6 [2022-11-25 22:36:32,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:36:32,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:36:32,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:36:32,779 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:36:32,782 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:36:32,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:36:32,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:36:32,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:36:32,796 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:36:32,797 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:36:32,800 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:36:32,800 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:36:32,803 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:36:32,804 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:36:32,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:36:32,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:36:32,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:36:32,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:36:32,819 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:36:32,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:36:32,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:36:32,825 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:36:32,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:36:32,836 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:36:32,836 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:36:32,836 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:36:32,837 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:36:32,838 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:36:32,839 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:36:32,839 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:36:32,840 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:36:32,841 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:36:32,841 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:36:32,842 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:36:32,843 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:36:32,843 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:36:32,844 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:36:32,844 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:36:32,845 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:36:32,845 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:36:32,852 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-25 22:36:32,903 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:36:32,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:36:32,904 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:36:32,904 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:36:32,905 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:36:32,905 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:36:32,905 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:36:32,906 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:36:32,906 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:36:32,906 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:36:32,907 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:36:32,907 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:36:32,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 22:36:32,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 22:36:32,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:36:32,909 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:36:32,909 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 22:36:32,909 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:36:32,909 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:36:32,910 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:36:32,910 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 22:36:32,910 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 22:36:32,910 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 22:36:32,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:36:32,911 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 22:36:32,911 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 22:36:32,911 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 22:36:32,912 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:36:32,912 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:36:32,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:36:32,912 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 22:36:32,913 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:36:32,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:36:32,913 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:36:32,913 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:36:32,913 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-25 22:36:32,914 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 22:36:32,914 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:36:32,914 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 22:36:32,914 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_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/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_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur 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 -> d10910cb8c44ec8f982d35122d9e66670129ee7c874265953b685f7f63a30072 [2022-11-25 22:36:33,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:36:33,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:36:33,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:36:33,278 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:36:33,278 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:36:33,280 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/memsafety/test-0102-2.i [2022-11-25 22:36:36,308 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:36:36,642 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:36:36,642 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/sv-benchmarks/c/memsafety/test-0102-2.i [2022-11-25 22:36:36,657 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/data/654049d24/c29ed3da90d34f5692bc3027f9035c71/FLAG2926404b1 [2022-11-25 22:36:36,671 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/data/654049d24/c29ed3da90d34f5692bc3027f9035c71 [2022-11-25 22:36:36,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:36:36,675 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:36:36,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:36:36,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:36:36,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:36:36,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:36:36" (1/1) ... [2022-11-25 22:36:36,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a994d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:36, skipping insertion in model container [2022-11-25 22:36:36,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:36:36" (1/1) ... [2022-11-25 22:36:36,694 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:36:36,729 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:36:37,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:36:37,112 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-25 22:36:37,141 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:36:37,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:36:37,225 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 22:36:37,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:36:37,298 INFO L208 MainTranslator]: Completed translation [2022-11-25 22:36:37,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:37 WrapperNode [2022-11-25 22:36:37,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:36:37,300 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 22:36:37,300 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 22:36:37,300 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 22:36:37,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:37" (1/1) ... [2022-11-25 22:36:37,337 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:37" (1/1) ... [2022-11-25 22:36:37,383 INFO L138 Inliner]: procedures = 136, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2022-11-25 22:36:37,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 22:36:37,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 22:36:37,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 22:36:37,385 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 22:36:37,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:37" (1/1) ... [2022-11-25 22:36:37,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:37" (1/1) ... [2022-11-25 22:36:37,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:37" (1/1) ... [2022-11-25 22:36:37,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:37" (1/1) ... [2022-11-25 22:36:37,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:37" (1/1) ... [2022-11-25 22:36:37,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:37" (1/1) ... [2022-11-25 22:36:37,427 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:37" (1/1) ... [2022-11-25 22:36:37,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:37" (1/1) ... [2022-11-25 22:36:37,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 22:36:37,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 22:36:37,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 22:36:37,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 22:36:37,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:37" (1/1) ... [2022-11-25 22:36:37,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:36:37,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:36:37,489 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 22:36:37,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 22:36:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-11-25 22:36:37,540 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-11-25 22:36:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 22:36:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 22:36:37,541 INFO L130 BoogieDeclarations]: Found specification of procedure create_sub_list [2022-11-25 22:36:37,541 INFO L138 BoogieDeclarations]: Found implementation of procedure create_sub_list [2022-11-25 22:36:37,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 22:36:37,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 22:36:37,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 22:36:37,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 22:36:37,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 22:36:37,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 22:36:37,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 22:36:37,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 22:36:37,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 22:36:37,716 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 22:36:37,718 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 22:36:38,305 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 22:36:38,312 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 22:36:38,312 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-25 22:36:38,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:36:38 BoogieIcfgContainer [2022-11-25 22:36:38,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 22:36:38,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 22:36:38,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 22:36:38,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 22:36:38,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 10:36:36" (1/3) ... [2022-11-25 22:36:38,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c45f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:36:38, skipping insertion in model container [2022-11-25 22:36:38,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:37" (2/3) ... [2022-11-25 22:36:38,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c45f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:36:38, skipping insertion in model container [2022-11-25 22:36:38,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:36:38" (3/3) ... [2022-11-25 22:36:38,323 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0102-2.i [2022-11-25 22:36:38,342 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 22:36:38,342 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2022-11-25 22:36:38,385 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 22:36:38,391 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;@4a798537, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 22:36:38,392 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-11-25 22:36:38,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 76 states have internal predecessors, (86), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 22:36:38,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 22:36:38,402 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:38,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 22:36:38,403 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:36:38,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:38,409 INFO L85 PathProgramCache]: Analyzing trace with hash 60205689, now seen corresponding path program 1 times [2022-11-25 22:36:38,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:36:38,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326229317] [2022-11-25 22:36:38,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:38,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:38,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:36:38,431 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:36:38,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 22:36:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:38,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 22:36:38,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:38,566 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-25 22:36:38,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:36:38,567 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:36:38,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326229317] [2022-11-25 22:36:38,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326229317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:38,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:38,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:36:38,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208169153] [2022-11-25 22:36:38,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:38,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 22:36:38,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:36:38,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 22:36:38,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 22:36:38,633 INFO L87 Difference]: Start difference. First operand has 83 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 76 states have internal predecessors, (86), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:36:38,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:38,666 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2022-11-25 22:36:38,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 22:36:38,669 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 22:36:38,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:38,677 INFO L225 Difference]: With dead ends: 83 [2022-11-25 22:36:38,677 INFO L226 Difference]: Without dead ends: 81 [2022-11-25 22:36:38,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 22:36:38,684 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:38,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:36:38,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-25 22:36:38,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-25 22:36:38,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 74 states have internal predecessors, (78), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 22:36:38,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2022-11-25 22:36:38,733 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 5 [2022-11-25 22:36:38,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:38,734 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2022-11-25 22:36:38,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:36:38,734 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2022-11-25 22:36:38,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 22:36:38,735 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:38,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:38,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-25 22:36:38,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:38,947 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:36:38,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:38,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2005144647, now seen corresponding path program 1 times [2022-11-25 22:36:38,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:36:38,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786359601] [2022-11-25 22:36:38,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:38,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:38,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:36:38,951 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:36:38,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 22:36:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:39,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 22:36:39,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:39,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:36:39,203 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-25 22:36:39,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:36:39,203 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:36:39,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786359601] [2022-11-25 22:36:39,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786359601] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:39,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:39,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:36:39,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516006620] [2022-11-25 22:36:39,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:39,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:36:39,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:36:39,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:36:39,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:36:39,207 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-25 22:36:39,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:39,508 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2022-11-25 22:36:39,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:36:39,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 7 [2022-11-25 22:36:39,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:39,510 INFO L225 Difference]: With dead ends: 108 [2022-11-25 22:36:39,510 INFO L226 Difference]: Without dead ends: 108 [2022-11-25 22:36:39,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:36:39,512 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 60 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:39,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 162 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 22:36:39,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-25 22:36:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 79. [2022-11-25 22:36:39,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 72 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 22:36:39,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2022-11-25 22:36:39,521 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 7 [2022-11-25 22:36:39,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:39,521 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2022-11-25 22:36:39,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-25 22:36:39,521 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-11-25 22:36:39,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 22:36:39,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:39,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:39,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 22:36:39,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:39,723 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:36:39,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:39,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2005144648, now seen corresponding path program 1 times [2022-11-25 22:36:39,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:36:39,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238456500] [2022-11-25 22:36:39,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:39,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:39,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:36:39,728 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:36:39,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 22:36:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:39,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 22:36:39,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:39,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:36:39,906 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-25 22:36:39,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:36:39,906 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:36:39,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1238456500] [2022-11-25 22:36:39,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1238456500] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:39,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:39,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:36:39,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043286785] [2022-11-25 22:36:39,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:39,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:36:39,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:36:39,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:36:39,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:36:39,914 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-25 22:36:40,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:40,239 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2022-11-25 22:36:40,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:36:40,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 7 [2022-11-25 22:36:40,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:40,241 INFO L225 Difference]: With dead ends: 83 [2022-11-25 22:36:40,242 INFO L226 Difference]: Without dead ends: 83 [2022-11-25 22:36:40,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:36:40,243 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 5 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:40,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 234 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 22:36:40,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-25 22:36:40,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2022-11-25 22:36:40,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 74 states have internal predecessors, (79), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 22:36:40,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-11-25 22:36:40,259 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 7 [2022-11-25 22:36:40,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:40,259 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-11-25 22:36:40,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-25 22:36:40,260 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-11-25 22:36:40,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 22:36:40,261 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:40,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:40,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 22:36:40,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:40,473 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting create_sub_listErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:36:40,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:40,474 INFO L85 PathProgramCache]: Analyzing trace with hash 859208239, now seen corresponding path program 1 times [2022-11-25 22:36:40,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:36:40,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815543343] [2022-11-25 22:36:40,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:40,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:40,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:36:40,481 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:36:40,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 22:36:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:40,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:36:40,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:40,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:36:40,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:40,606 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:36:40,606 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:36:40,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815543343] [2022-11-25 22:36:40,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815543343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:40,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:40,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:36:40,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485696749] [2022-11-25 22:36:40,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:40,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:36:40,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:36:40,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:36:40,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:36:40,613 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-25 22:36:40,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:40,746 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-11-25 22:36:40,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:36:40,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2022-11-25 22:36:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:40,748 INFO L225 Difference]: With dead ends: 82 [2022-11-25 22:36:40,748 INFO L226 Difference]: Without dead ends: 82 [2022-11-25 22:36:40,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-25 22:36:40,749 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:40,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 122 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:36:40,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-25 22:36:40,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2022-11-25 22:36:40,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 47 states have (on average 1.6595744680851063) internal successors, (78), 73 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 22:36:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2022-11-25 22:36:40,755 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 11 [2022-11-25 22:36:40,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:40,756 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2022-11-25 22:36:40,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-25 22:36:40,756 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2022-11-25 22:36:40,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 22:36:40,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:40,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:40,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 22:36:40,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:40,957 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting create_sub_listErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:36:40,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:40,958 INFO L85 PathProgramCache]: Analyzing trace with hash 859208240, now seen corresponding path program 1 times [2022-11-25 22:36:40,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:36:40,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194577702] [2022-11-25 22:36:40,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:40,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:40,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:36:40,960 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:36:40,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 22:36:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:41,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:36:41,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:41,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:36:41,073 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-25 22:36:41,073 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:36:41,073 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:36:41,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194577702] [2022-11-25 22:36:41,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194577702] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:41,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:41,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:36:41,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822267509] [2022-11-25 22:36:41,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:41,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:36:41,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:36:41,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:36:41,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:36:41,075 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-25 22:36:41,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:41,220 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2022-11-25 22:36:41,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:36:41,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2022-11-25 22:36:41,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:41,222 INFO L225 Difference]: With dead ends: 81 [2022-11-25 22:36:41,222 INFO L226 Difference]: Without dead ends: 81 [2022-11-25 22:36:41,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-25 22:36:41,223 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 5 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:41,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 126 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:36:41,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-25 22:36:41,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-11-25 22:36:41,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 72 states have internal predecessors, (77), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 22:36:41,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2022-11-25 22:36:41,229 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 11 [2022-11-25 22:36:41,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:41,230 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2022-11-25 22:36:41,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-25 22:36:41,230 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2022-11-25 22:36:41,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 22:36:41,231 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:41,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:41,244 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-11-25 22:36:41,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:41,435 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting list_add_tailErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:36:41,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:41,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1332328513, now seen corresponding path program 1 times [2022-11-25 22:36:41,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:36:41,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759209341] [2022-11-25 22:36:41,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:41,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:41,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:36:41,438 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:36:41,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 22:36:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:41,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 22:36:41,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:41,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:36:41,714 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 22:36:41,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 22:36:41,772 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-25 22:36:41,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:36:41,772 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:36:41,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759209341] [2022-11-25 22:36:41,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759209341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:41,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:41,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 22:36:41,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618560322] [2022-11-25 22:36:41,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:41,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 22:36:41,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:36:41,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 22:36:41,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:36:41,774 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-25 22:36:42,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:42,265 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2022-11-25 22:36:42,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 22:36:42,266 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 14 [2022-11-25 22:36:42,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:42,267 INFO L225 Difference]: With dead ends: 129 [2022-11-25 22:36:42,267 INFO L226 Difference]: Without dead ends: 129 [2022-11-25 22:36:42,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-25 22:36:42,268 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 108 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:42,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 235 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 22:36:42,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-25 22:36:42,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 90. [2022-11-25 22:36:42,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 56 states have (on average 1.6964285714285714) internal successors, (95), 81 states have internal predecessors, (95), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 22:36:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2022-11-25 22:36:42,274 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 14 [2022-11-25 22:36:42,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:42,274 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2022-11-25 22:36:42,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-25 22:36:42,274 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2022-11-25 22:36:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 22:36:42,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:42,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:42,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-25 22:36:42,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:42,488 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting list_add_tailErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:36:42,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:42,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1332328512, now seen corresponding path program 1 times [2022-11-25 22:36:42,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:36:42,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393610736] [2022-11-25 22:36:42,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:42,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:42,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:36:42,496 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:36:42,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 22:36:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:42,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-25 22:36:42,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:42,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:36:42,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:36:42,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:36:42,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 22:36:42,851 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:36:42,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:36:42,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:42,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:36:42,933 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:36:42,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393610736] [2022-11-25 22:36:42,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393610736] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:42,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:42,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 22:36:42,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102244541] [2022-11-25 22:36:42,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:42,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 22:36:42,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:36:42,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 22:36:42,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:36:42,936 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-25 22:36:43,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:43,617 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2022-11-25 22:36:43,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 22:36:43,618 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 14 [2022-11-25 22:36:43,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:43,619 INFO L225 Difference]: With dead ends: 117 [2022-11-25 22:36:43,619 INFO L226 Difference]: Without dead ends: 117 [2022-11-25 22:36:43,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-25 22:36:43,620 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 52 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:43,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 298 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 22:36:43,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-25 22:36:43,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2022-11-25 22:36:43,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 71 states have (on average 1.676056338028169) internal successors, (119), 97 states have internal predecessors, (119), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 22:36:43,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2022-11-25 22:36:43,626 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 14 [2022-11-25 22:36:43,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:43,627 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2022-11-25 22:36:43,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-25 22:36:43,627 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2022-11-25 22:36:43,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 22:36:43,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:43,628 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:43,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 22:36:43,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:43,850 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting list_add_tailErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:36:43,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:43,850 INFO L85 PathProgramCache]: Analyzing trace with hash -467443808, now seen corresponding path program 1 times [2022-11-25 22:36:43,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:36:43,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163526426] [2022-11-25 22:36:43,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:43,851 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:43,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:36:43,852 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:36:43,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 22:36:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:43,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:36:43,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:44,011 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-25 22:36:44,012 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:36:44,012 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:36:44,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163526426] [2022-11-25 22:36:44,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163526426] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:44,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:44,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:36:44,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081827712] [2022-11-25 22:36:44,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:44,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:36:44,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:36:44,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:36:44,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:36:44,014 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 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-25 22:36:44,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:44,158 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2022-11-25 22:36:44,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:36:44,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 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 16 [2022-11-25 22:36:44,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:44,161 INFO L225 Difference]: With dead ends: 107 [2022-11-25 22:36:44,162 INFO L226 Difference]: Without dead ends: 107 [2022-11-25 22:36:44,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-25 22:36:44,162 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 27 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:44,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 154 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:36:44,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-25 22:36:44,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-11-25 22:36:44,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.6338028169014085) internal successors, (116), 96 states have internal predecessors, (116), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 22:36:44,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 126 transitions. [2022-11-25 22:36:44,168 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 126 transitions. Word has length 16 [2022-11-25 22:36:44,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:44,168 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 126 transitions. [2022-11-25 22:36:44,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 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-25 22:36:44,168 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 126 transitions. [2022-11-25 22:36:44,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 22:36:44,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:44,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:44,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 22:36:44,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:44,382 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting list_add_tailErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:36:44,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:44,383 INFO L85 PathProgramCache]: Analyzing trace with hash -467443807, now seen corresponding path program 1 times [2022-11-25 22:36:44,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:36:44,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128525114] [2022-11-25 22:36:44,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:44,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:44,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:36:44,384 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:36:44,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 22:36:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:44,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 22:36:44,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:44,661 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-25 22:36:44,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:36:44,661 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:36:44,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128525114] [2022-11-25 22:36:44,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128525114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:44,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:44,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 22:36:44,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219837427] [2022-11-25 22:36:44,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:44,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 22:36:44,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:36:44,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 22:36:44,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-25 22:36:44,663 INFO L87 Difference]: Start difference. First operand 107 states and 126 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 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-25 22:36:45,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:45,138 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2022-11-25 22:36:45,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 22:36:45,139 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 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 16 [2022-11-25 22:36:45,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:45,140 INFO L225 Difference]: With dead ends: 115 [2022-11-25 22:36:45,140 INFO L226 Difference]: Without dead ends: 115 [2022-11-25 22:36:45,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-11-25 22:36:45,141 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 113 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:45,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 456 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 22:36:45,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-25 22:36:45,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2022-11-25 22:36:45,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.619718309859155) internal successors, (115), 96 states have internal predecessors, (115), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 22:36:45,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 125 transitions. [2022-11-25 22:36:45,146 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 125 transitions. Word has length 16 [2022-11-25 22:36:45,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:45,146 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 125 transitions. [2022-11-25 22:36:45,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 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-25 22:36:45,147 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 125 transitions. [2022-11-25 22:36:45,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 22:36:45,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:45,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:45,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-25 22:36:45,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:45,348 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting list_add_tailErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:36:45,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:45,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1605856063, now seen corresponding path program 1 times [2022-11-25 22:36:45,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:36:45,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653466392] [2022-11-25 22:36:45,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:45,349 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:45,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:36:45,350 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:36:45,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-25 22:36:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:45,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 22:36:45,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:45,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:36:45,546 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-25 22:36:45,546 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:36:45,546 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:36:45,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653466392] [2022-11-25 22:36:45,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653466392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:45,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:45,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 22:36:45,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140516933] [2022-11-25 22:36:45,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:45,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:36:45,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:36:45,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:36:45,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:36:45,549 INFO L87 Difference]: Start difference. First operand 107 states and 125 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-25 22:36:45,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:45,890 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2022-11-25 22:36:45,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:36:45,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 17 [2022-11-25 22:36:45,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:45,891 INFO L225 Difference]: With dead ends: 114 [2022-11-25 22:36:45,891 INFO L226 Difference]: Without dead ends: 114 [2022-11-25 22:36:45,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:36:45,892 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 49 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:45,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 226 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 22:36:45,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-25 22:36:45,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2022-11-25 22:36:45,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 71 states have (on average 1.5492957746478873) internal successors, (110), 95 states have internal predecessors, (110), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 22:36:45,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2022-11-25 22:36:45,899 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 17 [2022-11-25 22:36:45,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:45,900 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2022-11-25 22:36:45,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-25 22:36:45,900 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2022-11-25 22:36:45,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 22:36:45,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:45,901 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:45,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-25 22:36:46,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:46,113 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting list_add_tailErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:36:46,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:46,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1605856062, now seen corresponding path program 1 times [2022-11-25 22:36:46,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:36:46,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949383053] [2022-11-25 22:36:46,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:46,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:46,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:36:46,115 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:36:46,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-25 22:36:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:46,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 22:36:46,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:46,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:36:46,349 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-25 22:36:46,349 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:36:46,350 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:36:46,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949383053] [2022-11-25 22:36:46,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949383053] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:46,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:46,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 22:36:46,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849892766] [2022-11-25 22:36:46,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:46,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:36:46,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:36:46,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:36:46,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:36:46,352 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-25 22:36:46,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:46,744 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2022-11-25 22:36:46,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:36:46,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 17 [2022-11-25 22:36:46,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:46,746 INFO L225 Difference]: With dead ends: 112 [2022-11-25 22:36:46,746 INFO L226 Difference]: Without dead ends: 112 [2022-11-25 22:36:46,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:36:46,747 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 36 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:46,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 246 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 22:36:46,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-25 22:36:46,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2022-11-25 22:36:46,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 95 states have internal predecessors, (106), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 22:36:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2022-11-25 22:36:46,752 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 17 [2022-11-25 22:36:46,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:46,752 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2022-11-25 22:36:46,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-25 22:36:46,753 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2022-11-25 22:36:46,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 22:36:46,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:46,754 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-25 22:36:46,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-25 22:36:46,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:46,967 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting list_add_tailErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:36:46,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:46,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1334414076, now seen corresponding path program 1 times [2022-11-25 22:36:46,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:36:46,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660745353] [2022-11-25 22:36:46,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:46,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:46,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:36:46,970 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:36:46,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-25 22:36:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:47,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-25 22:36:47,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:47,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:36:47,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:36:47,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:36:47,293 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:36:47,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:36:47,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:36:47,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 22:36:47,491 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-25 22:36:47,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:36:47,491 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:36:47,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660745353] [2022-11-25 22:36:47,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660745353] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:47,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:47,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 22:36:47,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019337897] [2022-11-25 22:36:47,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:47,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 22:36:47,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:36:47,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 22:36:47,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-11-25 22:36:47,493 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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-25 22:36:48,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:48,554 INFO L93 Difference]: Finished difference Result 162 states and 177 transitions. [2022-11-25 22:36:48,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 22:36:48,555 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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 19 [2022-11-25 22:36:48,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:48,558 INFO L225 Difference]: With dead ends: 162 [2022-11-25 22:36:48,558 INFO L226 Difference]: Without dead ends: 162 [2022-11-25 22:36:48,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-11-25 22:36:48,559 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 80 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:48,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 356 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 22:36:48,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-11-25 22:36:48,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 128. [2022-11-25 22:36:48,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 115 states have internal predecessors, (130), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-25 22:36:48,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2022-11-25 22:36:48,571 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 19 [2022-11-25 22:36:48,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:48,572 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2022-11-25 22:36:48,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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-25 22:36:48,572 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2022-11-25 22:36:48,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 22:36:48,573 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:48,573 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-25 22:36:48,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-25 22:36:48,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:48,786 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:36:48,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:48,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1334414075, now seen corresponding path program 1 times [2022-11-25 22:36:48,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:36:48,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080051809] [2022-11-25 22:36:48,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:48,787 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:48,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:36:48,788 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:36:48,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-25 22:36:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:49,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-25 22:36:49,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:49,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:36:49,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:36:49,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:36:49,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:36:49,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:36:49,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:36:49,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:36:49,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:36:49,236 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:36:49,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:36:49,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 22:36:49,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 22:36:49,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 22:36:49,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:36:49,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:36:49,548 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-25 22:36:49,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:36:49,548 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:36:49,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080051809] [2022-11-25 22:36:49,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080051809] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:49,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:49,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 22:36:49,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303279633] [2022-11-25 22:36:49,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:49,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 22:36:49,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:36:49,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 22:36:49,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-11-25 22:36:49,550 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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-25 22:36:50,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:50,769 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2022-11-25 22:36:50,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 22:36:50,770 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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 19 [2022-11-25 22:36:50,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:50,771 INFO L225 Difference]: With dead ends: 131 [2022-11-25 22:36:50,771 INFO L226 Difference]: Without dead ends: 131 [2022-11-25 22:36:50,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-11-25 22:36:50,772 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 33 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:50,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 426 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 22:36:50,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-25 22:36:50,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-11-25 22:36:50,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 118 states have internal predecessors, (131), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-25 22:36:50,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 145 transitions. [2022-11-25 22:36:50,778 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 145 transitions. Word has length 19 [2022-11-25 22:36:50,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:50,778 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 145 transitions. [2022-11-25 22:36:50,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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-25 22:36:50,778 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2022-11-25 22:36:50,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 22:36:50,779 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:50,780 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:50,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-25 22:36:50,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:50,992 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:36:50,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:50,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1965497160, now seen corresponding path program 1 times [2022-11-25 22:36:50,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:36:50,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306546442] [2022-11-25 22:36:50,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:50,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:36:50,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:36:50,994 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:36:50,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-25 22:36:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:51,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 22:36:51,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:51,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:36:51,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:36:51,321 WARN L859 $PredicateComparison]: unable to prove that (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_448 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_448))) (= (_ bv0 1) (select |c_old(#valid)| |create_sub_list_insert_sub_~sub~0#1.base|)))) is different from true [2022-11-25 22:36:51,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:36:51,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:36:51,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 22:36:51,412 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:36:51,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:36:51,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:51,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:36:53,999 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:36:53,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306546442] [2022-11-25 22:36:53,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306546442] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:36:54,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1368667278] [2022-11-25 22:36:54,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:54,000 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:36:54,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:36:54,004 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:36:54,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2022-11-25 22:36:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:54,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-25 22:36:54,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:54,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:36:54,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:36:54,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:36:55,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:36:55,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 22:36:55,113 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:36:55,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:36:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:55,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:36:56,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1368667278] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:36:56,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103589548] [2022-11-25 22:36:56,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:56,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:36:56,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:36:56,023 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:36:56,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-25 22:36:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:56,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-25 22:36:56,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:56,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:36:56,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:36:56,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:36:56,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:36:56,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 22:36:56,540 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:36:56,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:36:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:56,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:36:57,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103589548] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:36:57,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:36:57,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 11] total 13 [2022-11-25 22:36:57,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007977340] [2022-11-25 22:36:57,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:36:57,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 22:36:57,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:36:57,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 22:36:57,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=4, NotChecked=32, Total=342 [2022-11-25 22:36:57,259 INFO L87 Difference]: Start difference. First operand 131 states and 145 transitions. Second operand has 14 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 22:37:00,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:37:04,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:37:07,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:37:07,079 INFO L93 Difference]: Finished difference Result 146 states and 164 transitions. [2022-11-25 22:37:07,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 22:37:07,080 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-11-25 22:37:07,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:37:07,082 INFO L225 Difference]: With dead ends: 146 [2022-11-25 22:37:07,082 INFO L226 Difference]: Without dead ends: 146 [2022-11-25 22:37:07,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=80, Invalid=470, Unknown=6, NotChecked=44, Total=600 [2022-11-25 22:37:07,083 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 64 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:37:07,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 394 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 412 Invalid, 2 Unknown, 86 Unchecked, 5.3s Time] [2022-11-25 22:37:07,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-25 22:37:07,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 139. [2022-11-25 22:37:07,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 99 states have (on average 1.393939393939394) internal successors, (138), 123 states have internal predecessors, (138), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-25 22:37:07,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 155 transitions. [2022-11-25 22:37:07,088 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 155 transitions. Word has length 29 [2022-11-25 22:37:07,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:37:07,088 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 155 transitions. [2022-11-25 22:37:07,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 22:37:07,089 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 155 transitions. [2022-11-25 22:37:07,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 22:37:07,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:37:07,089 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:37:07,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2022-11-25 22:37:07,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-25 22:37:07,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-25 22:37:07,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:37:07,690 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting list_add_tailErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:37:07,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:37:07,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1572542800, now seen corresponding path program 1 times [2022-11-25 22:37:07,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:37:07,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207616561] [2022-11-25 22:37:07,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:37:07,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:37:07,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:37:07,692 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:37:07,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-25 22:37:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:37:08,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-25 22:37:08,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:37:08,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:37:08,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:37:08,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 22:37:08,347 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:37:08,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:37:08,535 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:37:08,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:37:14,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2022-11-25 22:37:14,139 INFO L321 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2022-11-25 22:37:14,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 97 [2022-11-25 22:37:14,890 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-25 22:37:14,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2022-11-25 22:37:15,087 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:37:15,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207616561] [2022-11-25 22:37:15,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207616561] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:37:15,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1924879222] [2022-11-25 22:37:15,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:37:15,088 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:37:15,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:37:15,089 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:37:15,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2022-11-25 22:37:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:37:15,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-25 22:37:15,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:37:15,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:37:15,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:37:16,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:37:16,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:37:16,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 22:37:16,596 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:37:16,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:37:16,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:37:16,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 22:37:16,891 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:37:16,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:37:17,183 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:37:17,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:37:22,877 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:37:22,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 68 [2022-11-25 22:37:27,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1924879222] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:37:27,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700060201] [2022-11-25 22:37:27,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:37:27,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:37:27,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:37:27,587 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:37:27,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-25 22:37:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:37:27,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-25 22:37:27,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:37:27,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:37:27,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 22:37:27,973 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:37:27,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:37:28,014 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:37:28,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:37:30,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2022-11-25 22:37:30,940 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-25 22:37:30,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2022-11-25 22:37:30,983 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-25 22:37:30,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2022-11-25 22:37:31,009 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:37:31,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700060201] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:37:31,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 4 imperfect interpolant sequences. [2022-11-25 22:37:31,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14] total 33 [2022-11-25 22:37:31,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595877026] [2022-11-25 22:37:31,010 INFO L85 oduleStraightlineAll]: Using 4 imperfect interpolants to construct interpolant automaton [2022-11-25 22:37:31,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-25 22:37:31,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:37:31,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-25 22:37:31,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1351, Unknown=3, NotChecked=0, Total=1482 [2022-11-25 22:37:31,012 INFO L87 Difference]: Start difference. First operand 139 states and 155 transitions. Second operand has 34 states, 31 states have (on average 1.967741935483871) internal successors, (61), 25 states have internal predecessors, (61), 10 states have call successors, (11), 8 states have call predecessors, (11), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 22:37:48,929 WARN L233 SmtUtils]: Spent 15.39s on a formula simplification. DAG size of input: 63 DAG size of output: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:37:51,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:37:53,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:37:55,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:37:57,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:37:58,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:38:02,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:38:04,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:38:06,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:38:08,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:38:10,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:38:14,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:38:19,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:38:19,296 INFO L93 Difference]: Finished difference Result 252 states and 272 transitions. [2022-11-25 22:38:19,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 22:38:19,297 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 1.967741935483871) internal successors, (61), 25 states have internal predecessors, (61), 10 states have call successors, (11), 8 states have call predecessors, (11), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 36 [2022-11-25 22:38:19,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:38:19,299 INFO L225 Difference]: With dead ends: 252 [2022-11-25 22:38:19,299 INFO L226 Difference]: Without dead ends: 252 [2022-11-25 22:38:19,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 126 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 38.9s TimeCoverageRelationStatistics Valid=419, Invalid=3238, Unknown=3, NotChecked=0, Total=3660 [2022-11-25 22:38:19,301 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 566 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 90 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:38:19,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 662 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1453 Invalid, 16 Unknown, 0 Unchecked, 28.5s Time] [2022-11-25 22:38:19,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-25 22:38:19,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 167. [2022-11-25 22:38:19,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 124 states have (on average 1.3387096774193548) internal successors, (166), 148 states have internal predecessors, (166), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (11), 8 states have call predecessors, (11), 10 states have call successors, (11) [2022-11-25 22:38:19,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 187 transitions. [2022-11-25 22:38:19,309 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 187 transitions. Word has length 36 [2022-11-25 22:38:19,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:38:19,309 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 187 transitions. [2022-11-25 22:38:19,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 1.967741935483871) internal successors, (61), 25 states have internal predecessors, (61), 10 states have call successors, (11), 8 states have call predecessors, (11), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 22:38:19,309 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 187 transitions. [2022-11-25 22:38:19,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 22:38:19,310 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:38:19,310 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:38:19,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-25 22:38:19,529 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-25 22:38:19,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2022-11-25 22:38:19,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 22:38:19,923 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting list_add_tailErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:38:19,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:38:19,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1746009876, now seen corresponding path program 1 times [2022-11-25 22:38:19,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:38:19,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534036423] [2022-11-25 22:38:19,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:38:19,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:38:19,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:38:19,926 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:38:19,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-25 22:38:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:38:20,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-25 22:38:20,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:38:20,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:38:20,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:38:20,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:38:20,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:38:20,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:38:20,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:38:20,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:38:20,569 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:38:20,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:38:20,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:38:20,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:38:20,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:38:20,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:38:22,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 36 [2022-11-25 22:38:22,131 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2022-11-25 22:38:22,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 128 [2022-11-25 22:38:22,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 96 [2022-11-25 22:38:22,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2022-11-25 22:38:22,550 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-11-25 22:38:22,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 51 [2022-11-25 22:38:22,826 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 22:38:22,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 91 [2022-11-25 22:38:23,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-25 22:38:23,478 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:38:23,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:38:27,887 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:38:27,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534036423] [2022-11-25 22:38:27,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534036423] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:38:27,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1207937763] [2022-11-25 22:38:27,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:38:27,888 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:38:27,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:38:27,889 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:38:27,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2022-11-25 22:38:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:38:28,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 79 conjunts are in the unsatisfiable core [2022-11-25 22:38:28,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:38:28,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:38:28,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:38:28,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:38:28,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:38:28,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:38:28,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:38:28,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:38:28,849 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:38:28,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:38:28,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:38:28,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:38:28,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:38:28,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:38:29,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 36 [2022-11-25 22:38:29,949 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2022-11-25 22:38:29,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 128 [2022-11-25 22:38:29,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 96 [2022-11-25 22:38:29,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2022-11-25 22:38:30,428 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-11-25 22:38:30,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 51 [2022-11-25 22:38:30,790 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 22:38:30,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 91 [2022-11-25 22:38:30,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-25 22:38:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:38:31,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:38:31,135 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1082 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1082) |c_create_sub_list_insert_sub_~head#1.base|) (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|)))) (_ bv0 1))) is different from false [2022-11-25 22:38:32,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1207937763] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:38:32,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526308688] [2022-11-25 22:38:32,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:38:32,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:38:32,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:38:32,967 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:38:32,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-25 22:38:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:38:33,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-25 22:38:33,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:38:33,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:38:33,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:38:33,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:38:33,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:38:33,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:38:33,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:38:33,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:38:33,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:38:33,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:38:33,948 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:38:33,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:38:34,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:38:34,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:38:34,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:38:34,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:38:34,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 36 [2022-11-25 22:38:35,014 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2022-11-25 22:38:35,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 128 [2022-11-25 22:38:35,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 96 [2022-11-25 22:38:35,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2022-11-25 22:38:35,485 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-11-25 22:38:35,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 51 [2022-11-25 22:38:35,800 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 22:38:35,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 66 [2022-11-25 22:38:36,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2022-11-25 22:38:37,231 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:38:37,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:38:39,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526308688] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:38:39,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:38:39,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 22] total 35 [2022-11-25 22:38:39,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237832499] [2022-11-25 22:38:39,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:38:39,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-25 22:38:39,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:38:39,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-25 22:38:39,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1952, Unknown=57, NotChecked=90, Total=2256 [2022-11-25 22:38:39,698 INFO L87 Difference]: Start difference. First operand 167 states and 187 transitions. Second operand has 36 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 31 states have internal predecessors, (55), 5 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 22:38:50,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:38:50,543 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2022-11-25 22:38:50,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-25 22:38:50,544 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 31 states have internal predecessors, (55), 5 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-11-25 22:38:50,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:38:50,546 INFO L225 Difference]: With dead ends: 182 [2022-11-25 22:38:50,546 INFO L226 Difference]: Without dead ends: 182 [2022-11-25 22:38:50,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 88 SyntacticMatches, 10 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=359, Invalid=3714, Unknown=91, NotChecked=126, Total=4290 [2022-11-25 22:38:50,549 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 94 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 29 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:38:50,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 875 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1022 Invalid, 20 Unknown, 0 Unchecked, 5.5s Time] [2022-11-25 22:38:50,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-11-25 22:38:50,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2022-11-25 22:38:50,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 136 states have (on average 1.3161764705882353) internal successors, (179), 161 states have internal predecessors, (179), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2022-11-25 22:38:50,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 202 transitions. [2022-11-25 22:38:50,556 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 202 transitions. Word has length 35 [2022-11-25 22:38:50,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:38:50,556 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 202 transitions. [2022-11-25 22:38:50,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 31 states have internal predecessors, (55), 5 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 22:38:50,557 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 202 transitions. [2022-11-25 22:38:50,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 22:38:50,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:38:50,558 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:38:50,572 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-25 22:38:50,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-25 22:38:50,972 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2022-11-25 22:38:51,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 22:38:51,168 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:38:51,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:38:51,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1746009877, now seen corresponding path program 1 times [2022-11-25 22:38:51,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:38:51,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387791560] [2022-11-25 22:38:51,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:38:51,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:38:51,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:38:51,170 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:38:51,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-25 22:38:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:38:51,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-25 22:38:51,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:38:51,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:38:51,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:38:51,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:38:51,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:38:51,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:38:51,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:38:51,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:38:51,862 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:38:51,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:38:51,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:38:52,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:38:52,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:38:52,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:38:52,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:38:54,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 91 [2022-11-25 22:38:54,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:38:54,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-11-25 22:38:54,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 38 [2022-11-25 22:38:54,168 INFO L321 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-11-25 22:38:54,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 125 [2022-11-25 22:38:54,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:38:54,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 89 [2022-11-25 22:38:54,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:38:54,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-11-25 22:38:54,563 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-25 22:38:54,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-11-25 22:38:54,616 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-25 22:38:54,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2022-11-25 22:38:54,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 22:38:54,854 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 22:38:54,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 64 [2022-11-25 22:38:55,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-25 22:38:55,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:38:55,494 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:38:55,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:38:56,676 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (and (forall ((v_ArrVal_1334 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1334) |c_create_sub_list_insert_sub_~head#1.base|) .cse1))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_1335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1334 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1334) |c_create_sub_list_insert_sub_~head#1.base|) .cse1) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1335) |c_create_sub_list_insert_sub_~head#1.base|) .cse1)))))) is different from false [2022-11-25 22:39:07,797 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:39:07,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387791560] [2022-11-25 22:39:07,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387791560] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:39:07,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1466463983] [2022-11-25 22:39:07,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:39:07,797 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:39:07,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:39:07,798 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:39:07,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-11-25 22:39:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:39:09,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-25 22:39:09,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:39:09,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:39:09,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:39:09,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:39:09,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:39:09,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:39:09,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:39:09,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:39:09,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:39:09,268 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:39:09,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:39:09,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:39:09,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:39:09,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:39:09,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:39:14,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 86 [2022-11-25 22:39:14,774 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2022-11-25 22:39:14,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 162 treesize of output 188 [2022-11-25 22:39:14,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 144 [2022-11-25 22:39:14,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 62 [2022-11-25 22:39:14,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:39:14,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2022-11-25 22:39:14,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:39:14,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-11-25 22:39:15,442 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-25 22:39:15,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-11-25 22:39:15,495 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-25 22:39:15,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2022-11-25 22:39:15,866 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 22:39:15,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 64 [2022-11-25 22:39:15,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 22:39:15,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-25 22:39:15,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:39:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:39:16,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:39:16,492 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (and (forall ((v_ArrVal_1475 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1475) |c_create_sub_list_insert_sub_~head#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1475 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1475) |c_create_sub_list_insert_sub_~head#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1474) |c_create_sub_list_insert_sub_~head#1.base|) .cse1)))))) is different from false [2022-11-25 22:39:16,580 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_create_sub_list_~sub#1.offset|))) (and (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_44| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_44|) (_ bv0 1))) (forall ((v_ArrVal_1474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1473 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |v_create_sub_list_insert_sub_~sub~0#1.base_44| v_ArrVal_1475) |c_create_sub_list_~sub#1.base|) .cse0)) (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_44| v_ArrVal_1473) (select (select (store |c_#memory_$Pointer$.base| |v_create_sub_list_insert_sub_~sub~0#1.base_44| v_ArrVal_1474) |c_create_sub_list_~sub#1.base|) .cse0)))))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_44| (_ BitVec 32))) (or (forall ((v_ArrVal_1475 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |v_create_sub_list_insert_sub_~sub~0#1.base_44| v_ArrVal_1475) |c_create_sub_list_~sub#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_44|) (_ bv0 1))))))) is different from false [2022-11-25 22:39:26,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1466463983] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:39:26,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847912410] [2022-11-25 22:39:26,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:39:26,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:39:26,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:39:26,601 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:39:26,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-25 22:39:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:39:26,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-25 22:39:26,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:39:26,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:39:26,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:39:27,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:39:27,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:39:28,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:39:28,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:39:28,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:39:28,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:39:28,435 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:39:28,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:39:28,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 22:39:28,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:39:28,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:39:28,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:39:28,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:39:28,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:39:28,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:39:38,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 79 [2022-11-25 22:39:38,529 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2022-11-25 22:39:38,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 152 treesize of output 180 [2022-11-25 22:39:38,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 60 [2022-11-25 22:39:38,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:39:38,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 102 [2022-11-25 22:39:38,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:39:38,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:39:38,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2022-11-25 22:39:38,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:39:38,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-11-25 22:39:39,444 INFO L321 Elim1Store]: treesize reduction 26, result has 33.3 percent of original size [2022-11-25 22:39:39,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 26 [2022-11-25 22:39:39,477 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 22:39:39,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-11-25 22:39:40,058 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 22:39:40,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 58 [2022-11-25 22:39:40,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 22:39:41,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-25 22:39:41,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:39:42,586 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:39:42,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:39:42,735 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (and (forall ((v_ArrVal_1618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1617 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1618) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1617) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)))) (forall ((v_ArrVal_1618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1618) |c_create_sub_list_insert_sub_~head#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) is different from false [2022-11-25 22:40:03,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847912410] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:40:03,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:40:03,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 50 [2022-11-25 22:40:03,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480218884] [2022-11-25 22:40:03,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:40:03,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-25 22:40:03,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:40:03,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-25 22:40:03,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=3384, Unknown=65, NotChecked=484, Total=4160 [2022-11-25 22:40:03,033 INFO L87 Difference]: Start difference. First operand 181 states and 202 transitions. Second operand has 51 states, 48 states have (on average 1.5625) internal successors, (75), 45 states have internal predecessors, (75), 6 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:40:25,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:40:25,065 INFO L93 Difference]: Finished difference Result 181 states and 201 transitions. [2022-11-25 22:40:25,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 22:40:25,071 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 1.5625) internal successors, (75), 45 states have internal predecessors, (75), 6 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-11-25 22:40:25,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:40:25,072 INFO L225 Difference]: With dead ends: 181 [2022-11-25 22:40:25,073 INFO L226 Difference]: Without dead ends: 181 [2022-11-25 22:40:25,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1510 ImplicationChecksByTransitivity, 56.1s TimeCoverageRelationStatistics Valid=367, Invalid=4832, Unknown=73, NotChecked=580, Total=5852 [2022-11-25 22:40:25,075 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 78 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 21 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:40:25,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1187 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1578 Invalid, 21 Unknown, 0 Unchecked, 11.5s Time] [2022-11-25 22:40:25,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-25 22:40:25,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-11-25 22:40:25,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 136 states have (on average 1.3088235294117647) internal successors, (178), 161 states have internal predecessors, (178), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2022-11-25 22:40:25,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 201 transitions. [2022-11-25 22:40:25,082 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 201 transitions. Word has length 35 [2022-11-25 22:40:25,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:40:25,083 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 201 transitions. [2022-11-25 22:40:25,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 1.5625) internal successors, (75), 45 states have internal predecessors, (75), 6 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:40:25,083 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 201 transitions. [2022-11-25 22:40:25,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 22:40:25,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:40:25,084 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:40:25,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-11-25 22:40:25,296 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2022-11-25 22:40:25,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-25 22:40:25,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:40:25,692 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting list_add_tailErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:40:25,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:40:25,692 INFO L85 PathProgramCache]: Analyzing trace with hash -614855375, now seen corresponding path program 1 times [2022-11-25 22:40:25,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:40:25,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166274876] [2022-11-25 22:40:25,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:40:25,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:40:25,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:40:25,694 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:40:25,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-11-25 22:40:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:40:25,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 22:40:25,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:40:26,209 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:40:26,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:40:26,210 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:40:26,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166274876] [2022-11-25 22:40:26,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166274876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:40:26,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:40:26,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 22:40:26,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865023775] [2022-11-25 22:40:26,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:40:26,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 22:40:26,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:40:26,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 22:40:26,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-25 22:40:26,212 INFO L87 Difference]: Start difference. First operand 181 states and 201 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:40:26,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:40:26,993 INFO L93 Difference]: Finished difference Result 184 states and 198 transitions. [2022-11-25 22:40:26,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 22:40:26,994 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-11-25 22:40:26,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:40:26,995 INFO L225 Difference]: With dead ends: 184 [2022-11-25 22:40:26,996 INFO L226 Difference]: Without dead ends: 184 [2022-11-25 22:40:26,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-11-25 22:40:26,996 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 99 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:40:26,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 552 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 22:40:26,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-11-25 22:40:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2022-11-25 22:40:27,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 136 states have (on average 1.2794117647058822) internal successors, (174), 161 states have internal predecessors, (174), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2022-11-25 22:40:27,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 197 transitions. [2022-11-25 22:40:27,003 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 197 transitions. Word has length 38 [2022-11-25 22:40:27,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:40:27,004 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 197 transitions. [2022-11-25 22:40:27,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:40:27,004 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 197 transitions. [2022-11-25 22:40:27,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 22:40:27,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:40:27,005 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:40:27,024 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-11-25 22:40:27,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:40:27,219 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:40:27,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:40:27,219 INFO L85 PathProgramCache]: Analyzing trace with hash 879107445, now seen corresponding path program 1 times [2022-11-25 22:40:27,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:40:27,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088297724] [2022-11-25 22:40:27,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:40:27,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:40:27,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:40:27,221 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:40:27,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-25 22:40:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:40:27,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-25 22:40:27,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:40:28,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:40:28,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:40:28,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:28,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:40:28,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:28,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:40:28,184 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:40:28,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:40:28,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:40:28,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:40:28,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:40:28,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:40:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:40:28,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:40:29,199 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:40:29,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2022-11-25 22:40:29,935 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (and (forall ((v_ArrVal_1838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_create_sub_list_insert_sub_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1838) |c_create_sub_list_insert_sub_~head#1.base|) .cse0))) (forall ((v_ArrVal_1837 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1837) |c_create_sub_list_insert_sub_~head#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))) (forall ((v_ArrVal_1837 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1837) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)) (bvadd (_ bv8 32) |c_create_sub_list_insert_sub_~head#1.offset|))))) is different from false [2022-11-25 22:40:35,268 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:40:35,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2022-11-25 22:40:35,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-11-25 22:40:35,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:40:35,324 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:40:35,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-25 22:40:35,329 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:35,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2022-11-25 22:40:35,405 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:40:35,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2022-11-25 22:40:35,411 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:35,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-25 22:40:36,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:40:36,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 62 [2022-11-25 22:40:37,236 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-25 22:40:37,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2022-11-25 22:40:37,311 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-25 22:40:37,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2022-11-25 22:40:37,364 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 22:40:37,365 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:40:37,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088297724] [2022-11-25 22:40:37,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088297724] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:40:37,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1393157904] [2022-11-25 22:40:37,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:40:37,365 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:40:37,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:40:37,367 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:40:37,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-11-25 22:40:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:40:39,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-25 22:40:39,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:40:39,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:40:39,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:40:39,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:40:40,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:40,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 22:40:40,415 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:40:40,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:40:40,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:40:40,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:40:40,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:40,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:40:41,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:41,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:40:41,064 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:40:41,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:40:41,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 22:40:41,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:40:41,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:40:41,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:40:41,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:40:42,337 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:40:42,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:40:43,422 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (and (forall ((v_ArrVal_1956 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1956) |c_create_sub_list_insert_sub_~head#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1956 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1956) |c_create_sub_list_insert_sub_~head#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1955) |c_create_sub_list_insert_sub_~head#1.base|) .cse1)))))) is different from false [2022-11-25 22:40:47,090 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:40:47,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 60 [2022-11-25 22:40:47,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 82 [2022-11-25 22:40:47,125 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:40:47,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 70 [2022-11-25 22:40:47,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 90 [2022-11-25 22:40:47,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2022-11-25 22:40:47,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2022-11-25 22:40:47,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:40:47,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-25 22:40:47,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 32 [2022-11-25 22:40:47,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-25 22:41:11,273 WARN L233 SmtUtils]: Spent 19.90s on a formula simplification. DAG size of input: 51 DAG size of output: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:41:23,712 WARN L233 SmtUtils]: Spent 7.41s on a formula simplification. DAG size of input: 36 DAG size of output: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:41:29,314 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:41:29,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 94 [2022-11-25 22:41:33,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1393157904] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:41:33,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050030498] [2022-11-25 22:41:33,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:41:33,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:41:33,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:41:33,479 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:41:33,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-25 22:41:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:41:33,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-25 22:41:33,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:41:33,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:41:33,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:41:33,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:33,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:41:33,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:33,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:41:33,987 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:41:33,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:41:34,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:41:34,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:41:34,163 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:34,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-25 22:41:34,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:34,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-25 22:41:34,484 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:41:34,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:41:34,589 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:41:34,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2022-11-25 22:41:34,752 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (and (forall ((v_ArrVal_2074 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2074) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)) (bvadd (_ bv8 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (forall ((v_ArrVal_2074 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2074) |c_create_sub_list_insert_sub_~head#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))) (forall ((v_ArrVal_2075 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_create_sub_list_insert_sub_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2075) |c_create_sub_list_insert_sub_~head#1.base|) .cse0))))) is different from false [2022-11-25 22:41:37,588 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:41:37,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2022-11-25 22:41:37,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-11-25 22:41:37,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:41:37,630 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:41:37,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2022-11-25 22:41:37,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:37,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-25 22:41:37,675 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:41:37,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-25 22:41:37,682 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:37,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2022-11-25 22:41:38,003 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:41:38,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 62 [2022-11-25 22:41:38,201 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-25 22:41:38,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2022-11-25 22:41:38,259 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-25 22:41:38,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2022-11-25 22:41:38,309 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 22:41:38,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050030498] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:41:38,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2022-11-25 22:41:38,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18, 17, 18] total 47 [2022-11-25 22:41:38,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009479486] [2022-11-25 22:41:38,310 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2022-11-25 22:41:38,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-25 22:41:38,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:41:38,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-25 22:41:38,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2762, Unknown=36, NotChecked=324, Total=3306 [2022-11-25 22:41:38,313 INFO L87 Difference]: Start difference. First operand 181 states and 197 transitions. Second operand has 48 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 39 states have internal predecessors, (83), 10 states have call successors, (11), 8 states have call predecessors, (11), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 22:41:59,133 WARN L233 SmtUtils]: Spent 11.97s on a formula simplification. DAG size of input: 163 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:41:59,963 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_create_sub_list_#in~sub#1.base|)) (.cse5 (bvadd (_ bv8 32) |c_create_sub_list_insert_sub_~head#1.offset|)) (.cse1 (bvadd (_ bv4 32) |c_create_sub_list_#in~sub#1.offset|)) (.cse2 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_50| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_50|))))) (.cse3 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (and (exists ((v_ArrVal_1945 (_ BitVec 32)) (|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1945)) (= (_ bv0 1) (select |c_old(#valid)| |create_sub_list_insert_sub_~sub~0#1.base|)))) (= |c_create_sub_list_#in~sub#1.base| |c_create_sub_list_~sub#1.base|) (= (bvadd .cse0 (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 1) .cse0)) (or (bvule .cse1 (bvadd (_ bv8 32) |c_create_sub_list_#in~sub#1.offset|)) .cse2) (forall ((v_ArrVal_1838 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_create_sub_list_insert_sub_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1838) |c_create_sub_list_insert_sub_~head#1.base|) .cse3))) (forall ((v_ArrVal_1837 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1837) |c_create_sub_list_insert_sub_~head#1.base|) .cse3))) (bvule .cse4 (bvadd (_ bv4 32) .cse4)))) (forall ((v_ArrVal_1837 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1837) |c_create_sub_list_insert_sub_~head#1.base|) .cse3)) .cse5)) (forall ((v_ArrVal_2074 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2074) |c_create_sub_list_insert_sub_~head#1.base|) .cse3)) .cse5)) (forall ((v_ArrVal_2074 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2074) |c_create_sub_list_insert_sub_~head#1.base|) .cse3))) (bvule .cse6 (bvadd (_ bv4 32) .cse6)))) (or (bvule |c_create_sub_list_#in~sub#1.offset| .cse1) .cse2) (forall ((v_ArrVal_2075 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_create_sub_list_insert_sub_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2075) |c_create_sub_list_insert_sub_~head#1.base|) .cse3))) (= |c_create_sub_list_insert_sub_~head#1.base| |c_create_sub_list_#in~sub#1.base|))) is different from false [2022-11-25 22:42:18,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:42:18,390 INFO L93 Difference]: Finished difference Result 263 states and 283 transitions. [2022-11-25 22:42:18,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-25 22:42:18,391 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 39 states have internal predecessors, (83), 10 states have call successors, (11), 8 states have call predecessors, (11), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 41 [2022-11-25 22:42:18,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:42:18,393 INFO L225 Difference]: With dead ends: 263 [2022-11-25 22:42:18,393 INFO L226 Difference]: Without dead ends: 263 [2022-11-25 22:42:18,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 156 SyntacticMatches, 4 SemanticMatches, 93 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2091 ImplicationChecksByTransitivity, 90.1s TimeCoverageRelationStatistics Valid=720, Invalid=7448, Unknown=38, NotChecked=724, Total=8930 [2022-11-25 22:42:18,396 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 263 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 2128 mSolverCounterSat, 42 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 2389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2128 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:42:18,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 829 Invalid, 2389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2128 Invalid, 14 Unknown, 205 Unchecked, 12.6s Time] [2022-11-25 22:42:18,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-11-25 22:42:18,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 187. [2022-11-25 22:42:18,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 140 states have (on average 1.2571428571428571) internal successors, (176), 167 states have internal predecessors, (176), 11 states have call successors, (11), 11 states have call predecessors, (11), 12 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2022-11-25 22:42:18,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2022-11-25 22:42:18,404 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 41 [2022-11-25 22:42:18,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:42:18,404 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2022-11-25 22:42:18,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 39 states have internal predecessors, (83), 10 states have call successors, (11), 8 states have call predecessors, (11), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 22:42:18,405 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2022-11-25 22:42:18,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 22:42:18,406 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:18,406 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:42:18,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2022-11-25 22:42:18,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-25 22:42:18,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-25 22:42:19,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:42:19,015 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:42:19,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:19,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1398479560, now seen corresponding path program 1 times [2022-11-25 22:42:19,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:42:19,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6320769] [2022-11-25 22:42:19,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:19,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:42:19,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:42:19,017 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:42:19,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-11-25 22:42:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:19,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-25 22:42:19,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:19,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:42:19,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:42:19,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:42:19,993 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:42:19,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:42:20,026 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2177 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_64| (_ BitVec 32)) (v_ArrVal_2176 (_ BitVec 32)) (|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_create_sub_list_insert_sub_~sub~0#1.base_64|)) (= |c_#length| (store (store |c_old(#length)| |v_create_sub_list_insert_sub_~sub~0#1.base_64| v_ArrVal_2176) |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2177)) (not (= |c_create_sub_list_#in~sub#1.base| |create_sub_list_insert_sub_~sub~0#1.base|)))) is different from true [2022-11-25 22:42:20,119 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:42:20,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-25 22:42:20,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:42:20,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:20,298 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:42:20,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 23 [2022-11-25 22:42:20,333 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:42:20,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:42:20,507 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2022-11-25 22:42:20,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:42:21,312 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-25 22:42:21,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2022-11-25 22:42:29,720 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:42:29,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6320769] [2022-11-25 22:42:29,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6320769] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:42:29,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [178379519] [2022-11-25 22:42:29,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:29,721 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:42:29,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:42:29,723 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:42:29,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-11-25 22:42:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:30,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-25 22:42:30,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:30,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:42:30,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:42:30,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:42:31,287 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:42:31,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:42:31,538 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:42:31,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-25 22:42:31,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:42:32,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:32,397 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:42:32,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 23 [2022-11-25 22:42:32,432 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:42:32,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:42:32,477 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 22:42:32,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:42:33,618 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-25 22:42:33,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2022-11-25 22:42:34,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [178379519] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:42:34,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000491678] [2022-11-25 22:42:34,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:34,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:42:34,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:42:34,493 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:42:34,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-25 22:42:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:34,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-25 22:42:34,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:34,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:42:34,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:42:35,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:42:35,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-25 22:42:36,999 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:42:36,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-25 22:42:37,033 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-11-25 22:42:37,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-25 22:42:39,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:39,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:39,548 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:42:39,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 23 [2022-11-25 22:42:39,631 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2022-11-25 22:42:39,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 38 [2022-11-25 22:42:39,704 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 22:42:39,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:42:42,745 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_insert_top_~top~0#1.offset| (_ bv24 32))) (.cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_insert_top_~top~0#1.offset|))) (and (or (bvule (bvadd |c_ULTIMATE.start_insert_top_~top~0#1.offset| (_ bv20 32)) .cse0) (forall ((v_ArrVal_2401 (_ BitVec 32)) (v_ArrVal_2403 (_ BitVec 32)) (v_ArrVal_2402 (_ BitVec 1)) (|v_create_sub_list_insert_sub_~sub~0#1.base_83| (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_84| (_ BitVec 32))) (or (not (= (select (store |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_84| v_ArrVal_2402) |v_create_sub_list_insert_sub_~sub~0#1.base_83|) (_ bv0 1))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_84|) (_ bv0 1))) (not (bvule .cse1 (select (store (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_84| v_ArrVal_2401) |v_create_sub_list_insert_sub_~sub~0#1.base_83| v_ArrVal_2403) |c_ULTIMATE.start_insert_top_~top~0#1.base|)))))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_84| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_84|) (_ bv0 1))) (forall ((v_ArrVal_2402 (_ BitVec 1)) (|v_create_sub_list_insert_sub_~sub~0#1.base_83| (_ BitVec 32))) (or (not (= (select (store |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_84| v_ArrVal_2402) |v_create_sub_list_insert_sub_~sub~0#1.base_83|) (_ bv0 1))) (forall ((v_ArrVal_2401 (_ BitVec 32)) (v_ArrVal_2403 (_ BitVec 32))) (let ((.cse2 (select (store (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_84| v_ArrVal_2401) |v_create_sub_list_insert_sub_~sub~0#1.base_83| v_ArrVal_2403) |c_ULTIMATE.start_insert_top_~top~0#1.base|))) (or (bvule .cse0 .cse2) (not (bvule .cse1 .cse2))))))))))) is different from false [2022-11-25 22:42:42,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000491678] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:42:42,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:42:42,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 25 [2022-11-25 22:42:42,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369526146] [2022-11-25 22:42:42,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:42:42,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 22:42:42,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:42:42,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 22:42:42,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=785, Unknown=12, NotChecked=114, Total=992 [2022-11-25 22:42:42,767 INFO L87 Difference]: Start difference. First operand 187 states and 199 transitions. Second operand has 26 states, 24 states have (on average 3.125) internal successors, (75), 23 states have internal predecessors, (75), 8 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-25 22:42:58,478 WARN L233 SmtUtils]: Spent 9.56s on a formula simplification. DAG size of input: 64 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:43:10,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:43:16,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:16,445 INFO L93 Difference]: Finished difference Result 303 states and 332 transitions. [2022-11-25 22:43:16,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 22:43:16,447 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.125) internal successors, (75), 23 states have internal predecessors, (75), 8 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 45 [2022-11-25 22:43:16,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:16,448 INFO L225 Difference]: With dead ends: 303 [2022-11-25 22:43:16,448 INFO L226 Difference]: Without dead ends: 303 [2022-11-25 22:43:16,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=164, Invalid=1389, Unknown=15, NotChecked=154, Total=1722 [2022-11-25 22:43:16,449 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 211 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-11-25 22:43:16,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 619 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1251 Invalid, 1 Unknown, 144 Unchecked, 7.7s Time] [2022-11-25 22:43:16,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-11-25 22:43:16,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 194. [2022-11-25 22:43:16,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 145 states have (on average 1.2551724137931035) internal successors, (182), 171 states have internal predecessors, (182), 12 states have call successors, (12), 12 states have call predecessors, (12), 13 states have return successors, (14), 10 states have call predecessors, (14), 12 states have call successors, (14) [2022-11-25 22:43:16,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 208 transitions. [2022-11-25 22:43:16,458 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 208 transitions. Word has length 45 [2022-11-25 22:43:16,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:16,459 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 208 transitions. [2022-11-25 22:43:16,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.125) internal successors, (75), 23 states have internal predecessors, (75), 8 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-25 22:43:16,459 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 208 transitions. [2022-11-25 22:43:16,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 22:43:16,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:16,461 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:43:16,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-11-25 22:43:16,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-25 22:43:16,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2022-11-25 22:43:17,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 22:43:17,068 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting list_add_tailErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:43:17,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:17,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1768276039, now seen corresponding path program 1 times [2022-11-25 22:43:17,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:43:17,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [155969098] [2022-11-25 22:43:17,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:17,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:43:17,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:43:17,069 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:43:17,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-11-25 22:43:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:17,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 22:43:17,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:17,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:43:17,709 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:43:17,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:43:17,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-25 22:43:17,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:43:18,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:18,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 22:43:18,317 WARN L859 $PredicateComparison]: unable to prove that (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |create_sub_list_insert_sub_~sub~0#1.base| (_ bv1 1)))) is different from true [2022-11-25 22:43:18,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:43:18,546 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 22:43:18,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 22:43:18,749 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-25 22:43:18,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:43:19,149 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:43:19,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [155969098] [2022-11-25 22:43:19,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [155969098] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:43:19,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1662088852] [2022-11-25 22:43:19,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:19,150 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:43:19,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:43:19,151 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:43:19,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-11-25 22:43:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:20,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-25 22:43:20,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:20,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:43:20,817 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 22:43:20,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 22:43:20,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:21,009 INFO L321 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2022-11-25 22:43:21,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 36 [2022-11-25 22:43:21,210 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 22:43:21,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2022-11-25 22:43:21,362 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2631 (_ BitVec 1)) (|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2631) |c_#valid|) (bvult |create_sub_list_insert_sub_~sub~0#1.base| |c_#StackHeapBarrier|))) (not (= |c_#StackHeapBarrier| (_ bv0 32))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2022-11-25 22:43:21,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:43:21,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:21,662 INFO L321 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2022-11-25 22:43:21,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 40 [2022-11-25 22:43:21,808 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 22:43:21,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2022-11-25 22:43:21,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:43:22,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:22,217 INFO L321 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2022-11-25 22:43:22,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 45 [2022-11-25 22:43:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 7 not checked. [2022-11-25 22:43:22,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:43:23,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1662088852] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:43:23,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880540605] [2022-11-25 22:43:23,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:23,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:43:23,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:43:23,095 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:43:23,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-25 22:43:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:23,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-25 22:43:23,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:23,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:43:23,556 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:43:23,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:43:23,599 WARN L859 $PredicateComparison]: unable to prove that (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_2748 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2748))) (= (_ bv0 1) (select |c_old(#valid)| |create_sub_list_insert_sub_~sub~0#1.base|)))) is different from true [2022-11-25 22:43:23,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-25 22:43:23,716 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:43:23,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:43:23,755 WARN L859 $PredicateComparison]: unable to prove that (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_2749 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2749))) (= (_ bv0 1) (select |c_old(#valid)| |create_sub_list_insert_sub_~sub~0#1.base|)))) is different from true [2022-11-25 22:43:23,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-25 22:43:23,870 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:43:23,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:43:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 7 not checked. [2022-11-25 22:43:23,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:43:24,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880540605] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:43:24,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:43:24,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 27 [2022-11-25 22:43:24,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002190436] [2022-11-25 22:43:24,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:43:24,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-25 22:43:24,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:43:24,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 22:43:24,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=547, Unknown=15, NotChecked=204, Total=870 [2022-11-25 22:43:24,206 INFO L87 Difference]: Start difference. First operand 194 states and 208 transitions. Second operand has 28 states, 25 states have (on average 3.36) internal successors, (84), 23 states have internal predecessors, (84), 10 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-11-25 22:43:32,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:32,419 INFO L93 Difference]: Finished difference Result 301 states and 329 transitions. [2022-11-25 22:43:32,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 22:43:32,420 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 3.36) internal successors, (84), 23 states have internal predecessors, (84), 10 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 51 [2022-11-25 22:43:32,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:32,422 INFO L225 Difference]: With dead ends: 301 [2022-11-25 22:43:32,423 INFO L226 Difference]: Without dead ends: 301 [2022-11-25 22:43:32,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 141 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=223, Invalid=963, Unknown=20, NotChecked=276, Total=1482 [2022-11-25 22:43:32,424 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 518 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 94 mSolverCounterUnsat, 199 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 199 IncrementalHoareTripleChecker+Unknown, 748 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-25 22:43:32,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 390 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 602 Invalid, 199 Unknown, 748 Unchecked, 2.9s Time] [2022-11-25 22:43:32,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-11-25 22:43:32,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 215. [2022-11-25 22:43:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 161 states have (on average 1.2857142857142858) internal successors, (207), 187 states have internal predecessors, (207), 15 states have call successors, (15), 13 states have call predecessors, (15), 15 states have return successors, (21), 14 states have call predecessors, (21), 15 states have call successors, (21) [2022-11-25 22:43:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 243 transitions. [2022-11-25 22:43:32,434 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 243 transitions. Word has length 51 [2022-11-25 22:43:32,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:32,434 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 243 transitions. [2022-11-25 22:43:32,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 3.36) internal successors, (84), 23 states have internal predecessors, (84), 10 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-11-25 22:43:32,435 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 243 transitions. [2022-11-25 22:43:32,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 22:43:32,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:32,436 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:43:32,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-11-25 22:43:32,649 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2022-11-25 22:43:32,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-25 22:43:33,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:43:33,044 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting list_add_tailErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:43:33,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:33,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1768276040, now seen corresponding path program 1 times [2022-11-25 22:43:33,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:43:33,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60613265] [2022-11-25 22:43:33,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:33,045 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:43:33,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:43:33,046 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:43:33,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-11-25 22:43:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:33,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-25 22:43:33,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:33,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:43:33,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:43:33,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:33,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 22:43:33,735 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:43:33,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:43:33,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:43:33,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:43:34,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:34,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 22:43:34,350 WARN L859 $PredicateComparison]: unable to prove that (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |create_sub_list_insert_sub_~sub~0#1.base| (_ bv12 32)))) is different from true [2022-11-25 22:43:34,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:43:34,588 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:43:34,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-25 22:43:35,004 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-25 22:43:35,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:43:35,766 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:43:35,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60613265] [2022-11-25 22:43:35,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60613265] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:43:35,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [764123151] [2022-11-25 22:43:35,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:35,767 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:43:35,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:43:35,768 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:43:35,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-11-25 22:43:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:37,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-25 22:43:37,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:37,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:43:37,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:43:38,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:38,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 22:43:38,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:43:38,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:43:38,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:38,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 22:43:38,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:43:38,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:43:38,955 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2866 (_ BitVec 32)) (|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2866) |c_#length|) (bvult |create_sub_list_insert_sub_~sub~0#1.base| |c_#StackHeapBarrier|))) (not (= |c_#StackHeapBarrier| (_ bv0 32))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2022-11-25 22:43:39,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:39,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 22:43:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 4 not checked. [2022-11-25 22:43:39,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:43:39,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [764123151] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:43:39,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281916055] [2022-11-25 22:43:39,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:39,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:43:39,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:43:39,876 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:43:39,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-25 22:43:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:40,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-25 22:43:40,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:40,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:43:40,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:43:40,416 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:43:40,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-25 22:43:40,476 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:43:40,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:43:41,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:43:41,106 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3100 (_ BitVec 32)) (|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_3100) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |create_sub_list_insert_sub_~sub~0#1.base|)))) is different from true [2022-11-25 22:43:41,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:41,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 22:43:41,200 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-25 22:43:41,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 22:43:41,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:43:41,466 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:43:41,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-25 22:43:41,999 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-25 22:43:42,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:43:42,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281916055] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:43:42,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:43:42,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 14] total 30 [2022-11-25 22:43:42,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82843415] [2022-11-25 22:43:42,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:43:42,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-25 22:43:42,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:43:42,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-25 22:43:42,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=936, Unknown=12, NotChecked=192, Total=1260 [2022-11-25 22:43:42,456 INFO L87 Difference]: Start difference. First operand 215 states and 243 transitions. Second operand has 31 states, 26 states have (on average 3.076923076923077) internal successors, (80), 23 states have internal predecessors, (80), 11 states have call successors, (13), 10 states have call predecessors, (13), 7 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-11-25 22:43:50,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:50,517 INFO L93 Difference]: Finished difference Result 337 states and 364 transitions. [2022-11-25 22:43:50,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 22:43:50,520 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 3.076923076923077) internal successors, (80), 23 states have internal predecessors, (80), 11 states have call successors, (13), 10 states have call predecessors, (13), 7 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 51 [2022-11-25 22:43:50,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:50,522 INFO L225 Difference]: With dead ends: 337 [2022-11-25 22:43:50,522 INFO L226 Difference]: Without dead ends: 337 [2022-11-25 22:43:50,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 130 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=283, Invalid=1873, Unknown=18, NotChecked=276, Total=2450 [2022-11-25 22:43:50,524 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 435 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 57 mSolverCounterUnsat, 152 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 1810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 152 IncrementalHoareTripleChecker+Unknown, 514 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:43:50,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 617 Invalid, 1810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1087 Invalid, 152 Unknown, 514 Unchecked, 6.1s Time] [2022-11-25 22:43:50,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-11-25 22:43:50,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 257. [2022-11-25 22:43:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 197 states have (on average 1.2385786802030456) internal successors, (244), 223 states have internal predecessors, (244), 17 states have call successors, (17), 17 states have call predecessors, (17), 19 states have return successors, (23), 16 states have call predecessors, (23), 17 states have call successors, (23) [2022-11-25 22:43:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 284 transitions. [2022-11-25 22:43:50,534 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 284 transitions. Word has length 51 [2022-11-25 22:43:50,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:50,535 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 284 transitions. [2022-11-25 22:43:50,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 3.076923076923077) internal successors, (80), 23 states have internal predecessors, (80), 11 states have call successors, (13), 10 states have call predecessors, (13), 7 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-11-25 22:43:50,535 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 284 transitions. [2022-11-25 22:43:50,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 22:43:50,536 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:50,536 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:43:50,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2022-11-25 22:43:50,757 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-11-25 22:43:50,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-11-25 22:43:51,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:43:51,147 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting list_add_tailErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:43:51,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:51,147 INFO L85 PathProgramCache]: Analyzing trace with hash 636971300, now seen corresponding path program 2 times [2022-11-25 22:43:51,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:43:51,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764537914] [2022-11-25 22:43:51,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:43:51,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:43:51,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:43:51,149 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:43:51,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-11-25 22:43:52,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:43:52,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:43:52,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-25 22:43:52,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:52,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:43:52,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:43:52,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:52,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:43:52,318 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:43:52,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:43:52,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:43:52,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:43:53,025 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:43:53,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-25 22:43:53,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:43:53,215 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:43:53,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-11-25 22:43:54,197 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-25 22:43:54,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 46 [2022-11-25 22:43:54,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 22:43:54,651 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:43:54,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:43:54,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-11-25 22:43:54,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-25 22:43:56,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-25 22:43:56,750 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-25 22:43:56,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 46 [2022-11-25 22:43:57,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:43:57,136 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-11-25 22:43:57,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 51 [2022-11-25 22:43:57,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-25 22:43:58,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2022-11-25 22:43:58,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:43:58,521 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:43:58,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:44:01,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-11-25 22:44:06,251 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:44:06,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764537914] [2022-11-25 22:44:06,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [764537914] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:44:06,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2064983245] [2022-11-25 22:44:06,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:44:06,251 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:44:06,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:44:06,253 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:44:06,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-11-25 22:44:07,135 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 22:44:07,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37323379] [2022-11-25 22:44:07,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:44:07,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:44:07,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:44:07,138 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:44:07,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-11-25 22:44:07,162 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 1 [2022-11-25 22:44:10,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:44:10,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:44:10,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 118 conjunts are in the unsatisfiable core [2022-11-25 22:44:10,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:44:10,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:44:10,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:44:11,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:11,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:11,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:11,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:11,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:44:11,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:11,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:44:11,639 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:44:11,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:44:11,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:44:11,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:44:15,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 36 [2022-11-25 22:44:15,083 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2022-11-25 22:44:15,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 117 [2022-11-25 22:44:15,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 89 [2022-11-25 22:44:15,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2022-11-25 22:44:15,577 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:44:15,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:44:16,162 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-25 22:44:16,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 63 [2022-11-25 22:44:16,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-25 22:44:17,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-25 22:44:17,319 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-25 22:44:17,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 46 [2022-11-25 22:44:17,469 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-11-25 22:44:17,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 51 [2022-11-25 22:44:17,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-25 22:44:17,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-25 22:44:18,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:44:18,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2022-11-25 22:44:18,657 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 35 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:44:18,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:44:19,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-11-25 22:44:21,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37323379] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:44:21,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 22:44:21,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 50 [2022-11-25 22:44:21,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430313509] [2022-11-25 22:44:21,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 22:44:21,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-25 22:44:21,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:44:21,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-25 22:44:21,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3266, Unknown=85, NotChecked=0, Total=3540 [2022-11-25 22:44:21,547 INFO L87 Difference]: Start difference. First operand 257 states and 284 transitions. Second operand has 51 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 44 states have internal predecessors, (71), 7 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 22:44:53,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:53,776 INFO L93 Difference]: Finished difference Result 258 states and 283 transitions. [2022-11-25 22:44:53,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-25 22:44:53,777 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 44 states have internal predecessors, (71), 7 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-11-25 22:44:53,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:53,779 INFO L225 Difference]: With dead ends: 258 [2022-11-25 22:44:53,779 INFO L226 Difference]: Without dead ends: 258 [2022-11-25 22:44:53,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 64 SyntacticMatches, 8 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2345 ImplicationChecksByTransitivity, 36.2s TimeCoverageRelationStatistics Valid=625, Invalid=7763, Unknown=168, NotChecked=0, Total=8556 [2022-11-25 22:44:53,783 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 132 mSDsluCounter, 1418 mSDsCounter, 0 mSdLazyCounter, 2202 mSolverCounterSat, 37 mSolverCounterUnsat, 68 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 2307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2202 IncrementalHoareTripleChecker+Invalid, 68 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:44:53,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1484 Invalid, 2307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2202 Invalid, 68 Unknown, 0 Unchecked, 14.6s Time] [2022-11-25 22:44:53,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-25 22:44:53,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2022-11-25 22:44:53,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 197 states have (on average 1.233502538071066) internal successors, (243), 223 states have internal predecessors, (243), 17 states have call successors, (17), 17 states have call predecessors, (17), 19 states have return successors, (23), 16 states have call predecessors, (23), 17 states have call successors, (23) [2022-11-25 22:44:53,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 283 transitions. [2022-11-25 22:44:53,792 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 283 transitions. Word has length 51 [2022-11-25 22:44:53,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:53,792 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 283 transitions. [2022-11-25 22:44:53,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 44 states have internal predecessors, (71), 7 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 22:44:53,793 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 283 transitions. [2022-11-25 22:44:53,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 22:44:53,793 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:53,794 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:44:53,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-11-25 22:44:54,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-11-25 22:44:54,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:44:54,207 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:44:54,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:44:54,207 INFO L85 PathProgramCache]: Analyzing trace with hash 636971301, now seen corresponding path program 2 times [2022-11-25 22:44:54,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:44:54,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493229076] [2022-11-25 22:44:54,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:44:54,208 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:44:54,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:44:54,209 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:44:54,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-11-25 22:44:55,153 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:44:55,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:44:55,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 132 conjunts are in the unsatisfiable core [2022-11-25 22:44:55,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:44:55,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:44:55,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:55,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:55,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:55,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:44:55,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:55,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:44:55,595 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:44:55,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:44:55,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-25 22:44:55,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:44:57,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:57,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 46 [2022-11-25 22:44:57,146 INFO L321 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2022-11-25 22:44:57,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 130 [2022-11-25 22:44:57,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:57,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 92 [2022-11-25 22:44:57,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 121 [2022-11-25 22:44:57,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:44:57,526 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:44:57,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:44:57,859 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-25 22:44:57,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 89 [2022-11-25 22:44:58,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-25 22:44:59,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:59,326 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:44:59,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-25 22:44:59,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:44:59,647 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:44:59,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-11-25 22:44:59,957 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 22:44:59,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 38 [2022-11-25 22:44:59,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:45:00,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:00,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 46 [2022-11-25 22:45:00,428 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-25 22:45:00,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 55 [2022-11-25 22:45:00,819 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-25 22:45:00,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:45:01,171 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:45:01,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:45:01,226 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:45:01,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 22:45:01,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-11-25 22:45:02,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 41 [2022-11-25 22:45:02,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2022-11-25 22:45:02,997 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:45:02,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:45:08,085 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:08,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 75 [2022-11-25 22:45:08,155 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:08,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1962 treesize of output 1943 [2022-11-25 22:45:08,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 963 treesize of output 931 [2022-11-25 22:45:08,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1894 treesize of output 1830 [2022-11-25 22:45:08,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1830 treesize of output 1814 [2022-11-25 22:45:17,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 22:45:17,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 22:45:18,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 22:45:19,055 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:19,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 60 [2022-11-25 22:45:19,109 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:19,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 207 [2022-11-25 22:45:19,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 158 [2022-11-25 22:45:19,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 142 [2022-11-25 22:45:19,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2022-11-25 22:46:10,534 WARN L233 SmtUtils]: Spent 30.42s on a formula simplification. DAG size of input: 147 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:46:10,536 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:46:10,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493229076] [2022-11-25 22:46:10,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493229076] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:46:10,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [714389306] [2022-11-25 22:46:10,537 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:46:10,537 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:46:10,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:46:10,539 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:46:10,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2022-11-25 22:46:13,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:46:13,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:46:13,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 137 conjunts are in the unsatisfiable core [2022-11-25 22:46:13,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:46:13,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:46:13,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:46:13,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:46:13,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:46:13,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:46:13,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:46:13,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:46:13,646 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:46:13,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:46:13,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:46:14,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:46:15,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 43 [2022-11-25 22:46:15,436 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2022-11-25 22:46:15,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 117 [2022-11-25 22:46:15,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 89 [2022-11-25 22:46:15,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2022-11-25 22:46:15,995 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:46:15,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:46:16,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:46:16,656 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-25 22:46:16,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 63 [2022-11-25 22:46:17,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-25 22:46:19,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:46:19,814 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:46:19,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-25 22:46:19,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:46:20,559 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:46:20,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-11-25 22:46:21,229 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 22:46:21,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 38 [2022-11-25 22:46:21,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:46:22,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-25 22:46:22,093 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-25 22:46:22,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 55 [2022-11-25 22:46:22,813 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-25 22:46:22,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2022-11-25 22:46:22,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:46:23,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 22:46:23,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-25 22:46:24,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:46:24,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-25 22:46:24,340 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:46:24,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2022-11-25 22:46:26,606 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 35 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:46:26,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:46:32,312 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:46:32,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 75 [2022-11-25 22:46:32,384 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:46:32,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 982 treesize of output 975 [2022-11-25 22:46:32,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 958 treesize of output 942 [2022-11-25 22:46:32,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 942 treesize of output 910 [2022-11-25 22:46:32,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 458 treesize of output 450 [2022-11-25 22:46:36,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-11-25 22:46:36,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 22:46:37,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 22:46:37,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 22:46:37,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-11-25 22:46:38,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 22:46:38,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 22:46:39,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 22:46:39,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 22:46:40,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 22:46:40,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-11-25 22:46:40,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 22:46:40,777 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:46:40,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 60 [2022-11-25 22:46:40,847 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:46:40,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 414 treesize of output 395 [2022-11-25 22:46:40,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 378 treesize of output 314 [2022-11-25 22:46:40,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 282 [2022-11-25 22:46:40,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 133 [2022-11-25 22:49:03,139 WARN L233 SmtUtils]: Spent 43.88s on a formula simplification. DAG size of input: 243 DAG size of output: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:49:03,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [714389306] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:49:03,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594892591] [2022-11-25 22:49:03,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:49:03,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:49:03,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:49:03,146 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:49:03,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-11-25 22:49:04,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:49:04,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:49:04,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 131 conjunts are in the unsatisfiable core [2022-11-25 22:49:04,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:49:04,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:49:04,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:49:06,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:49:06,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:49:06,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:49:06,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:49:06,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:49:06,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:49:06,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:49:06,924 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:49:06,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:49:07,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:49:07,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:49:08,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 36 [2022-11-25 22:49:08,936 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2022-11-25 22:49:08,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 117 [2022-11-25 22:49:08,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2022-11-25 22:49:08,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:49:08,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 77 [2022-11-25 22:49:08,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 22 [2022-11-25 22:49:09,587 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:49:09,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:49:09,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:49:09,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-11-25 22:49:09,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-25 22:49:11,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:49:12,767 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:49:12,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-25 22:49:12,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:49:13,716 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:49:13,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-11-25 22:49:14,560 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 22:49:14,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 38 [2022-11-25 22:49:14,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:49:15,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-25 22:49:15,629 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-25 22:49:15,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 55 [2022-11-25 22:49:15,819 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-25 22:49:15,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-11-25 22:49:15,908 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-25 22:49:15,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2022-11-25 22:49:16,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-25 22:49:16,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 22:49:18,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-25 22:49:18,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:49:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:49:19,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:49:21,791 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (and (forall ((v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4105 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4105) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4106) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)))) (forall ((v_ArrVal_4105 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4105) |c_create_sub_list_insert_sub_~head#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) is different from false [2022-11-25 22:49:27,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:49:27,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 60 [2022-11-25 22:49:27,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:49:27,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 414 treesize of output 395 [2022-11-25 22:49:28,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 378 treesize of output 314 [2022-11-25 22:49:28,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 141 [2022-11-25 22:49:28,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 298 treesize of output 266 [2022-11-25 22:49:28,886 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:49:28,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 75 [2022-11-25 22:49:28,964 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:49:28,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1830 treesize of output 1811 [2022-11-25 22:49:28,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1794 treesize of output 1778 [2022-11-25 22:49:29,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1778 treesize of output 1714 [2022-11-25 22:49:29,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1714 treesize of output 1682 [2022-11-25 22:49:45,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 22:49:45,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 22:49:45,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-11-25 22:49:45,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 22:49:45,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-11-25 22:49:46,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 22:49:46,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 22:49:47,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 22:49:49,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 22:49:50,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 22:49:50,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-11-25 22:49:50,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 22:49:51,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 22:49:52,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 22:49:53,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 22:49:56,351 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse90 (select |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~head#1.base|)) (.cse91 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (let ((.cse37 (= |c_create_sub_list_insert_sub_~sub~0#1.base| |c_create_sub_list_~sub#1.base|)) (.cse3 (select .cse90 .cse91))) (let ((.cse16 (= .cse3 |c_create_sub_list_~sub#1.base|)) (.cse2 (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~head#1.base| (store .cse90 .cse91 |c_create_sub_list_insert_sub_~sub~0#1.base|))) (.cse4 (bvadd (_ bv4 32) |c_create_sub_list_~sub#1.offset|)) (.cse30 (not .cse37))) (let ((.cse1 (bvadd (_ bv8 32) |c_create_sub_list_insert_sub_~sub~0#1.offset|)) (.cse10 (or (forall ((v_arrayElimCell_498 (_ BitVec 32)) (v_ArrVal_4104 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (bvule (bvadd v_arrayElimCell_498 (_ bv4 32)) (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))))) .cse30)) (.cse23 (or (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_497 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse89 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse89) (bvule (bvadd v_arrayElimCell_497 (_ bv4 32)) .cse89) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1)))))) .cse37)) (.cse52 (or .cse30 (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse88 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse88) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse88)))))) (.cse66 (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_497 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse87 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse87) (bvule (bvadd v_arrayElimCell_497 (_ bv4 32)) .cse87) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse87))))) (.cse59 (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1)))))) (.cse72 (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_497 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse86 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse86) (bvule (bvadd v_arrayElimCell_497 (_ bv4 32)) .cse86) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse86))))) (.cse5 (or (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse85 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse85) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse85)))) .cse30)) (.cse55 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (forall ((v_arrayElimCell_498 (_ BitVec 32)) (v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse84 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse84) (bvule (bvadd v_arrayElimCell_498 (_ bv4 32)) .cse84)))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1)))))) (.cse56 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))) (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4))))))) (.cse6 (not .cse16))) (let ((.cse9 (= |c_create_sub_list_insert_sub_~head#1.offset| |c_create_sub_list_~sub#1.offset|)) (.cse28 (or (forall ((v_arrayElimCell_498 (_ BitVec 32)) (v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse83 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_498 (_ bv4 32)) .cse83) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse83)))) .cse30)) (.cse29 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (forall ((v_arrayElimCell_497 (_ BitVec 32)) (v_ArrVal_4104 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse82 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (forall ((v_arrayElimCell_498 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_498 (_ bv4 32)) .cse82)) (bvule (bvadd v_arrayElimCell_497 (_ bv4 32)) .cse82)))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1)))))) (.cse32 (or .cse37 (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_497 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse81 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (bvule (bvadd v_arrayElimCell_497 (_ bv4 32)) .cse81) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse81)))))) (.cse33 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (forall ((v_arrayElimCell_498 (_ BitVec 32)) (v_arrayElimCell_497 (_ BitVec 32)) (v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse80 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_498 (_ bv4 32)) .cse80) (bvule (bvadd v_arrayElimCell_497 (_ bv4 32)) .cse80) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse80)))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1)))))) (.cse34 (or .cse37 (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_497 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (bvule (bvadd v_arrayElimCell_497 (_ bv4 32)) (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))))))) (.cse35 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (forall ((v_arrayElimCell_498 (_ BitVec 32)) (v_arrayElimCell_497 (_ BitVec 32)) (v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse79 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_498 (_ bv4 32)) .cse79) (bvule (bvadd v_arrayElimCell_497 (_ bv4 32)) .cse79) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse79)))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1)))))) (.cse17 (or (and .cse55 (or (and .cse56 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (forall ((v_arrayElimCell_497 (_ BitVec 32)) (v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse77 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse77) (bvule (bvadd v_arrayElimCell_497 (_ bv4 32)) .cse77)))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1)))))) .cse6) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (forall ((v_arrayElimCell_498 (_ BitVec 32)) (v_arrayElimCell_497 (_ BitVec 32)) (v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse78 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse78) (bvule (bvadd v_arrayElimCell_498 (_ bv4 32)) .cse78) (bvule (bvadd v_arrayElimCell_497 (_ bv4 32)) .cse78)))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1)))))) .cse30)) (.cse7 (or (forall ((v_arrayElimCell_498 (_ BitVec 32)) (v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse76 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse76) (bvule (bvadd v_arrayElimCell_498 (_ bv4 32)) .cse76) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1)))))) .cse30)) (.cse18 (or .cse6 (and (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (forall ((v_arrayElimCell_497 (_ BitVec 32)) (v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse75 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse75) (bvule (bvadd v_arrayElimCell_497 (_ bv4 32)) .cse75) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse75)))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))))) .cse5))) (.cse19 (or .cse37 .cse16 .cse72)) (.cse8 (or (and (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse73 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse73) (forall ((v_arrayElimCell_499 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse73))))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse74 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse74) (forall ((v_arrayElimCell_499 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse74))))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))))) (or .cse59 .cse30)) .cse6)) (.cse20 (or .cse37 (and (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (forall ((v_arrayElimCell_497 (_ BitVec 32)) (v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse71 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse71) (forall ((v_arrayElimCell_498 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_498 (_ bv4 32)) .cse71)) (bvule (bvadd v_arrayElimCell_497 (_ bv4 32)) .cse71) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse71)))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))))) (or .cse6 .cse72) (or .cse16 .cse72)))) (.cse21 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (forall ((v_arrayElimCell_498 (_ BitVec 32)) (v_arrayElimCell_497 (_ BitVec 32)) (v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse70 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse70) (bvule (bvadd v_arrayElimCell_498 (_ bv4 32)) .cse70) (bvule (bvadd v_arrayElimCell_497 (_ bv4 32)) .cse70) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse70)))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1)))))) (.cse22 (or .cse37 (and (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (forall ((v_arrayElimCell_497 (_ BitVec 32)) (v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse69 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse69) (forall ((v_arrayElimCell_498 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_498 (_ bv4 32)) .cse69)) (bvule (bvadd v_arrayElimCell_497 (_ bv4 32)) .cse69) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse69)))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))))) (or .cse66 .cse16) (or .cse66 .cse6)))) (.cse24 (or .cse6 (and .cse52 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (forall ((v_arrayElimCell_497 (_ BitVec 32)) (v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse68 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse68) (bvule (bvadd v_arrayElimCell_497 (_ bv4 32)) .cse68) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse68)))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1)))))))) (.cse26 (or .cse66 .cse37 .cse16)) (.cse12 (or .cse30 (forall ((v_arrayElimCell_498 (_ BitVec 32)) (v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse67 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (bvule (bvadd v_arrayElimCell_498 (_ bv4 32)) .cse67) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse67)))))) (.cse13 (or .cse66 .cse37)) (.cse14 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (forall ((v_arrayElimCell_498 (_ BitVec 32)) (v_arrayElimCell_497 (_ BitVec 32)) (v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse65) (bvule (bvadd v_arrayElimCell_498 (_ bv4 32)) .cse65) (bvule (bvadd v_arrayElimCell_497 (_ bv4 32)) .cse65) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse65)))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1)))))) (.cse36 (or (and .cse10 .cse23) .cse16)) (.cse46 (= |c_create_sub_list_insert_sub_~head#1.base| |c_create_sub_list_~sub#1.base|)) (.cse11 (or .cse30 (forall ((v_arrayElimCell_498 (_ BitVec 32)) (v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse64 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse64) (bvule (bvadd v_arrayElimCell_498 (_ bv4 32)) .cse64) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse64)))))) (.cse38 (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse63) (bvule .cse1 .cse63) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse63))))) (.cse47 (or .cse37 (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse62) (bvule .cse1 .cse62) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1)))))))) (.cse51 (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse61) (bvule .cse1 .cse61) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse61))))) (.cse40 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (forall ((v_arrayElimCell_498 (_ BitVec 32)) (v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse60 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse60) (bvule (bvadd v_arrayElimCell_498 (_ bv4 32)) .cse60) (bvule .cse1 .cse60) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse60)))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1)))))) (.cse25 (or .cse59 .cse6)) (.cse27 (or .cse30 (forall ((v_arrayElimCell_498 (_ BitVec 32)) (v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse58) (bvule (bvadd v_arrayElimCell_498 (_ bv4 32)) .cse58) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse58)))))) (.cse15 (not (= (select |c_#valid| |c_create_sub_list_~sub#1.base|) (_ bv0 1))))) (and (or (and (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse0) (bvule .cse1 .cse0) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse0)))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))))) .cse5) .cse6) .cse7 .cse8 (or .cse9 (and (or (and .cse10 .cse11 .cse12 .cse13 .cse14 (or .cse15 (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_arrayElimCell_504 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) (select (store |c_#length| |c_create_sub_list_~sub#1.base| v_ArrVal_4104) v_arrayElimCell_504))))) .cse16) .cse17 .cse7 .cse18 (or (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_arrayElimCell_508 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) (select (store |c_#length| |c_create_sub_list_~sub#1.base| v_ArrVal_4104) v_arrayElimCell_508))) .cse15) .cse19 .cse8 .cse20 .cse11 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse14 .cse27 (or (and .cse28 .cse29 (or .cse15 (and (or (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_arrayElimCell_506 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) (select (store |c_#length| |c_create_sub_list_~sub#1.base| v_ArrVal_4104) v_arrayElimCell_506))) .cse30) (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_497 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_arrayElimCell_505 (_ BitVec 32))) (let ((.cse31 (select (store |c_#length| |c_create_sub_list_~sub#1.base| v_ArrVal_4104) v_arrayElimCell_505))) (or (bvule (bvadd v_arrayElimCell_497 (_ bv4 32)) .cse31) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse31)))))) .cse10 .cse32 .cse33 .cse12 (or (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_arrayElimCell_507 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) (select (store |c_#length| |c_create_sub_list_~sub#1.base| v_ArrVal_4104) v_arrayElimCell_507))) .cse15) .cse34 .cse35) .cse16) .cse36)) (or .cse37 (and (or .cse38 .cse16) (or .cse6 .cse38) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse39) (forall ((v_arrayElimCell_498 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_498 (_ bv4 32)) .cse39)) (bvule .cse1 .cse39) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse39)))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))))))) (or (and (or .cse37 .cse38) .cse10 .cse11 (or (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_arrayElimCell_515 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) (select (store |c_#length| |c_create_sub_list_~sub#1.base| v_ArrVal_4104) v_arrayElimCell_515))) .cse15) .cse12 .cse40) .cse16) (or (and .cse28 .cse10 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (forall ((v_arrayElimCell_498 (_ BitVec 32)) (v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse41 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_498 (_ bv4 32)) .cse41) (bvule .cse1 .cse41) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse41)))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))))) (or (and (or (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_arrayElimCell_502 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) (select (store |c_#length| |c_create_sub_list_~sub#1.base| v_ArrVal_4104) v_arrayElimCell_502))) .cse30) (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_arrayElimCell_503 (_ BitVec 32))) (let ((.cse42 (select (store |c_#length| |c_create_sub_list_~sub#1.base| v_ArrVal_4104) v_arrayElimCell_503))) (or (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse42) (bvule .cse1 .cse42))))) .cse15) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (forall ((v_arrayElimCell_498 (_ BitVec 32)) (v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_498 (_ bv4 32)) .cse43) (bvule .cse1 .cse43) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse43)))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))))) .cse12 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (forall ((v_arrayElimCell_498 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_498 (_ bv4 32)) .cse44)) (bvule .cse1 .cse44)))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))))) (or (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (bvule .cse1 .cse45) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse45)))) .cse37) (or .cse37 (forall ((v_ArrVal_4104 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (bvule .cse1 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1)))))) (or (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_arrayElimCell_501 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) (select (store |c_#length| |c_create_sub_list_~sub#1.base| v_ArrVal_4104) v_arrayElimCell_501))) .cse15)) .cse16) (or (and .cse9 .cse6 .cse46 .cse30 (bvule (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~sub~0#1.offset|) .cse1)) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))))) .cse47 (or (and (or (and .cse28 .cse29 .cse10 .cse32 .cse33 .cse12 (or .cse15 (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_arrayElimCell_513 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) (select (store |c_#length| |c_create_sub_list_~sub#1.base| v_ArrVal_4104) v_arrayElimCell_513)))) .cse34 (or (and (or (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_arrayElimCell_512 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) (select (store |c_#length| |c_create_sub_list_~sub#1.base| v_ArrVal_4104) v_arrayElimCell_512))) .cse30) (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_497 (_ BitVec 32)) (v_arrayElimCell_511 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32))) (let ((.cse48 (select (store |c_#length| |c_create_sub_list_~sub#1.base| v_ArrVal_4104) v_arrayElimCell_511))) (or (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse48) (bvule (bvadd v_arrayElimCell_497 (_ bv4 32)) .cse48))))) .cse15) .cse35) .cse16) .cse17 .cse7 .cse18 .cse19 .cse8 .cse20 (or (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_arrayElimCell_514 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) (select (store |c_#length| |c_create_sub_list_~sub#1.base| v_ArrVal_4104) v_arrayElimCell_514))) .cse15) .cse11 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse14 .cse27 (or (and (or .cse15 (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_510 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) (select (store |c_#length| |c_create_sub_list_~sub#1.base| v_ArrVal_4104) v_arrayElimCell_510)))) .cse10 .cse11 .cse12 .cse13 .cse14) .cse16) .cse36) .cse46) .cse11 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (forall ((v_arrayElimCell_498 (_ BitVec 32)) (v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse49) (bvule (bvadd v_arrayElimCell_498 (_ bv4 32)) .cse49) (bvule .cse1 .cse49) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse49)))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))))) (or .cse37 .cse38 .cse16) (or .cse37 (and (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse50) (forall ((v_arrayElimCell_498 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_498 (_ bv4 32)) .cse50)) (bvule .cse1 .cse50) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse50)))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))))) (or .cse6 .cse51) (or .cse51 .cse16))) (or (and .cse10 .cse47) .cse16) (or (and .cse52 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse53 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse53) (bvule .cse1 .cse53) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) .cse53)))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1)))))) .cse6) (or .cse37 .cse51 .cse16) .cse40 .cse25 (or (and (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1))) (forall ((v_arrayElimCell_498 (_ BitVec 32)) (v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse54 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse54) (bvule (bvadd v_arrayElimCell_498 (_ bv4 32)) .cse54) (bvule .cse1 .cse54)))))) .cse55 (or (and .cse56 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_115| (_ BitVec 32))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_115| |c_create_sub_list_~sub#1.base|) (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_500 (_ BitVec 32)) (v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4104) (select (select (store (store (store .cse2 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4124) .cse3 v_ArrVal_4123) |v_create_sub_list_insert_sub_~sub~0#1.base_115| v_ArrVal_4106) |c_create_sub_list_~sub#1.base|) .cse4)))) (or (bvule (bvadd v_arrayElimCell_500 (_ bv4 32)) .cse57) (bvule .cse1 .cse57)))) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_115|) (_ bv0 1)))))) .cse6)) .cse30) .cse27 (or (forall ((v_ArrVal_4104 (_ BitVec 32)) (v_arrayElimCell_499 (_ BitVec 32)) (v_arrayElimCell_509 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_499 (_ bv4 32)) (select (store |c_#length| |c_create_sub_list_~sub#1.base| v_ArrVal_4104) v_arrayElimCell_509))) .cse15))))))) (not (= (bvadd (select |c_#valid| |c_create_sub_list_insert_sub_~head#1.base|) (_ bv1 1)) (_ bv0 1)))) is different from true [2022-11-25 22:49:56,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594892591] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:49:56,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:49:56,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 71 [2022-11-25 22:49:56,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339662538] [2022-11-25 22:49:56,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:49:56,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-25 22:49:56,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:49:56,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-25 22:49:56,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=7388, Unknown=115, NotChecked=350, Total=8190 [2022-11-25 22:49:56,381 INFO L87 Difference]: Start difference. First operand 257 states and 283 transitions. Second operand has 72 states, 68 states have (on average 1.6176470588235294) internal successors, (110), 64 states have internal predecessors, (110), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 22:50:52,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:50:52,406 INFO L93 Difference]: Finished difference Result 257 states and 282 transitions. [2022-11-25 22:50:52,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-25 22:50:52,408 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 68 states have (on average 1.6176470588235294) internal successors, (110), 64 states have internal predecessors, (110), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-11-25 22:50:52,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:50:52,409 INFO L225 Difference]: With dead ends: 257 [2022-11-25 22:50:52,409 INFO L226 Difference]: Without dead ends: 257 [2022-11-25 22:50:52,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 97 SyntacticMatches, 9 SemanticMatches, 117 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3989 ImplicationChecksByTransitivity, 264.4s TimeCoverageRelationStatistics Valid=789, Invalid=12609, Unknown=182, NotChecked=462, Total=14042 [2022-11-25 22:50:52,413 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 142 mSDsluCounter, 1811 mSDsCounter, 0 mSdLazyCounter, 2646 mSolverCounterSat, 62 mSolverCounterUnsat, 84 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 2792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2646 IncrementalHoareTripleChecker+Invalid, 84 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:50:52,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1877 Invalid, 2792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2646 Invalid, 84 Unknown, 0 Unchecked, 27.2s Time] [2022-11-25 22:50:52,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-11-25 22:50:52,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2022-11-25 22:50:52,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 197 states have (on average 1.2284263959390862) internal successors, (242), 223 states have internal predecessors, (242), 17 states have call successors, (17), 17 states have call predecessors, (17), 19 states have return successors, (23), 16 states have call predecessors, (23), 17 states have call successors, (23) [2022-11-25 22:50:52,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 282 transitions. [2022-11-25 22:50:52,424 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 282 transitions. Word has length 51 [2022-11-25 22:50:52,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:50:52,424 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 282 transitions. [2022-11-25 22:50:52,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 68 states have (on average 1.6176470588235294) internal successors, (110), 64 states have internal predecessors, (110), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 22:50:52,425 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 282 transitions. [2022-11-25 22:50:52,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-25 22:50:52,426 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:50:52,426 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:50:52,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-11-25 22:50:52,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (44)] Forceful destruction successful, exit code 0 [2022-11-25 22:50:52,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Forceful destruction successful, exit code 0 [2022-11-25 22:50:53,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:50:53,040 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting list_add_tailErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:50:53,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:50:53,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1493772759, now seen corresponding path program 1 times [2022-11-25 22:50:53,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:50:53,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118909654] [2022-11-25 22:50:53,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:50:53,042 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:50:53,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:50:53,044 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:50:53,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2022-11-25 22:50:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:50:53,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 22:50:53,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:50:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 22:50:54,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:50:54,046 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:50:54,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118909654] [2022-11-25 22:50:54,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118909654] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:50:54,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:50:54,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 22:50:54,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098668505] [2022-11-25 22:50:54,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:50:54,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 22:50:54,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:50:54,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 22:50:54,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:50:54,053 INFO L87 Difference]: Start difference. First operand 257 states and 282 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:50:55,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:50:55,224 INFO L93 Difference]: Finished difference Result 259 states and 281 transitions. [2022-11-25 22:50:55,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 22:50:55,226 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2022-11-25 22:50:55,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:50:55,227 INFO L225 Difference]: With dead ends: 259 [2022-11-25 22:50:55,227 INFO L226 Difference]: Without dead ends: 259 [2022-11-25 22:50:55,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-25 22:50:55,228 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 121 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 22:50:55,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 366 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 22:50:55,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-11-25 22:50:55,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2022-11-25 22:50:55,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 197 states have (on average 1.218274111675127) internal successors, (240), 222 states have internal predecessors, (240), 17 states have call successors, (17), 17 states have call predecessors, (17), 19 states have return successors, (23), 16 states have call predecessors, (23), 17 states have call successors, (23) [2022-11-25 22:50:55,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 280 transitions. [2022-11-25 22:50:55,238 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 280 transitions. Word has length 53 [2022-11-25 22:50:55,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:50:55,239 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 280 transitions. [2022-11-25 22:50:55,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:50:55,239 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 280 transitions. [2022-11-25 22:50:55,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-25 22:50:55,240 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:50:55,241 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:50:55,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2022-11-25 22:50:55,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:50:55,460 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting list_add_tailErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:50:55,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:50:55,460 INFO L85 PathProgramCache]: Analyzing trace with hash 937684793, now seen corresponding path program 1 times [2022-11-25 22:50:55,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:50:55,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576446540] [2022-11-25 22:50:55,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:50:55,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:50:55,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:50:55,462 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:50:55,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2022-11-25 22:50:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:50:56,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 22:50:56,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:50:56,729 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 22:50:56,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:50:57,280 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-25 22:50:57,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2022-11-25 22:50:57,393 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-25 22:50:57,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2022-11-25 22:50:57,454 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 22:50:57,455 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:50:57,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576446540] [2022-11-25 22:50:57,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576446540] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:50:57,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [679405743] [2022-11-25 22:50:57,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:50:57,456 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:50:57,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:50:57,457 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:50:57,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2022-11-25 22:50:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:50:58,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 22:50:58,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:50:58,482 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 22:50:58,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:50:59,037 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-25 22:50:59,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2022-11-25 22:50:59,149 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-25 22:50:59,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2022-11-25 22:50:59,212 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 22:50:59,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [679405743] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:50:59,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643968572] [2022-11-25 22:50:59,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:50:59,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:50:59,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:50:59,214 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:50:59,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-11-25 22:50:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:50:59,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 22:50:59,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:50:59,846 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 22:50:59,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:51:00,432 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-25 22:51:00,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2022-11-25 22:51:00,544 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-25 22:51:00,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2022-11-25 22:51:00,605 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 22:51:00,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643968572] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:51:00,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 22:51:00,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10, 10] total 10 [2022-11-25 22:51:00,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636349767] [2022-11-25 22:51:00,607 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 22:51:00,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 22:51:00,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:51:00,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 22:51:00,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-25 22:51:00,610 INFO L87 Difference]: Start difference. First operand 256 states and 280 transitions. Second operand has 11 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 22:51:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:51:03,228 INFO L93 Difference]: Finished difference Result 286 states and 309 transitions. [2022-11-25 22:51:03,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 22:51:03,228 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2022-11-25 22:51:03,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:51:03,230 INFO L225 Difference]: With dead ends: 286 [2022-11-25 22:51:03,230 INFO L226 Difference]: Without dead ends: 286 [2022-11-25 22:51:03,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-11-25 22:51:03,231 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 117 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:51:03,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 330 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-25 22:51:03,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-11-25 22:51:03,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 255. [2022-11-25 22:51:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 197 states have (on average 1.2081218274111676) internal successors, (238), 221 states have internal predecessors, (238), 17 states have call successors, (17), 17 states have call predecessors, (17), 19 states have return successors, (23), 16 states have call predecessors, (23), 17 states have call successors, (23) [2022-11-25 22:51:03,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 278 transitions. [2022-11-25 22:51:03,242 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 278 transitions. Word has length 54 [2022-11-25 22:51:03,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:51:03,242 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 278 transitions. [2022-11-25 22:51:03,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 22:51:03,243 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 278 transitions. [2022-11-25 22:51:03,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-25 22:51:03,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:51:03,244 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:51:03,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-11-25 22:51:03,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (48)] Forceful destruction successful, exit code 0 [2022-11-25 22:51:03,665 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Forceful destruction successful, exit code 0 [2022-11-25 22:51:03,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:51:03,855 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting list_add_tailErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 22:51:03,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:51:03,855 INFO L85 PathProgramCache]: Analyzing trace with hash 937684794, now seen corresponding path program 1 times [2022-11-25 22:51:03,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:51:03,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318121741] [2022-11-25 22:51:03,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:51:03,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:51:03,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:51:03,858 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:51:03,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2022-11-25 22:51:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:51:04,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-25 22:51:04,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:51:05,548 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 22:51:05,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:51:07,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-11-25 22:51:08,217 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:51:08,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-11-25 22:51:09,834 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:51:09,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-11-25 22:51:11,379 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 22:51:11,379 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:51:11,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318121741] [2022-11-25 22:51:11,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318121741] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:51:11,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [60118330] [2022-11-25 22:51:11,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:51:11,380 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:51:11,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:51:11,381 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:51:11,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process [2022-11-25 22:51:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:51:12,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-25 22:51:12,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:51:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 22:51:12,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:51:13,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-11-25 22:51:14,603 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:51:14,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-11-25 22:51:15,689 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:51:15,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-11-25 22:51:17,363 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 22:51:17,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [60118330] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:51:17,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210170181] [2022-11-25 22:51:17,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:51:17,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:51:17,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:51:17,365 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:51:17,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a64819b9-f893-4334-98c1-5a1ba9104770/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-11-25 22:51:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:51:17,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-25 22:51:17,809 INFO L286 TraceCheckSpWp]: Computing forward predicates...