./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0102-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0102-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fa260939b291574cde59d3c10d7828de68c26744f55119227115b01940792a6f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 19:31:54,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:31:54,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:31:54,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:31:54,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:31:54,479 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:31:54,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:31:54,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:31:54,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:31:54,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:31:54,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:31:54,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:31:54,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:31:54,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:31:54,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:31:54,503 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:31:54,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:31:54,507 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:31:54,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:31:54,514 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:31:54,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:31:54,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:31:54,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:31:54,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:31:54,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:31:54,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:31:54,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:31:54,534 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:31:54,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:31:54,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:31:54,538 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:31:54,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:31:54,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:31:54,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:31:54,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:31:54,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:31:54,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:31:54,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:31:54,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:31:54,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:31:54,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:31:54,547 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-18 19:31:54,583 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:31:54,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:31:54,584 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:31:54,584 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:31:54,585 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:31:54,585 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:31:54,586 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:31:54,586 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:31:54,586 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:31:54,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:31:54,588 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:31:54,588 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 19:31:54,588 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:31:54,588 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:31:54,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:31:54,589 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 19:31:54,589 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 19:31:54,589 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 19:31:54,589 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:31:54,589 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 19:31:54,590 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:31:54,590 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:31:54,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:31:54,590 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:31:54,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:31:54,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:31:54,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:31:54,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:31:54,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:31:54,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:31:54,592 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_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/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_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa260939b291574cde59d3c10d7828de68c26744f55119227115b01940792a6f [2022-11-18 19:31:54,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:31:54,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:31:54,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:31:54,875 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:31:54,876 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:31:54,877 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/memsafety/test-0102-1.i [2022-11-18 19:31:54,940 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/data/10650f593/681dcad5922241929af3508763455e79/FLAG2e0b6f28c [2022-11-18 19:31:55,449 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:31:55,449 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/sv-benchmarks/c/memsafety/test-0102-1.i [2022-11-18 19:31:55,466 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/data/10650f593/681dcad5922241929af3508763455e79/FLAG2e0b6f28c [2022-11-18 19:31:55,782 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/data/10650f593/681dcad5922241929af3508763455e79 [2022-11-18 19:31:55,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:31:55,785 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:31:55,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:31:55,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:31:55,797 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:31:55,798 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:31:55" (1/1) ... [2022-11-18 19:31:55,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fc49974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:31:55, skipping insertion in model container [2022-11-18 19:31:55,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:31:55" (1/1) ... [2022-11-18 19:31:55,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:31:55,848 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:31:56,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:31:56,270 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-18 19:31:56,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@52c0ba88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:31:56, skipping insertion in model container [2022-11-18 19:31:56,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:31:56,272 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-18 19:31:56,275 INFO L158 Benchmark]: Toolchain (without parser) took 488.04ms. Allocated memory is still 155.2MB. Free memory was 108.7MB in the beginning and 124.4MB in the end (delta: -15.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 19:31:56,276 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 155.2MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:31:56,278 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.03ms. Allocated memory is still 155.2MB. Free memory was 108.6MB in the beginning and 124.4MB in the end (delta: -15.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 19:31:56,279 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.22ms. Allocated memory is still 155.2MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 483.03ms. Allocated memory is still 155.2MB. Free memory was 108.6MB in the beginning and 124.4MB in the end (delta: -15.8MB). Peak memory consumption was 10.5MB. 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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0102-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fa260939b291574cde59d3c10d7828de68c26744f55119227115b01940792a6f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 19:31:58,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:31:58,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:31:58,473 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:31:58,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:31:58,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:31:58,476 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:31:58,478 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:31:58,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:31:58,481 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:31:58,482 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:31:58,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:31:58,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:31:58,492 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:31:58,494 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:31:58,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:31:58,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:31:58,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:31:58,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:31:58,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:31:58,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:31:58,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:31:58,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:31:58,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:31:58,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:31:58,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:31:58,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:31:58,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:31:58,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:31:58,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:31:58,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:31:58,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:31:58,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:31:58,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:31:58,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:31:58,525 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:31:58,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:31:58,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:31:58,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:31:58,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:31:58,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:31:58,532 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-18 19:31:58,580 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:31:58,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:31:58,581 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:31:58,581 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:31:58,582 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:31:58,582 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:31:58,583 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:31:58,583 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:31:58,583 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:31:58,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:31:58,585 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:31:58,585 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 19:31:58,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:31:58,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:31:58,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:31:58,586 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 19:31:58,586 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 19:31:58,586 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 19:31:58,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:31:58,587 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 19:31:58,587 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 19:31:58,587 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 19:31:58,587 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:31:58,587 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:31:58,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:31:58,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:31:58,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:31:58,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:31:58,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:31:58,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:31:58,589 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 19:31:58,589 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 19:31:58,590 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 19:31:58,590 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_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/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_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa260939b291574cde59d3c10d7828de68c26744f55119227115b01940792a6f [2022-11-18 19:31:58,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:31:59,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:31:59,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:31:59,025 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:31:59,026 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:31:59,028 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/memsafety/test-0102-1.i [2022-11-18 19:31:59,093 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/data/ad13ef4a0/566010d0507b4a4f8b4b611dfde35683/FLAG626251e5d [2022-11-18 19:31:59,726 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:31:59,727 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/sv-benchmarks/c/memsafety/test-0102-1.i [2022-11-18 19:31:59,747 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/data/ad13ef4a0/566010d0507b4a4f8b4b611dfde35683/FLAG626251e5d [2022-11-18 19:32:00,025 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/data/ad13ef4a0/566010d0507b4a4f8b4b611dfde35683 [2022-11-18 19:32:00,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:32:00,029 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:32:00,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:32:00,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:32:00,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:32:00,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:32:00" (1/1) ... [2022-11-18 19:32:00,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e4ee623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:00, skipping insertion in model container [2022-11-18 19:32:00,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:32:00" (1/1) ... [2022-11-18 19:32:00,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:32:00,094 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:32:00,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:32:00,426 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-18 19:32:00,433 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:32:00,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:32:00,491 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:32:00,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:32:00,557 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:32:00,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:00 WrapperNode [2022-11-18 19:32:00,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:32:00,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:32:00,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:32:00,559 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:32:00,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:00" (1/1) ... [2022-11-18 19:32:00,583 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:00" (1/1) ... [2022-11-18 19:32:00,604 INFO L138 Inliner]: procedures = 136, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 86 [2022-11-18 19:32:00,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:32:00,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:32:00,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:32:00,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:32:00,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:00" (1/1) ... [2022-11-18 19:32:00,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:00" (1/1) ... [2022-11-18 19:32:00,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:00" (1/1) ... [2022-11-18 19:32:00,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:00" (1/1) ... [2022-11-18 19:32:00,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:00" (1/1) ... [2022-11-18 19:32:00,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:00" (1/1) ... [2022-11-18 19:32:00,637 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:00" (1/1) ... [2022-11-18 19:32:00,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:00" (1/1) ... [2022-11-18 19:32:00,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:32:00,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:32:00,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:32:00,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:32:00,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:00" (1/1) ... [2022-11-18 19:32:00,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:32:00,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:32:00,680 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:32:00,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:32:00,733 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-11-18 19:32:00,733 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-11-18 19:32:00,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 19:32:00,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:32:00,734 INFO L130 BoogieDeclarations]: Found specification of procedure create_sub_list [2022-11-18 19:32:00,734 INFO L138 BoogieDeclarations]: Found implementation of procedure create_sub_list [2022-11-18 19:32:00,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:32:00,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 19:32:00,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 19:32:00,737 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_sub [2022-11-18 19:32:00,737 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_sub [2022-11-18 19:32:00,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-18 19:32:00,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:32:00,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 19:32:00,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 19:32:00,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:32:00,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:32:00,928 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:32:00,930 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:32:01,360 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:32:01,367 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:32:01,368 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-18 19:32:01,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:32:01 BoogieIcfgContainer [2022-11-18 19:32:01,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:32:01,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:32:01,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:32:01,375 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:32:01,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:32:00" (1/3) ... [2022-11-18 19:32:01,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769f229a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:32:01, skipping insertion in model container [2022-11-18 19:32:01,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:32:00" (2/3) ... [2022-11-18 19:32:01,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769f229a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:32:01, skipping insertion in model container [2022-11-18 19:32:01,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:32:01" (3/3) ... [2022-11-18 19:32:01,378 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0102-1.i [2022-11-18 19:32:01,397 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:32:01,397 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2022-11-18 19:32:01,442 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:32:01,448 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;@367e1fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:32:01,449 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-11-18 19:32:01,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 46 states have (on average 1.891304347826087) internal successors, (87), 77 states have internal predecessors, (87), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 19:32:01,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 19:32:01,459 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:01,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 19:32:01,460 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-18 19:32:01,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:01,465 INFO L85 PathProgramCache]: Analyzing trace with hash 106012329, now seen corresponding path program 1 times [2022-11-18 19:32:01,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:32:01,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031856850] [2022-11-18 19:32:01,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:01,478 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-18 19:32:01,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:32:01,491 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:01,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:01,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-18 19:32:01,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:32:01,656 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-18 19:32:01,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:32:01,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:32:01,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031856850] [2022-11-18 19:32:01,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031856850] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:32:01,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:32:01,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:32:01,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876140268] [2022-11-18 19:32:01,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:32:01,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 19:32:01,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:32:01,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 19:32:01,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 19:32:01,705 INFO L87 Difference]: Start difference. First operand has 87 states, 46 states have (on average 1.891304347826087) internal successors, (87), 77 states have internal predecessors, (87), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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-18 19:32:01,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:01,738 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2022-11-18 19:32:01,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 19:32:01,741 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-18 19:32:01,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:01,752 INFO L225 Difference]: With dead ends: 87 [2022-11-18 19:32:01,753 INFO L226 Difference]: Without dead ends: 85 [2022-11-18 19:32:01,754 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-18 19:32:01,758 INFO L413 NwaCegarLoop]: 93 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, 93 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-18 19:32:01,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:32:01,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-18 19:32:01,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-11-18 19:32:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 75 states have internal predecessors, (79), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 19:32:01,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2022-11-18 19:32:01,820 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 5 [2022-11-18 19:32:01,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:01,820 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2022-11-18 19:32:01,820 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-18 19:32:01,820 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2022-11-18 19:32:01,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-18 19:32:01,821 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:01,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:32:01,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:02,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:02,035 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-18 19:32:02,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:02,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1219357814, now seen corresponding path program 1 times [2022-11-18 19:32:02,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:32:02,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20495860] [2022-11-18 19:32:02,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:02,037 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-18 19:32:02,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:32:02,038 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:02,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:02,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 19:32:02,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:32:02,201 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-18 19:32:02,282 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-18 19:32:02,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:32:02,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:32:02,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20495860] [2022-11-18 19:32:02,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [20495860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:32:02,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:32:02,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:32:02,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168976667] [2022-11-18 19:32:02,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:32:02,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:32:02,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:32:02,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:32:02,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:32:02,289 INFO L87 Difference]: Start difference. First operand 85 states and 91 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-18 19:32:02,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:02,605 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-11-18 19:32:02,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:32:02,605 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-18 19:32:02,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:02,608 INFO L225 Difference]: With dead ends: 91 [2022-11-18 19:32:02,608 INFO L226 Difference]: Without dead ends: 91 [2022-11-18 19:32:02,608 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-18 19:32:02,610 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 39 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:32:02,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 190 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:32:02,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-18 19:32:02,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2022-11-18 19:32:02,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 45 states have (on average 1.711111111111111) internal successors, (77), 73 states have internal predecessors, (77), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 19:32:02,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-11-18 19:32:02,620 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 7 [2022-11-18 19:32:02,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:02,620 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-11-18 19:32:02,621 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-18 19:32:02,621 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-11-18 19:32:02,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-18 19:32:02,621 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:02,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:32:02,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:02,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:02,834 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-18 19:32:02,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:02,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1219357813, now seen corresponding path program 1 times [2022-11-18 19:32:02,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:32:02,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973018220] [2022-11-18 19:32:02,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:02,836 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-18 19:32:02,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:32:02,848 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:02,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:02,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-18 19:32:02,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:32:02,959 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-18 19:32:03,047 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-18 19:32:03,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:32:03,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:32:03,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973018220] [2022-11-18 19:32:03,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973018220] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:32:03,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:32:03,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:32:03,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599369908] [2022-11-18 19:32:03,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:32:03,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:32:03,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:32:03,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:32:03,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:32:03,055 INFO L87 Difference]: Start difference. First operand 83 states and 89 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-18 19:32:03,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:03,336 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2022-11-18 19:32:03,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:32:03,337 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-18 19:32:03,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:03,338 INFO L225 Difference]: With dead ends: 87 [2022-11-18 19:32:03,338 INFO L226 Difference]: Without dead ends: 87 [2022-11-18 19:32:03,339 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-18 19:32:03,340 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 5 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 254 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.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:32:03,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 254 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:32:03,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-18 19:32:03,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2022-11-18 19:32:03,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 19:32:03,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2022-11-18 19:32:03,348 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 7 [2022-11-18 19:32:03,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:03,348 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2022-11-18 19:32:03,349 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-18 19:32:03,349 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2022-11-18 19:32:03,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 19:32:03,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:03,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:32:03,374 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:03,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:03,561 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-18 19:32:03,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:03,562 INFO L85 PathProgramCache]: Analyzing trace with hash -778231822, now seen corresponding path program 1 times [2022-11-18 19:32:03,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:32:03,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571641756] [2022-11-18 19:32:03,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:03,563 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-18 19:32:03,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:32:03,565 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:03,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:03,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 19:32:03,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:32:03,678 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-18 19:32:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:32:03,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:32:03,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:32:03,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571641756] [2022-11-18 19:32:03,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571641756] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:32:03,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:32:03,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:32:03,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213536094] [2022-11-18 19:32:03,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:32:03,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:32:03,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:32:03,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:32:03,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:32:03,694 INFO L87 Difference]: Start difference. First operand 86 states and 92 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-18 19:32:03,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:03,803 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2022-11-18 19:32:03,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:32:03,808 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-18 19:32:03,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:03,808 INFO L225 Difference]: With dead ends: 86 [2022-11-18 19:32:03,809 INFO L226 Difference]: Without dead ends: 86 [2022-11-18 19:32:03,809 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-18 19:32:03,811 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 132 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-18 19:32:03,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 132 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:32:03,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-18 19:32:03,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2022-11-18 19:32:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 74 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 19:32:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2022-11-18 19:32:03,818 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 11 [2022-11-18 19:32:03,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:03,818 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2022-11-18 19:32:03,818 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-18 19:32:03,819 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2022-11-18 19:32:03,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 19:32:03,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:03,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:32:03,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:04,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:04,031 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-18 19:32:04,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:04,032 INFO L85 PathProgramCache]: Analyzing trace with hash -778231821, now seen corresponding path program 1 times [2022-11-18 19:32:04,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:32:04,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486645212] [2022-11-18 19:32:04,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:04,033 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-18 19:32:04,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:32:04,041 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:04,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:04,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 19:32:04,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:32:04,148 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-18 19:32:04,172 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-18 19:32:04,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:32:04,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:32:04,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486645212] [2022-11-18 19:32:04,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486645212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:32:04,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:32:04,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:32:04,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940214394] [2022-11-18 19:32:04,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:32:04,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:32:04,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:32:04,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:32:04,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:32:04,176 INFO L87 Difference]: Start difference. First operand 85 states and 91 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-18 19:32:04,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:04,313 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2022-11-18 19:32:04,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:32:04,314 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-18 19:32:04,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:04,315 INFO L225 Difference]: With dead ends: 85 [2022-11-18 19:32:04,315 INFO L226 Difference]: Without dead ends: 85 [2022-11-18 19:32:04,315 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-18 19:32:04,316 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 5 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 136 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-18 19:32:04,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 136 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:32:04,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-18 19:32:04,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2022-11-18 19:32:04,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 48 states have (on average 1.625) internal successors, (78), 73 states have internal predecessors, (78), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 19:32:04,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2022-11-18 19:32:04,323 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 11 [2022-11-18 19:32:04,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:04,324 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2022-11-18 19:32:04,324 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-18 19:32:04,324 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-11-18 19:32:04,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 19:32:04,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:04,325 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:32:04,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-18 19:32:04,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:04,536 INFO L420 AbstractCegarLoop]: === Iteration 6 === 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-18 19:32:04,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:04,536 INFO L85 PathProgramCache]: Analyzing trace with hash -70636768, now seen corresponding path program 1 times [2022-11-18 19:32:04,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:32:04,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173514124] [2022-11-18 19:32:04,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:04,537 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-18 19:32:04,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:32:04,538 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:04,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:04,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-18 19:32:04,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:32:04,709 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-18 19:32:04,715 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-18 19:32:04,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:32:04,848 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-18 19:32:04,864 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:32:04,864 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-18 19:32:04,957 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-18 19:32:04,958 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:32:04,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:32:04,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173514124] [2022-11-18 19:32:04,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173514124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:32:04,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:32:04,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:32:04,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588499523] [2022-11-18 19:32:04,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:32:04,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 19:32:04,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:32:04,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 19:32:04,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:32:04,960 INFO L87 Difference]: Start difference. First operand 84 states and 90 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-18 19:32:05,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:05,644 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2022-11-18 19:32:05,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:32:05,645 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-18 19:32:05,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:05,646 INFO L225 Difference]: With dead ends: 112 [2022-11-18 19:32:05,646 INFO L226 Difference]: Without dead ends: 112 [2022-11-18 19:32:05,646 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-18 19:32:05,647 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 54 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:32:05,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 331 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:32:05,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-18 19:32:05,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2022-11-18 19:32:05,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.6349206349206349) internal successors, (103), 89 states have internal predecessors, (103), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-18 19:32:05,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2022-11-18 19:32:05,653 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 14 [2022-11-18 19:32:05,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:05,653 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2022-11-18 19:32:05,653 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-18 19:32:05,654 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2022-11-18 19:32:05,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 19:32:05,654 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:05,654 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:32:05,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:05,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:05,880 INFO L420 AbstractCegarLoop]: === Iteration 7 === 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-18 19:32:05,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:05,880 INFO L85 PathProgramCache]: Analyzing trace with hash -70636769, now seen corresponding path program 1 times [2022-11-18 19:32:05,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:32:05,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093672607] [2022-11-18 19:32:05,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:05,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:32:05,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:32:05,882 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:05,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:06,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-18 19:32:06,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:32:06,053 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-18 19:32:06,134 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-18 19:32:06,135 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-18 19:32:06,210 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-18 19:32:06,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:32:06,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:32:06,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093672607] [2022-11-18 19:32:06,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093672607] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:32:06,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:32:06,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:32:06,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334193420] [2022-11-18 19:32:06,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:32:06,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 19:32:06,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:32:06,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 19:32:06,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:32:06,216 INFO L87 Difference]: Start difference. First operand 102 states and 117 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-18 19:32:06,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:06,705 INFO L93 Difference]: Finished difference Result 131 states and 146 transitions. [2022-11-18 19:32:06,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:32:06,705 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-18 19:32:06,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:06,706 INFO L225 Difference]: With dead ends: 131 [2022-11-18 19:32:06,706 INFO L226 Difference]: Without dead ends: 131 [2022-11-18 19:32:06,707 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-18 19:32:06,707 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 87 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 19:32:06,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 278 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 19:32:06,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-18 19:32:06,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 112. [2022-11-18 19:32:06,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 72 states have (on average 1.6666666666666667) internal successors, (120), 98 states have internal predecessors, (120), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-18 19:32:06,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2022-11-18 19:32:06,715 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 14 [2022-11-18 19:32:06,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:06,715 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2022-11-18 19:32:06,716 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-18 19:32:06,716 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2022-11-18 19:32:06,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 19:32:06,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:06,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:32:06,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:06,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:06,935 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-18 19:32:06,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:06,935 INFO L85 PathProgramCache]: Analyzing trace with hash 837542848, now seen corresponding path program 1 times [2022-11-18 19:32:06,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:32:06,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360184804] [2022-11-18 19:32:06,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:06,936 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-18 19:32:06,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:32:06,937 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:06,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:07,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 19:32:07,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:32:07,094 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-18 19:32:07,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:32:07,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:32:07,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360184804] [2022-11-18 19:32:07,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [360184804] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:32:07,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:32:07,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:32:07,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879102424] [2022-11-18 19:32:07,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:32:07,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:32:07,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:32:07,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:32:07,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:32:07,097 INFO L87 Difference]: Start difference. First operand 112 states and 134 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-18 19:32:07,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:07,259 INFO L93 Difference]: Finished difference Result 111 states and 131 transitions. [2022-11-18 19:32:07,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:32:07,260 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-18 19:32:07,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:07,261 INFO L225 Difference]: With dead ends: 111 [2022-11-18 19:32:07,261 INFO L226 Difference]: Without dead ends: 111 [2022-11-18 19:32:07,262 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-18 19:32:07,262 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 27 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 169 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-18 19:32:07,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 169 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:32:07,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-18 19:32:07,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-11-18 19:32:07,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 72 states have (on average 1.625) internal successors, (117), 97 states have internal predecessors, (117), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-18 19:32:07,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2022-11-18 19:32:07,269 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 16 [2022-11-18 19:32:07,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:07,269 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2022-11-18 19:32:07,269 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-18 19:32:07,269 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2022-11-18 19:32:07,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 19:32:07,270 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:07,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:32:07,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:07,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:07,487 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-18 19:32:07,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:07,488 INFO L85 PathProgramCache]: Analyzing trace with hash 837542849, now seen corresponding path program 1 times [2022-11-18 19:32:07,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:32:07,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222954648] [2022-11-18 19:32:07,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:07,489 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-18 19:32:07,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:32:07,490 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:07,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:07,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-18 19:32:07,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:32:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:32:07,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:32:07,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:32:07,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222954648] [2022-11-18 19:32:07,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222954648] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:32:07,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:32:07,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 19:32:07,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176856888] [2022-11-18 19:32:07,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:32:07,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 19:32:07,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:32:07,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 19:32:07,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:32:07,745 INFO L87 Difference]: Start difference. First operand 111 states and 131 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-18 19:32:08,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:08,159 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2022-11-18 19:32:08,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 19:32:08,160 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-18 19:32:08,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:08,161 INFO L225 Difference]: With dead ends: 119 [2022-11-18 19:32:08,161 INFO L226 Difference]: Without dead ends: 119 [2022-11-18 19:32:08,161 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-18 19:32:08,162 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 97 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 511 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.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:32:08,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 511 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:32:08,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-18 19:32:08,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2022-11-18 19:32:08,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 72 states have (on average 1.6111111111111112) internal successors, (116), 97 states have internal predecessors, (116), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-18 19:32:08,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 130 transitions. [2022-11-18 19:32:08,168 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 130 transitions. Word has length 16 [2022-11-18 19:32:08,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:08,168 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 130 transitions. [2022-11-18 19:32:08,168 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-18 19:32:08,168 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2022-11-18 19:32:08,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 19:32:08,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:08,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:32:08,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:08,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:08,370 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-18 19:32:08,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:08,371 INFO L85 PathProgramCache]: Analyzing trace with hash 194024551, now seen corresponding path program 1 times [2022-11-18 19:32:08,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:32:08,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [908422450] [2022-11-18 19:32:08,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:08,371 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-18 19:32:08,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:32:08,373 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:08,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:08,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 19:32:08,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:32:08,540 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-18 19:32:08,584 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-18 19:32:08,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:32:08,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:32:08,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [908422450] [2022-11-18 19:32:08,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [908422450] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:32:08,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:32:08,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:32:08,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111482252] [2022-11-18 19:32:08,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:32:08,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:32:08,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:32:08,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:32:08,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:32:08,587 INFO L87 Difference]: Start difference. First operand 111 states and 130 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-18 19:32:08,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:08,912 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2022-11-18 19:32:08,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:32:08,913 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-18 19:32:08,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:08,914 INFO L225 Difference]: With dead ends: 118 [2022-11-18 19:32:08,914 INFO L226 Difference]: Without dead ends: 118 [2022-11-18 19:32:08,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:32:08,914 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 49 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 251 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-18 19:32:08,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 251 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:32:08,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-18 19:32:08,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2022-11-18 19:32:08,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 96 states have internal predecessors, (111), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-18 19:32:08,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2022-11-18 19:32:08,920 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 17 [2022-11-18 19:32:08,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:08,921 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2022-11-18 19:32:08,921 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-18 19:32:08,921 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2022-11-18 19:32:08,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 19:32:08,921 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:08,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:32:08,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:09,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:09,134 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-18 19:32:09,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:09,134 INFO L85 PathProgramCache]: Analyzing trace with hash 194024552, now seen corresponding path program 1 times [2022-11-18 19:32:09,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:32:09,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443640388] [2022-11-18 19:32:09,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:09,135 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-18 19:32:09,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:32:09,136 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:09,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:09,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-18 19:32:09,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:32:09,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 19:32:09,400 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-18 19:32:09,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:32:09,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:32:09,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443640388] [2022-11-18 19:32:09,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443640388] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:32:09,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:32:09,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:32:09,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70946375] [2022-11-18 19:32:09,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:32:09,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:32:09,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:32:09,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:32:09,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:32:09,403 INFO L87 Difference]: Start difference. First operand 110 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-18 19:32:09,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:09,787 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2022-11-18 19:32:09,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:32:09,789 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-18 19:32:09,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:09,790 INFO L225 Difference]: With dead ends: 116 [2022-11-18 19:32:09,790 INFO L226 Difference]: Without dead ends: 116 [2022-11-18 19:32:09,790 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-18 19:32:09,791 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 36 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 271 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-18 19:32:09,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 271 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:32:09,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-18 19:32:09,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2022-11-18 19:32:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 96 states have internal predecessors, (107), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-18 19:32:09,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-11-18 19:32:09,795 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 17 [2022-11-18 19:32:09,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:09,796 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-11-18 19:32:09,796 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-18 19:32:09,796 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-11-18 19:32:09,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-18 19:32:09,796 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:09,797 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-18 19:32:09,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:10,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:10,010 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-18 19:32:10,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:10,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1774001130, now seen corresponding path program 1 times [2022-11-18 19:32:10,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:32:10,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [996939936] [2022-11-18 19:32:10,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:10,011 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-18 19:32:10,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:32:10,012 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:10,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:10,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-18 19:32:10,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:32:10,246 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-18 19:32:10,282 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-18 19:32:10,319 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-18 19:32:10,348 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:32:10,348 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-18 19:32:10,393 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-18 19:32:10,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-18 19:32:10,530 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-18 19:32:10,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:32:10,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:32:10,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [996939936] [2022-11-18 19:32:10,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [996939936] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:32:10,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:32:10,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-18 19:32:10,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549061726] [2022-11-18 19:32:10,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:32:10,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 19:32:10,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:32:10,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 19:32:10,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-11-18 19:32:10,532 INFO L87 Difference]: Start difference. First operand 110 states and 121 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-18 19:32:11,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:11,620 INFO L93 Difference]: Finished difference Result 145 states and 161 transitions. [2022-11-18 19:32:11,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 19:32:11,621 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-18 19:32:11,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:11,622 INFO L225 Difference]: With dead ends: 145 [2022-11-18 19:32:11,622 INFO L226 Difference]: Without dead ends: 145 [2022-11-18 19:32:11,623 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-18 19:32:11,623 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 62 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 19:32:11,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 435 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-18 19:32:11,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-18 19:32:11,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2022-11-18 19:32:11,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 92 states have (on average 1.423913043478261) internal successors, (131), 116 states have internal predecessors, (131), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-18 19:32:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2022-11-18 19:32:11,644 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 19 [2022-11-18 19:32:11,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:11,646 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2022-11-18 19:32:11,646 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-18 19:32:11,646 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2022-11-18 19:32:11,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-18 19:32:11,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:11,647 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-18 19:32:11,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:11,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:11,863 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-18 19:32:11,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:11,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1774001131, now seen corresponding path program 1 times [2022-11-18 19:32:11,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:32:11,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277584849] [2022-11-18 19:32:11,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:11,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:32:11,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:32:11,866 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:11,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:12,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-18 19:32:12,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:32:12,132 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-18 19:32:12,143 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-18 19:32:12,240 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-18 19:32:12,251 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-18 19:32:12,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:32:12,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-18 19:32:12,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:32:12,343 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-18 19:32:12,391 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:32:12,392 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-18 19:32:12,408 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-18 19:32:12,492 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-18 19:32:12,510 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-18 19:32:12,667 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-18 19:32:12,673 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-18 19:32:12,761 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-18 19:32:12,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:32:12,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:32:12,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277584849] [2022-11-18 19:32:12,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [277584849] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:32:12,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:32:12,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-18 19:32:12,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602113043] [2022-11-18 19:32:12,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:32:12,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 19:32:12,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:32:12,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 19:32:12,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-11-18 19:32:12,764 INFO L87 Difference]: Start difference. First operand 132 states and 149 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-18 19:32:14,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:14,226 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2022-11-18 19:32:14,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 19:32:14,227 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-18 19:32:14,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:14,229 INFO L225 Difference]: With dead ends: 135 [2022-11-18 19:32:14,229 INFO L226 Difference]: Without dead ends: 135 [2022-11-18 19:32:14,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-11-18 19:32:14,230 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 35 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:32:14,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 508 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-18 19:32:14,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-18 19:32:14,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-11-18 19:32:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 119 states have internal predecessors, (132), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-18 19:32:14,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2022-11-18 19:32:14,237 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 19 [2022-11-18 19:32:14,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:14,237 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2022-11-18 19:32:14,237 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-18 19:32:14,237 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2022-11-18 19:32:14,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 19:32:14,238 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:14,238 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-18 19:32:14,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:14,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:14,439 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-18 19:32:14,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:14,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1031850971, now seen corresponding path program 1 times [2022-11-18 19:32:14,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:32:14,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103708807] [2022-11-18 19:32:14,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:14,440 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-18 19:32:14,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:32:14,441 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:14,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:14,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-18 19:32:14,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:32:14,699 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-18 19:32:14,705 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-18 19:32:14,798 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-18 19:32:14,842 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-18 19:32:14,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:32:14,903 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-18 19:32:14,924 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:32:14,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-18 19:32:14,993 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-18 19:32:14,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:32:17,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:32:17,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103708807] [2022-11-18 19:32:17,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2103708807] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:32:17,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [881071084] [2022-11-18 19:32:17,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:17,458 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 19:32:17,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 19:32:17,461 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 19:32:17,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2022-11-18 19:32:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:17,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-18 19:32:17,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:32:17,982 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-18 19:32:17,990 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-18 19:32:18,190 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-18 19:32:18,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:32:18,584 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-18 19:32:18,600 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:32:18,605 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-18 19:32:18,631 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-18 19:32:18,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:32:19,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [881071084] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:32:19,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:32:19,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 13 [2022-11-18 19:32:19,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114922467] [2022-11-18 19:32:19,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:32:19,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 19:32:19,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:32:19,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 19:32:19,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=263, Unknown=3, NotChecked=32, Total=342 [2022-11-18 19:32:19,504 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 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-18 19:32:25,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:25,201 INFO L93 Difference]: Finished difference Result 163 states and 184 transitions. [2022-11-18 19:32:25,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 19:32:25,202 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 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-18 19:32:25,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:25,204 INFO L225 Difference]: With dead ends: 163 [2022-11-18 19:32:25,204 INFO L226 Difference]: Without dead ends: 163 [2022-11-18 19:32:25,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=76, Invalid=429, Unknown=5, NotChecked=42, Total=552 [2022-11-18 19:32:25,207 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 78 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 226 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:32:25,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 297 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 473 Invalid, 0 Unknown, 226 Unchecked, 1.2s Time] [2022-11-18 19:32:25,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-18 19:32:25,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 143. [2022-11-18 19:32:25,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 100 states have (on average 1.39) internal successors, (139), 124 states have internal predecessors, (139), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-11-18 19:32:25,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 160 transitions. [2022-11-18 19:32:25,225 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 160 transitions. Word has length 29 [2022-11-18 19:32:25,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:25,225 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 160 transitions. [2022-11-18 19:32:25,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 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-18 19:32:25,226 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 160 transitions. [2022-11-18 19:32:25,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-18 19:32:25,233 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:25,233 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-18 19:32:25,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:25,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2022-11-18 19:32:25,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt [2022-11-18 19:32:25,647 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-18 19:32:25,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:25,648 INFO L85 PathProgramCache]: Analyzing trace with hash 343570640, now seen corresponding path program 1 times [2022-11-18 19:32:25,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:32:25,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923134878] [2022-11-18 19:32:25,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:25,649 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-18 19:32:25,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:32:25,650 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:25,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-18 19:32:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:26,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-18 19:32:26,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:32:26,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:32:26,907 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-18 19:32:26,925 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:32:26,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-18 19:32:27,217 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-18 19:32:27,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:32:29,583 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 60 treesize of output 54 [2022-11-18 19:32:29,696 INFO L321 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2022-11-18 19:32:29,696 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 50 treesize of output 67 [2022-11-18 19:32:30,665 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 19:32:30,665 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 38 treesize of output 32 [2022-11-18 19:32:30,692 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-18 19:32:30,693 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-18 19:32:31,344 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:32:31,344 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 38 treesize of output 40 [2022-11-18 19:32:31,528 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-18 19:32:31,528 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-18 19:32:31,888 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-18 19:32:31,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:32:31,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923134878] [2022-11-18 19:32:31,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1923134878] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:32:31,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:32:31,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2022-11-18 19:32:31,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5894984] [2022-11-18 19:32:31,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:32:31,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-18 19:32:31,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:32:31,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-18 19:32:31,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2022-11-18 19:32:31,894 INFO L87 Difference]: Start difference. First operand 143 states and 160 transitions. Second operand has 31 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 25 states have internal predecessors, (58), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 19:32:36,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:36,935 INFO L93 Difference]: Finished difference Result 151 states and 164 transitions. [2022-11-18 19:32:36,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 19:32:36,937 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 25 states have internal predecessors, (58), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-11-18 19:32:36,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:36,938 INFO L225 Difference]: With dead ends: 151 [2022-11-18 19:32:36,938 INFO L226 Difference]: Without dead ends: 151 [2022-11-18 19:32:36,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=227, Invalid=1579, Unknown=0, NotChecked=0, Total=1806 [2022-11-18 19:32:36,944 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 243 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 334 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:32:36,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 821 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 721 Invalid, 0 Unknown, 334 Unchecked, 3.0s Time] [2022-11-18 19:32:36,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-18 19:32:36,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 140. [2022-11-18 19:32:36,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 99 states have (on average 1.3333333333333333) internal successors, (132), 121 states have internal predecessors, (132), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-11-18 19:32:36,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 153 transitions. [2022-11-18 19:32:36,951 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 153 transitions. Word has length 36 [2022-11-18 19:32:36,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:36,952 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 153 transitions. [2022-11-18 19:32:36,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 25 states have internal predecessors, (58), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 19:32:36,952 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 153 transitions. [2022-11-18 19:32:36,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-18 19:32:36,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:36,953 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-18 19:32:36,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-18 19:32:37,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:37,167 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-18 19:32:37,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:37,167 INFO L85 PathProgramCache]: Analyzing trace with hash 2012582842, now seen corresponding path program 1 times [2022-11-18 19:32:37,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:32:37,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519035752] [2022-11-18 19:32:37,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:37,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:32:37,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:32:37,169 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:37,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:37,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-18 19:32:37,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:32:37,686 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-18 19:32:37,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 19:32:37,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-18 19:32:37,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:32:37,856 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-18 19:32:37,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:32:37,873 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-18 19:32:37,943 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 19:32:37,944 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-18 19:32:38,121 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-18 19:32:38,156 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-18 19:32:38,184 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-18 19:32:38,199 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-18 19:32:39,768 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-18 19:32:39,835 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2022-11-18 19:32:39,835 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-18 19:32:39,844 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-18 19:32:39,859 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-18 19:32:39,884 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 30 [2022-11-18 19:32:40,188 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-11-18 19:32:40,188 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-18 19:32:40,395 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-18 19:32:40,920 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-18 19:32:41,352 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-18 19:32:41,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:32:41,962 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_713) |c_create_sub_list_insert_sub_~head#1.base|) (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (_ bv1 1)))) is different from false [2022-11-18 19:32:47,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:32:47,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519035752] [2022-11-18 19:32:47,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519035752] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:32:47,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [696972815] [2022-11-18 19:32:47,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:47,094 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 19:32:47,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 19:32:47,095 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 19:32:47,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2022-11-18 19:32:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:47,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 79 conjunts are in the unsatisfiable core [2022-11-18 19:32:48,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:32:48,011 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-18 19:32:48,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 19:32:48,064 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-18 19:32:48,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:32:48,083 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-18 19:32:48,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:32:48,099 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-18 19:32:48,154 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 19:32:48,154 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-18 19:32:48,249 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-18 19:32:48,285 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-18 19:32:48,308 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-18 19:32:48,315 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-18 19:32:49,263 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-18 19:32:49,350 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2022-11-18 19:32:49,351 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-18 19:32:49,362 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-18 19:32:49,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:32:49,374 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 120 treesize of output 84 [2022-11-18 19:32:49,390 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-18 19:32:49,539 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-11-18 19:32:49,539 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-18 19:32:49,773 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-18 19:32:50,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 27 treesize of output 15 [2022-11-18 19:32:50,607 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-18 19:32:50,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:32:50,663 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_835) |c_create_sub_list_insert_sub_~head#1.base|) (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (_ bv1 1)))) is different from false [2022-11-18 19:32:52,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [696972815] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:32:52,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:32:52,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 27 [2022-11-18 19:32:52,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317213622] [2022-11-18 19:32:52,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:32:52,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-18 19:32:52,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:32:52,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-18 19:32:52,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1187, Unknown=41, NotChecked=142, Total=1482 [2022-11-18 19:32:52,806 INFO L87 Difference]: Start difference. First operand 140 states and 153 transitions. Second operand has 28 states, 25 states have (on average 1.64) internal successors, (41), 24 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 19:32:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:32:54,510 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2022-11-18 19:32:54,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-18 19:32:54,511 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.64) internal successors, (41), 24 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-11-18 19:32:54,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:32:54,513 INFO L225 Difference]: With dead ends: 151 [2022-11-18 19:32:54,513 INFO L226 Difference]: Without dead ends: 151 [2022-11-18 19:32:54,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=162, Invalid=1609, Unknown=43, NotChecked=166, Total=1980 [2022-11-18 19:32:54,514 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 28 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 650 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-18 19:32:54,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 879 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 302 Invalid, 0 Unknown, 650 Unchecked, 0.9s Time] [2022-11-18 19:32:54,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-18 19:32:54,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-11-18 19:32:54,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 109 states have (on average 1.311926605504587) internal successors, (143), 131 states have internal predecessors, (143), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (12), 9 states have call predecessors, (12), 11 states have call successors, (12) [2022-11-18 19:32:54,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 166 transitions. [2022-11-18 19:32:54,522 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 166 transitions. Word has length 35 [2022-11-18 19:32:54,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:32:54,523 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 166 transitions. [2022-11-18 19:32:54,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.64) internal successors, (41), 24 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 19:32:54,524 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 166 transitions. [2022-11-18 19:32:54,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-18 19:32:54,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:32:54,525 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-18 19:32:54,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2022-11-18 19:32:54,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:54,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:54,932 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-18 19:32:54,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:32:54,933 INFO L85 PathProgramCache]: Analyzing trace with hash 2012582843, now seen corresponding path program 1 times [2022-11-18 19:32:54,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:32:54,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388759128] [2022-11-18 19:32:54,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:32:54,933 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-18 19:32:54,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:32:54,936 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:32:54,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-18 19:32:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:32:55,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-18 19:32:55,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:32:55,461 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-18 19:32:55,530 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-18 19:32:55,538 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-18 19:32:55,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:32:55,593 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-18 19:32:55,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:32:55,605 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-18 19:32:55,665 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 19:32:55,665 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-18 19:32:55,699 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-18 19:32:55,850 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-18 19:32:55,868 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-18 19:32:55,911 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-18 19:32:55,919 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-18 19:32:58,119 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-18 19:32:58,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:32:58,142 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-18 19:32:58,152 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-18 19:32:58,218 INFO L321 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-11-18 19:32:58,218 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-18 19:32:58,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:32:58,227 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-18 19:32:58,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:32:58,278 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-18 19:32:58,615 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-18 19:32:58,615 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-18 19:32:58,648 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-18 19:32:58,892 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-18 19:32:58,926 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 19:32:58,926 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-18 19:32:59,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-18 19:32:59,410 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-18 19:32:59,738 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-18 19:32:59,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:33:01,114 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_965 (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_965) |c_create_sub_list_insert_sub_~head#1.base|) .cse1))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_965 (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_965) |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_964) |c_create_sub_list_insert_sub_~head#1.base|) .cse1)))))) is different from false [2022-11-18 19:33:16,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:33:16,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388759128] [2022-11-18 19:33:16,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388759128] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:33:16,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [448715175] [2022-11-18 19:33:16,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:16,108 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 19:33:16,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 19:33:16,110 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 19:33:16,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-11-18 19:33:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:17,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-18 19:33:17,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:33:17,647 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-18 19:33:17,687 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-18 19:33:17,699 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-18 19:33:17,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:17,716 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-18 19:33:17,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:17,741 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-18 19:33:17,762 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-18 19:33:17,823 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 19:33:17,823 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-18 19:33:17,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-18 19:33:17,996 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-18 19:33:18,021 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-18 19:33:18,030 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-18 19:33:23,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 91 [2022-11-18 19:33:23,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:24,004 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-18 19:33:24,016 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 86 treesize of output 45 [2022-11-18 19:33:24,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:24,027 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-18 19:33:24,098 INFO L321 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-11-18 19:33:24,098 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-18 19:33:24,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:24,110 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-18 19:33:24,886 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-18 19:33:24,887 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-18 19:33:24,942 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-18 19:33:25,512 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 19:33:25,512 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 105 treesize of output 89 [2022-11-18 19:33:25,525 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-18 19:33:25,599 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-18 19:33:25,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 19:33:25,960 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-18 19:33:25,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:33:26,127 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_1104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1105 (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_1104) |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_1105) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)))) (forall ((v_ArrVal_1104 (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_1104) |c_create_sub_list_insert_sub_~head#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) is different from false [2022-11-18 19:33:39,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [448715175] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:33:39,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:33:39,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2022-11-18 19:33:39,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397763996] [2022-11-18 19:33:39,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:33:39,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-18 19:33:39,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:33:39,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-18 19:33:39,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1417, Unknown=33, NotChecked=154, Total=1722 [2022-11-18 19:33:39,769 INFO L87 Difference]: Start difference. First operand 151 states and 166 transitions. Second operand has 31 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 28 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 19:33:48,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:48,691 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2022-11-18 19:33:48,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-18 19:33:48,692 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 28 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-11-18 19:33:48,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:48,693 INFO L225 Difference]: With dead ends: 154 [2022-11-18 19:33:48,694 INFO L226 Difference]: Without dead ends: 154 [2022-11-18 19:33:48,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=192, Invalid=2229, Unknown=37, NotChecked=194, Total=2652 [2022-11-18 19:33:48,696 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 24 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 660 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:48,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 805 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 295 Invalid, 0 Unknown, 660 Unchecked, 0.9s Time] [2022-11-18 19:33:48,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-18 19:33:48,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2022-11-18 19:33:48,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 134 states have internal predecessors, (144), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (12), 9 states have call predecessors, (12), 11 states have call successors, (12) [2022-11-18 19:33:48,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 167 transitions. [2022-11-18 19:33:48,704 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 167 transitions. Word has length 35 [2022-11-18 19:33:48,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:48,704 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 167 transitions. [2022-11-18 19:33:48,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 28 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 19:33:48,705 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 167 transitions. [2022-11-18 19:33:48,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-18 19:33:48,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:48,706 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-18 19:33:48,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2022-11-18 19:33:48,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-18 19:33:49,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:33:49,115 INFO L420 AbstractCegarLoop]: === Iteration 18 === 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-18 19:33:49,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:49,115 INFO L85 PathProgramCache]: Analyzing trace with hash -796271557, now seen corresponding path program 1 times [2022-11-18 19:33:49,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:33:49,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902558815] [2022-11-18 19:33:49,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:49,116 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-18 19:33:49,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:33:49,118 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:33:49,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-18 19:33:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:49,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-18 19:33:49,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:33:49,873 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-18 19:33:49,885 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-18 19:33:49,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:49,971 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-18 19:33:49,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:33:49,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-18 19:33:50,048 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:33:50,048 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-18 19:33:50,166 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-18 19:33:50,179 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-18 19:33:50,429 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-18 19:33:50,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 15 treesize of output 7 [2022-11-18 19:33:50,617 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-18 19:33:50,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:33:50,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:33:50,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 46 treesize of output 50 [2022-11-18 19:33:51,706 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_1240 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1240) |c_create_sub_list_insert_sub_~head#1.base|) .cse0) |c_create_sub_list_insert_sub_~head#1.base|)) (forall ((v_ArrVal_1241 (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_1241) |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_1241 (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_1241) |c_create_sub_list_insert_sub_~head#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) is different from false [2022-11-18 19:33:51,801 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_33| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_33|))) (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |v_create_sub_list_insert_sub_~sub~0#1.base_33| v_ArrVal_1240) |c_create_sub_list_~sub#1.base|) .cse0) |c_create_sub_list_~sub#1.base|)))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_33| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_33|))) (forall ((v_ArrVal_1241 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |v_create_sub_list_insert_sub_~sub~0#1.base_33| v_ArrVal_1241) |c_create_sub_list_~sub#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_33| (_ BitVec 32))) (or (forall ((v_ArrVal_1241 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |v_create_sub_list_insert_sub_~sub~0#1.base_33| v_ArrVal_1241) |c_create_sub_list_~sub#1.base|) .cse0)) (bvadd (_ bv8 32) |c_create_sub_list_~sub#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_33|))))))) is different from false [2022-11-18 19:33:52,406 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:33:52,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 49 treesize of output 42 [2022-11-18 19:33:52,412 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-18 19:33:52,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 17 treesize of output 9 [2022-11-18 19:33:52,457 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-18 19:33:52,457 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 1 [2022-11-18 19:33:52,485 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:33:52,485 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-18 19:33:52,490 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:33:52,493 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-18 19:33:53,759 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:33:53,760 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-18 19:33:54,122 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-18 19:33:54,122 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-18 19:33:54,180 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-18 19:33:54,180 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-18 19:33:54,217 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-18 19:33:54,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:33:54,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902558815] [2022-11-18 19:33:54,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902558815] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:33:54,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:33:54,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 29 [2022-11-18 19:33:54,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132715935] [2022-11-18 19:33:54,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:33:54,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-18 19:33:54,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:33:54,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-18 19:33:54,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=687, Unknown=2, NotChecked=106, Total=870 [2022-11-18 19:33:54,221 INFO L87 Difference]: Start difference. First operand 154 states and 167 transitions. Second operand has 30 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 19:33:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:33:58,993 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2022-11-18 19:33:58,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 19:33:58,994 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 41 [2022-11-18 19:33:58,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:33:58,995 INFO L225 Difference]: With dead ends: 165 [2022-11-18 19:33:58,995 INFO L226 Difference]: Without dead ends: 165 [2022-11-18 19:33:58,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=208, Invalid=1519, Unknown=3, NotChecked=162, Total=1892 [2022-11-18 19:33:58,996 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 116 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 362 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-18 19:33:58,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 975 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 664 Invalid, 0 Unknown, 362 Unchecked, 2.8s Time] [2022-11-18 19:33:58,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-18 19:33:59,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2022-11-18 19:33:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 113 states have (on average 1.2831858407079646) internal successors, (145), 137 states have internal predecessors, (145), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (12), 9 states have call predecessors, (12), 11 states have call successors, (12) [2022-11-18 19:33:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 168 transitions. [2022-11-18 19:33:59,017 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 168 transitions. Word has length 41 [2022-11-18 19:33:59,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:33:59,018 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 168 transitions. [2022-11-18 19:33:59,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 19:33:59,018 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2022-11-18 19:33:59,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-18 19:33:59,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:33:59,022 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-18 19:33:59,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-18 19:33:59,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:33:59,239 INFO L420 AbstractCegarLoop]: === Iteration 19 === 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-18 19:33:59,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:33:59,240 INFO L85 PathProgramCache]: Analyzing trace with hash 782352299, now seen corresponding path program 1 times [2022-11-18 19:33:59,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:33:59,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191327635] [2022-11-18 19:33:59,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:33:59,240 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-18 19:33:59,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:33:59,241 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:33:59,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-18 19:33:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:33:59,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-18 19:33:59,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:33:59,659 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-18 19:33:59,668 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-18 19:33:59,864 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-18 19:34:00,088 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:34:00,088 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-18 19:34:00,114 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_create_sub_list_insert_sub_~sub~0#1.base_38| (_ BitVec 32)) (|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32)) (v_ArrVal_1343 (_ BitVec 32)) (v_ArrVal_1342 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_create_sub_list_insert_sub_~sub~0#1.base_38|)) (= (store (store |c_old(#length)| |v_create_sub_list_insert_sub_~sub~0#1.base_38| v_ArrVal_1342) |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1343) |c_#length|) (not (= |c_create_sub_list_#in~sub#1.base| |create_sub_list_insert_sub_~sub~0#1.base|)))) is different from true [2022-11-18 19:34:00,191 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 19:34:00,192 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-18 19:34:00,197 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-18 19:34:00,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:00,339 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 19:34:00,339 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-18 19:34:00,367 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:34:00,368 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-18 19:34:00,517 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-18 19:34:00,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:34:01,219 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-18 19:34:01,219 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-18 19:34:05,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:34:05,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191327635] [2022-11-18 19:34:05,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191327635] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:34:05,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [983411392] [2022-11-18 19:34:05,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:34:05,594 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 19:34:05,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 19:34:05,595 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 19:34:05,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-11-18 19:34:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:06,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-18 19:34:06,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:34:06,418 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-18 19:34:06,426 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-18 19:34:06,785 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-18 19:34:07,073 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:34:07,074 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-18 19:34:07,340 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 19:34:07,340 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-18 19:34:07,347 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-18 19:34:08,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:08,054 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 19:34:08,054 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-18 19:34:08,078 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:34:08,079 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-18 19:34:08,106 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-18 19:34:08,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:34:09,101 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-18 19:34:09,101 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-18 19:34:12,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [983411392] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:34:12,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:34:12,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 21 [2022-11-18 19:34:12,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136100082] [2022-11-18 19:34:12,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:34:12,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-18 19:34:12,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:34:12,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-18 19:34:12,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=582, Unknown=5, NotChecked=48, Total=702 [2022-11-18 19:34:12,056 INFO L87 Difference]: Start difference. First operand 157 states and 168 transitions. Second operand has 22 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 19:34:18,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:34:18,013 INFO L93 Difference]: Finished difference Result 194 states and 216 transitions. [2022-11-18 19:34:18,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 19:34:18,014 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-11-18 19:34:18,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:34:18,015 INFO L225 Difference]: With dead ends: 194 [2022-11-18 19:34:18,016 INFO L226 Difference]: Without dead ends: 194 [2022-11-18 19:34:18,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=107, Invalid=820, Unknown=7, NotChecked=58, Total=992 [2022-11-18 19:34:18,017 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 106 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 512 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:34:18,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 462 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 479 Invalid, 0 Unknown, 512 Unchecked, 1.2s Time] [2022-11-18 19:34:18,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-18 19:34:18,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 159. [2022-11-18 19:34:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 138 states have internal predecessors, (148), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-11-18 19:34:18,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 171 transitions. [2022-11-18 19:34:18,026 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 171 transitions. Word has length 45 [2022-11-18 19:34:18,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:34:18,027 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 171 transitions. [2022-11-18 19:34:18,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 19:34:18,027 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 171 transitions. [2022-11-18 19:34:18,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-18 19:34:18,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:34:18,028 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-18 19:34:18,041 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-11-18 19:34:18,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2022-11-18 19:34:18,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt [2022-11-18 19:34:18,435 INFO L420 AbstractCegarLoop]: === Iteration 20 === 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-18 19:34:18,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:34:18,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1563009013, now seen corresponding path program 1 times [2022-11-18 19:34:18,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:34:18,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345424962] [2022-11-18 19:34:18,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:34:18,436 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-18 19:34:18,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:34:18,437 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:34:18,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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)] Waiting until timeout for monitored process [2022-11-18 19:34:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:18,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-18 19:34:18,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:34:18,931 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-18 19:34:18,954 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-18 19:34:19,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:19,009 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-18 19:34:19,037 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:34:19,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 13 treesize of output 13 [2022-11-18 19:34:19,102 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-18 19:34:19,257 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-18 19:34:19,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:19,451 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-18 19:34:19,563 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-18 19:34:19,575 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-18 19:34:19,656 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (= (select |c_#length| |create_sub_list_insert_sub_~sub~0#1.base|) (_ bv12 32))) (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-18 19:34:19,715 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 19:34:19,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 12 treesize of output 18 [2022-11-18 19:34:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-18 19:34:20,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:34:20,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:34:20,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345424962] [2022-11-18 19:34:20,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345424962] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:34:20,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [282614054] [2022-11-18 19:34:20,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:34:20,746 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 19:34:20,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 19:34:20,748 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 19:34:20,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-11-18 19:34:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:22,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-18 19:34:22,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:34:22,733 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-18 19:34:22,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:22,835 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-18 19:34:22,957 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-18 19:34:23,187 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-18 19:34:23,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:23,398 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-18 19:34:23,433 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-18 19:34:23,562 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-18 19:34:23,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:23,797 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-18 19:34:24,065 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-18 19:34:24,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:34:25,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [282614054] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:34:25,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:34:25,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 19 [2022-11-18 19:34:25,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140371326] [2022-11-18 19:34:25,140 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:34:25,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 19:34:25,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:34:25,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 19:34:25,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=435, Unknown=4, NotChecked=86, Total=600 [2022-11-18 19:34:25,141 INFO L87 Difference]: Start difference. First operand 159 states and 171 transitions. Second operand has 20 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 6 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 19:34:27,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:34:27,151 INFO L93 Difference]: Finished difference Result 230 states and 249 transitions. [2022-11-18 19:34:27,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 19:34:27,152 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 6 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-11-18 19:34:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:34:27,154 INFO L225 Difference]: With dead ends: 230 [2022-11-18 19:34:27,154 INFO L226 Difference]: Without dead ends: 230 [2022-11-18 19:34:27,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 82 SyntacticMatches, 8 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=126, Invalid=802, Unknown=10, NotChecked=118, Total=1056 [2022-11-18 19:34:27,155 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 58 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 566 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:34:27,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 447 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 374 Invalid, 0 Unknown, 566 Unchecked, 1.0s Time] [2022-11-18 19:34:27,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-18 19:34:27,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 222. [2022-11-18 19:34:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 166 states have (on average 1.2530120481927711) internal successors, (208), 191 states have internal predecessors, (208), 16 states have call successors, (16), 15 states have call predecessors, (16), 17 states have return successors, (23), 15 states have call predecessors, (23), 16 states have call successors, (23) [2022-11-18 19:34:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 247 transitions. [2022-11-18 19:34:27,165 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 247 transitions. Word has length 51 [2022-11-18 19:34:27,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:34:27,165 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 247 transitions. [2022-11-18 19:34:27,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 6 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 19:34:27,166 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 247 transitions. [2022-11-18 19:34:27,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-18 19:34:27,166 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:34:27,167 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-18 19:34:27,184 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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)] Ended with exit code 0 [2022-11-18 19:34:27,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2022-11-18 19:34:27,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt [2022-11-18 19:34:27,585 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-18 19:34:27,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:34:27,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1563009014, now seen corresponding path program 1 times [2022-11-18 19:34:27,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:34:27,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685207435] [2022-11-18 19:34:27,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:34:27,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:34:27,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:34:27,587 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:34:27,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:34:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:28,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-18 19:34:28,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:34:28,109 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-18 19:34:28,175 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 19:34:28,175 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-18 19:34:28,218 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-18 19:34:28,339 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-18 19:34:28,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:28,533 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-18 19:34:28,654 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-18 19:34:28,667 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-18 19:34:28,852 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-18 19:34:28,852 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-18 19:34:29,067 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-18 19:34:29,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:34:29,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:34:29,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685207435] [2022-11-18 19:34:29,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685207435] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:34:29,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [42734869] [2022-11-18 19:34:29,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:34:29,486 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 19:34:29,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 19:34:29,491 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 19:34:29,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-11-18 19:34:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:34:31,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-18 19:34:31,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:34:31,546 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-18 19:34:31,547 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-18 19:34:31,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:31,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:31,685 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-18 19:34:31,686 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 36 [2022-11-18 19:34:31,854 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:34:31,854 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-18 19:34:32,050 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-18 19:34:32,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:32,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:32,267 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-18 19:34:32,267 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 30 treesize of output 45 [2022-11-18 19:34:32,341 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:34:32,342 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-18 19:34:32,476 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-18 19:34:32,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:32,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:32,691 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-18 19:34:32,692 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 30 treesize of output 45 [2022-11-18 19:34:33,229 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-18 19:34:33,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:34:33,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [42734869] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:34:33,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:34:33,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2022-11-18 19:34:33,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142694404] [2022-11-18 19:34:33,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:34:33,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-18 19:34:33,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:34:33,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-18 19:34:33,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=499, Unknown=12, NotChecked=46, Total=650 [2022-11-18 19:34:33,383 INFO L87 Difference]: Start difference. First operand 222 states and 247 transitions. Second operand has 21 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 6 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 19:34:34,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:34:34,019 INFO L93 Difference]: Finished difference Result 241 states and 264 transitions. [2022-11-18 19:34:34,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 19:34:34,020 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 6 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-11-18 19:34:34,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:34:34,022 INFO L225 Difference]: With dead ends: 241 [2022-11-18 19:34:34,022 INFO L226 Difference]: Without dead ends: 241 [2022-11-18 19:34:34,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 87 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=126, Invalid=674, Unknown=16, NotChecked=54, Total=870 [2022-11-18 19:34:34,024 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 47 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 316 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:34:34,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 529 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 140 Invalid, 0 Unknown, 316 Unchecked, 0.3s Time] [2022-11-18 19:34:34,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-11-18 19:34:34,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 222. [2022-11-18 19:34:34,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 166 states have (on average 1.2469879518072289) internal successors, (207), 191 states have internal predecessors, (207), 16 states have call successors, (16), 15 states have call predecessors, (16), 17 states have return successors, (23), 15 states have call predecessors, (23), 16 states have call successors, (23) [2022-11-18 19:34:34,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 246 transitions. [2022-11-18 19:34:34,034 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 246 transitions. Word has length 51 [2022-11-18 19:34:34,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:34:34,035 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 246 transitions. [2022-11-18 19:34:34,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 6 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 19:34:34,036 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 246 transitions. [2022-11-18 19:34:34,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-18 19:34:34,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:34:34,037 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-18 19:34:34,054 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-18 19:34:34,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2022-11-18 19:34:34,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt [2022-11-18 19:34:34,454 INFO L420 AbstractCegarLoop]: === Iteration 22 === 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-18 19:34:34,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:34:34,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1771803766, now seen corresponding path program 2 times [2022-11-18 19:34:34,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:34:34,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561382300] [2022-11-18 19:34:34,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:34:34,455 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-18 19:34:34,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:34:34,456 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:34:34,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-11-18 19:34:35,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:34:35,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:34:35,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-18 19:34:35,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:34:35,325 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-18 19:34:35,415 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-18 19:34:35,424 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-18 19:34:35,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:35,476 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-18 19:34:35,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:35,487 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-18 19:34:35,584 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:34:35,584 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-18 19:34:35,717 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-18 19:34:35,744 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-18 19:34:36,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:36,869 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-18 19:34:36,938 INFO L321 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2022-11-18 19:34:36,939 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-18 19:34:36,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:36,961 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-18 19:34:36,979 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-18 19:34:36,994 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 73 treesize of output 20 [2022-11-18 19:34:37,182 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 19:34:37,183 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-18 19:34:37,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2022-11-18 19:34:37,449 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-18 19:34:39,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:39,231 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 47 treesize of output 33 [2022-11-18 19:34:39,298 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-18 19:34:39,298 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 51 treesize of output 57 [2022-11-18 19:34:39,571 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-18 19:34:39,654 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-11-18 19:34:39,655 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-18 19:34:39,933 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 42 treesize of output 38 [2022-11-18 19:34:40,633 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 43 treesize of output 23 [2022-11-18 19:34:40,645 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-18 19:34:41,090 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-18 19:34:41,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:34:44,406 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-18 19:34:46,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:34:46,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561382300] [2022-11-18 19:34:46,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561382300] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:34:46,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [824194267] [2022-11-18 19:34:46,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:34:46,767 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 19:34:46,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 19:34:46,768 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 19:34:46,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-11-18 19:34:47,662 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 19:34:47,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524823598] [2022-11-18 19:34:47,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:34:47,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:34:47,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:34:47,667 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:34:47,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 1 [2022-11-18 19:34:47,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-18 19:34:49,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:34:49,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:34:49,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-18 19:34:49,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:34:49,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-18 19:34:49,205 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-18 19:34:49,813 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-18 19:34:49,825 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-18 19:34:50,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:50,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 21 treesize of output 20 [2022-11-18 19:34:50,074 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-18 19:34:50,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:34:50,088 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-18 19:34:50,133 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:34:50,133 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-18 19:34:50,453 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-18 19:34:50,465 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-18 19:34:51,647 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-18 19:34:51,713 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2022-11-18 19:34:51,714 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-18 19:34:51,722 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-18 19:34:51,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2022-11-18 19:34:52,194 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 19:34:52,194 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-18 19:34:52,735 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-18 19:34:52,736 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 102 treesize of output 92 [2022-11-18 19:34:53,093 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-18 19:34:55,912 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-18 19:34:55,971 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-18 19:34:55,972 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-18 19:34:56,449 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-11-18 19:34:56,450 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-18 19:34:56,796 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-18 19:34:57,439 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-18 19:34:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:34:57,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:35:02,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524823598] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:35:02,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:35:02,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 52 [2022-11-18 19:35:02,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441572738] [2022-11-18 19:35:02,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:35:02,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-18 19:35:02,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:35:02,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-18 19:35:02,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=4080, Unknown=125, NotChecked=0, Total=4422 [2022-11-18 19:35:02,621 INFO L87 Difference]: Start difference. First operand 222 states and 246 transitions. Second operand has 53 states, 50 states have (on average 1.56) internal successors, (78), 47 states have internal predecessors, (78), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 19:35:26,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:35:26,231 INFO L93 Difference]: Finished difference Result 228 states and 252 transitions. [2022-11-18 19:35:26,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-18 19:35:26,235 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 50 states have (on average 1.56) internal successors, (78), 47 states have internal predecessors, (78), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 51 [2022-11-18 19:35:26,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:35:26,241 INFO L225 Difference]: With dead ends: 228 [2022-11-18 19:35:26,242 INFO L226 Difference]: Without dead ends: 228 [2022-11-18 19:35:26,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2188 ImplicationChecksByTransitivity, 39.6s TimeCoverageRelationStatistics Valid=499, Invalid=7846, Unknown=211, NotChecked=0, Total=8556 [2022-11-18 19:35:26,245 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 73 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 2205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1197 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:35:26,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1092 Invalid, 2205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 982 Invalid, 0 Unknown, 1197 Unchecked, 3.5s Time] [2022-11-18 19:35:26,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-18 19:35:26,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 222. [2022-11-18 19:35:26,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 166 states have (on average 1.2409638554216869) internal successors, (206), 191 states have internal predecessors, (206), 16 states have call successors, (16), 15 states have call predecessors, (16), 17 states have return successors, (23), 15 states have call predecessors, (23), 16 states have call successors, (23) [2022-11-18 19:35:26,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 245 transitions. [2022-11-18 19:35:26,254 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 245 transitions. Word has length 51 [2022-11-18 19:35:26,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:35:26,254 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 245 transitions. [2022-11-18 19:35:26,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 50 states have (on average 1.56) internal successors, (78), 47 states have internal predecessors, (78), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 19:35:26,255 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 245 transitions. [2022-11-18 19:35:26,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-18 19:35:26,255 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:35:26,256 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-18 19:35:26,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-11-18 19:35:26,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-11-18 19:35:26,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:35:26,668 INFO L420 AbstractCegarLoop]: === Iteration 23 === 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-18 19:35:26,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:35:26,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1771803765, now seen corresponding path program 2 times [2022-11-18 19:35:26,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:35:26,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1463146308] [2022-11-18 19:35:26,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:35:26,669 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-18 19:35:26,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:35:26,670 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:35:26,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-11-18 19:35:27,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:35:27,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:35:27,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-18 19:35:27,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:35:27,645 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-18 19:35:27,727 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-18 19:35:27,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:35:27,789 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-18 19:35:27,824 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:35:27,825 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-18 19:35:27,927 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-18 19:35:28,267 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-18 19:35:28,417 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 19:35:28,417 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-18 19:35:28,445 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-18 19:35:28,577 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 19:35:28,577 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-18 19:35:29,545 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-18 19:35:29,546 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-18 19:35:29,781 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-18 19:35:29,960 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 19:35:29,960 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-18 19:35:29,995 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-18 19:35:30,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 17 treesize of output 19 [2022-11-18 19:35:30,258 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-18 19:35:31,122 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-18 19:35:31,404 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 19:35:31,404 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-18 19:35:31,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 7 treesize of output 3 [2022-11-18 19:35:31,687 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 19:35:31,688 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-18 19:35:32,000 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-18 19:35:32,000 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-18 19:35:32,022 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-18 19:35:32,435 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-18 19:35:32,506 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-18 19:35:32,507 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-18 19:35:32,900 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-18 19:35:32,900 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-18 19:35:32,957 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-18 19:35:32,958 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-18 19:35:33,232 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-18 19:35:33,245 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-18 19:35:33,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-11-18 19:35:34,027 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-18 19:35:34,523 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-18 19:35:34,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:35:38,942 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:35:38,942 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-18 19:35:39,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:35:39,019 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-18 19:35:39,046 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 1762 [2022-11-18 19:35:39,095 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 889 treesize of output 873 [2022-11-18 19:35:39,122 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 1746 treesize of output 1682 [2022-11-18 19:35:51,512 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-18 19:35:51,709 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 43 treesize of output 31 [2022-11-18 19:35:51,873 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-18 19:35:52,094 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 43 treesize of output 31 [2022-11-18 19:35:52,217 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-18 19:35:53,510 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-18 19:35:53,852 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 43 treesize of output 31 [2022-11-18 19:35:54,161 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 43 treesize of output 31 [2022-11-18 19:35:54,216 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 43 treesize of output 31 [2022-11-18 19:35:54,268 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 57 treesize of output 41 [2022-11-18 19:35:54,331 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 57 treesize of output 41 [2022-11-18 19:35:54,633 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 43 treesize of output 31 [2022-11-18 19:35:54,695 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-18 19:35:54,852 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-18 19:35:54,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 43 treesize of output 31 [2022-11-18 19:35:54,963 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-18 19:35:55,003 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-18 19:35:55,064 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-18 19:35:55,097 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 43 treesize of output 31 [2022-11-18 19:35:55,141 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-18 19:35:55,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 29 treesize of output 21 [2022-11-18 19:35:55,199 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 43 treesize of output 31 [2022-11-18 19:35:55,262 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 43 treesize of output 31 [2022-11-18 19:35:55,323 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-18 19:35:55,353 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-18 19:35:55,389 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 43 treesize of output 31 [2022-11-18 19:35:55,444 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 57 treesize of output 41 [2022-11-18 19:35:55,511 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-18 19:35:55,542 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 57 treesize of output 41 [2022-11-18 19:35:55,605 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-18 19:35:55,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 43 treesize of output 31 [2022-11-18 19:35:55,684 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-18 19:35:55,704 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 43 treesize of output 31 [2022-11-18 19:35:55,892 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-18 19:36:07,124 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:36:07,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 1 case distinctions, treesize of input 71 treesize of output 60 [2022-11-18 19:36:07,196 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:36:07,196 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 1722 treesize of output 1631 [2022-11-18 19:36:07,223 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 1614 treesize of output 1550 [2022-11-18 19:36:07,242 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 1550 treesize of output 1422 [2022-11-18 19:36:07,263 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 1422 treesize of output 1166 [2022-11-18 19:36:14,801 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse182 (select |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~head#1.base|)) (.cse183 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (let ((.cse5 (select .cse182 .cse183))) (let ((.cse13 (= |c_create_sub_list_insert_sub_~sub~0#1.base| |c_create_sub_list_~sub#1.base|)) (.cse0 (bvadd (_ bv8 32) |c_create_sub_list_~sub#1.offset|)) (.cse4 (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~head#1.base| (store .cse182 .cse183 |c_create_sub_list_insert_sub_~sub~0#1.base|))) (.cse6 (bvadd (_ bv4 32) |c_create_sub_list_~sub#1.offset|)) (.cse74 (= .cse5 |c_create_sub_list_~sub#1.base|))) (let ((.cse32 (not .cse74)) (.cse167 (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32))) (let ((.cse181 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse181 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) (select .cse181 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6))))))) (.cse22 (not .cse13)) (.cse9 (store |c_#length| |c_create_sub_list_~sub#1.base| (_ bv12 32))) (.cse7 (not (bvule .cse0 (_ bv12 32)))) (.cse20 (not (= (select |c_#valid| |c_create_sub_list_~sub#1.base|) (_ bv0 1))))) (let ((.cse55 (or .cse7 .cse20)) (.cse21 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)) |c_create_sub_list_~sub#1.base|)))))) (.cse40 (or .cse7 (forall ((v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32)) (v_arrayElimCell_287 (_ BitVec 32))) (let ((.cse180 (select .cse9 v_arrayElimCell_287))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse180) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse180)))) .cse20)) (.cse43 (or .cse32 (and (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse174 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32))) (let ((.cse173 (select .cse174 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (forall ((v_arrayElimCell_273 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse173)) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse173)))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse174 |c_create_sub_list_~sub#1.base|)))))) (or .cse13 .cse167) (or (forall ((v_arrayElimCell_307 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse175 (select .cse9 v_arrayElimCell_307))) (or (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse175) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse175)))) .cse7 .cse20) (or .cse22 (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse177 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse176 (select .cse177 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse176) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse177 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse176)))))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse178 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse178 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse179 (select .cse178 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse179) (forall ((v_arrayElimCell_271 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse179))))))))))) (.cse59 (or (forall ((v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_282 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse172 (select .cse9 v_arrayElimCell_282))) (or (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse172) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse172) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse172)))) .cse22)) (.cse37 (or .cse22 (forall ((v_arrayElimCell_289 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse171 (select .cse9 v_arrayElimCell_289))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse171) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse171)))))) (.cse56 (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32))) (let ((.cse170 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse169 (select .cse170 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse169) (not (bvule .cse0 (select .cse170 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse169))))) .cse22)) (.cse47 (or (forall ((v_arrayElimCell_291 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse168 (select .cse9 v_arrayElimCell_291))) (or (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse168) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse168)))) .cse22)) (.cse48 (forall ((v_arrayElimCell_293 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) (select .cse9 v_arrayElimCell_293)))) (.cse57 (or .cse32 .cse167)) (.cse75 (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse166 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse165 (select .cse166 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse165) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse165) (not (bvule .cse0 (select .cse166 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse165))))) .cse22)) (.cse76 (or (and (or (forall ((v_arrayElimCell_279 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse162 (select .cse9 v_arrayElimCell_279))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse162) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse162)))) .cse7 .cse20) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse163 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse163 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32))) (let ((.cse164 (select .cse163 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (forall ((v_arrayElimCell_272 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse164)) (forall ((v_arrayElimCell_273 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse164)) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse164)))))))) .cse22)) (.cse79 (or .cse22 (and (or .cse7 .cse20 (forall ((v_arrayElimCell_280 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse157 (select .cse9 v_arrayElimCell_280))) (or (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse157) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse157) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse157))))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse158 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse158 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse159 (select .cse158 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse159) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse159) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse159))))))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse161 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_272 (_ BitVec 32))) (let ((.cse160 (select .cse161 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse160) (forall ((v_arrayElimCell_273 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse160)) (forall ((v_arrayElimCell_271 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse160))))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse161 |c_create_sub_list_~sub#1.base|))))))))) (.cse14 (or .cse32 (and (or .cse13 (forall ((v_arrayElimCell_273 (_ BitVec 32)) (v_arrayElimCell_297 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) (select .cse9 v_arrayElimCell_297)))) (forall ((v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32)) (v_arrayElimCell_298 (_ BitVec 32))) (let ((.cse156 (select .cse9 v_arrayElimCell_298))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse156) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse156))))))) (.cse10 (forall ((v_arrayElimCell_305 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) (select .cse9 v_arrayElimCell_305)))) (.cse16 (or (forall ((v_arrayElimCell_299 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse155 (select .cse9 v_arrayElimCell_299))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse155) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse155) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse155)))) .cse22)) (.cse18 (forall ((v_arrayElimCell_301 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse154 (select .cse9 v_arrayElimCell_301))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse154) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse154))))) (.cse29 (or (and (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse149 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse149 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse150 (select .cse149 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse150) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse150))))))) (or .cse7 .cse20 (forall ((v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32)) (v_arrayElimCell_276 (_ BitVec 32))) (let ((.cse151 (select .cse9 v_arrayElimCell_276))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse151) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse151))))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse152 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse152 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse153 (select .cse152 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (forall ((v_arrayElimCell_273 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse153)) (forall ((v_arrayElimCell_271 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse153))))))))) .cse22)) (.cse86 (or .cse22 (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse148 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse147 (select .cse148 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse147) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse147) (not (bvule .cse0 (select .cse148 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse147))))))) (.cse66 (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32))) (let ((.cse146 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) (select .cse146 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6))) (not (bvule .cse0 (select .cse146 |c_create_sub_list_~sub#1.base|)))))) .cse22)) (.cse67 (or .cse7 (forall ((v_arrayElimCell_274 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) (select .cse9 v_arrayElimCell_274))) .cse20)) (.cse70 (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse145 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse144 (select .cse145 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse144) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse144) (not (bvule .cse0 (select .cse145 |c_create_sub_list_~sub#1.base|))))))) .cse22)) (.cse3 (bvadd (_ bv8 32) |c_create_sub_list_insert_sub_~sub~0#1.offset|))) (let ((.cse25 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse142 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse142 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse143 (select .cse142 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse143) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse143) (bvule .cse3 .cse143)))))))) (.cse26 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse140 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse140 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse141 (select .cse140 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (forall ((v_arrayElimCell_273 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse141)) (forall ((v_arrayElimCell_271 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse141)) (bvule .cse3 .cse141)))))))) (.cse38 (let ((.cse115 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse139 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse138 (select .cse139 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse138) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse138) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse138)))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse139 |c_create_sub_list_~sub#1.base|))))))) (.cse118 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse137 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse136 (select .cse137 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (forall ((v_arrayElimCell_273 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse136)) (forall ((v_arrayElimCell_271 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse136)) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse136)))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse137 |c_create_sub_list_~sub#1.base|)))))))) (and (forall ((v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse87 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse87 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse88 (select .cse87 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse88) (forall ((v_arrayElimCell_272 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse88)) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse88) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse88))))))) .cse40 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse90 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse89 (select .cse90 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse89) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse89) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse89) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse89)))) (not (bvule .cse0 (select .cse90 |c_create_sub_list_~sub#1.base|)))))) .cse43 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse92 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse91 (select .cse92 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse91) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse91) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse91) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse91)))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse92 |c_create_sub_list_~sub#1.base|)))))) (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32))) (let ((.cse93 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse94 (select .cse93 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse93 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse94) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse94))))) .cse13) (or .cse13 (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse96 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse95 (select .cse96 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse95) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse96 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse95) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse95)))))) (or .cse7 (and (or .cse13 (forall ((v_arrayElimCell_281 (_ BitVec 32)) (v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse97 (select .cse9 v_arrayElimCell_281))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse97) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse97) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse97))))) (forall ((v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_284 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse98 (select .cse9 v_arrayElimCell_284))) (or (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse98) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse98) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse98) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse98)))) (forall ((v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_283 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse99 (select .cse9 v_arrayElimCell_283))) (or (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse99) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse99) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse99) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse99)))) .cse59) .cse20) (or .cse7 (and (or .cse13 (forall ((v_arrayElimCell_290 (_ BitVec 32)) (v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse100 (select .cse9 v_arrayElimCell_290))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse100) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse100))))) .cse37 (forall ((v_arrayElimCell_288 (_ BitVec 32)) (v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse101 (select .cse9 v_arrayElimCell_288))) (or (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse101) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse101) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse101))))) .cse20) .cse56 (or .cse7 (and .cse47 .cse48 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_292 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse102 (select .cse9 v_arrayElimCell_292))) (or (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse102) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse102) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse102)))) (forall ((v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_295 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse103 (select .cse9 v_arrayElimCell_295))) (or (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse103) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse103) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse103)))) (or .cse13 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_294 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse104 (select .cse9 v_arrayElimCell_294))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse104) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse104)))))) .cse20) .cse57 .cse75 .cse76 (or .cse13 (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse106 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse105 (select .cse106 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse105) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse106 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse105) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse105)))))) .cse79 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse107 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse107 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32))) (let ((.cse108 (select .cse107 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (forall ((v_arrayElimCell_272 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse108)) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse108) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse108))))))) (or .cse7 .cse20 (and (forall ((v_arrayElimCell_300 (_ BitVec 32)) (v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse109 (select .cse9 v_arrayElimCell_300))) (or (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse109) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse109) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse109) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse109)))) (or (forall ((v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_296 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse110 (select .cse9 v_arrayElimCell_296))) (or (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse110) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse110) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse110)))) .cse13) .cse14 (or .cse13 (and (forall ((v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse111 (select .cse9 v_arrayElimCell_306))) (or (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse111) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse111) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse111)))) .cse10 (forall ((v_arrayElimCell_303 (_ BitVec 32)) (v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse112 (select .cse9 v_arrayElimCell_303))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse112) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse112)))) (forall ((v_arrayElimCell_304 (_ BitVec 32)) (v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse113 (select .cse9 v_arrayElimCell_304))) (or (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse113) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse113) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse113)))))) (forall ((v_arrayElimCell_302 (_ BitVec 32)) (v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse114 (select .cse9 v_arrayElimCell_302))) (or (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse114) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse114) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse114) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse114)))) .cse16 .cse18)) (or .cse13 (and .cse115 (or .cse7 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32)) (v_arrayElimCell_286 (_ BitVec 32))) (let ((.cse116 (select .cse9 v_arrayElimCell_286))) (or (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse116) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse116)))) .cse20) (or .cse7 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_285 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse117 (select .cse9 v_arrayElimCell_285))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse117) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse117) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse117)))) .cse20) .cse118)) (or (let ((.cse120 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse123 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse123 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32))) (let ((.cse124 (select .cse123 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse124) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse124))))))))) (and (or .cse7 .cse20 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32)) (v_arrayElimCell_275 (_ BitVec 32))) (let ((.cse119 (select .cse9 v_arrayElimCell_275))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse119) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse119) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse119))))) .cse115 (or .cse13 (and .cse120 (or .cse7 .cse20 (forall ((v_arrayElimCell_278 (_ BitVec 32)) (v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse121 (select .cse9 v_arrayElimCell_278))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse121) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse121))))) .cse115 (or (forall ((v_arrayElimCell_277 (_ BitVec 32)) (v_arrayElimCell_270 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse122 (select .cse9 v_arrayElimCell_277))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse122) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse122) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse122)))) .cse7 .cse20) .cse118)) (or (and .cse120 .cse115 .cse118) .cse13) .cse29 .cse118)) .cse32) (forall ((v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse125 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse125 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse126 (select .cse125 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse126) (forall ((v_arrayElimCell_272 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse126)) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse126) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse126))))))) .cse86 (or (and (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse128 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse127 (select .cse128 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse127) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse128 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse127))))) .cse13) (forall ((v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse130 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse129 (select .cse130 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse129) (forall ((v_arrayElimCell_272 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse129)) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse129)))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse130 |c_create_sub_list_~sub#1.base|)))))) (or .cse13 (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse131 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse131 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) (select .cse131 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6))))))) .cse66 .cse67 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse133 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse132 (select .cse133 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (forall ((v_arrayElimCell_272 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse132)) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse132)))) (not (bvule .cse0 (select .cse133 |c_create_sub_list_~sub#1.base|)))))) .cse70 (forall ((v_arrayElimCell_270 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse135 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse134 (select .cse135 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse134) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse134) (bvule (bvadd v_arrayElimCell_270 (_ bv4 32)) .cse134)))) (not (bvule .cse0 (select .cse135 |c_create_sub_list_~sub#1.base|))))))) .cse74)))) (.cse41 (= |c_create_sub_list_insert_sub_~head#1.offset| |c_create_sub_list_~sub#1.offset|)) (.cse42 (and .cse55 .cse21)) (.cse39 (= |c_create_sub_list_insert_sub_~head#1.base| |c_create_sub_list_~sub#1.base|))) (and (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse1 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse1 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32))) (let ((.cse2 (select .cse1 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (forall ((v_arrayElimCell_272 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse2)) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse2) (bvule .cse3 .cse2))))))) (or .cse7 (and (or (and (forall ((v_arrayElimCell_304 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse8 (select .cse9 v_arrayElimCell_304))) (or (bvule .cse3 .cse8) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse8) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse8)))) .cse10 (forall ((v_arrayElimCell_303 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse11 (select .cse9 v_arrayElimCell_303))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse11) (bvule .cse3 .cse11)))) (forall ((v_arrayElimCell_306 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse12 (select .cse9 v_arrayElimCell_306))) (or (bvule .cse3 .cse12) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse12) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse12))))) .cse13) .cse14 (forall ((v_arrayElimCell_302 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse15 (select .cse9 v_arrayElimCell_302))) (or (bvule .cse3 .cse15) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse15) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse15) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse15)))) .cse16 (or .cse13 (forall ((v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_296 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse17 (select .cse9 v_arrayElimCell_296))) (or (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse17) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse17) (bvule .cse3 .cse17))))) .cse18 (forall ((v_arrayElimCell_300 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse19 (select .cse9 v_arrayElimCell_300))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse19) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse19) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse19) (bvule .cse3 .cse19))))) .cse20) (or .cse21 .cse22) (or (let ((.cse24 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse31 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32))) (let ((.cse30 (select .cse31 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse30) (bvule .cse3 .cse30)))) (not (bvule .cse0 (select .cse31 |c_create_sub_list_~sub#1.base|)))))))) (and (or .cse13 (and (or .cse7 .cse20 (forall ((v_arrayElimCell_278 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse23 (select .cse9 v_arrayElimCell_278))) (or (bvule .cse3 .cse23) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse23))))) .cse24 .cse25 .cse26 (or .cse7 (forall ((v_arrayElimCell_277 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse27 (select .cse9 v_arrayElimCell_277))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse27) (bvule .cse3 .cse27) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse27)))) .cse20))) (or (forall ((v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32)) (v_arrayElimCell_275 (_ BitVec 32))) (let ((.cse28 (select .cse9 v_arrayElimCell_275))) (or (bvule .cse3 .cse28) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse28) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse28)))) .cse7 .cse20) .cse25 (or .cse13 (and .cse24 .cse25 .cse26)) .cse26 .cse29)) .cse32) (or .cse13 (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32))) (let ((.cse33 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse34 (select .cse33 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse33 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse34) (bvule .cse3 .cse34)))))) (or .cse7 .cse20 (and (or (forall ((v_arrayElimCell_290 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse35 (select .cse9 v_arrayElimCell_290))) (or (bvule .cse3 .cse35) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse35)))) .cse13) (forall ((v_arrayElimCell_288 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse36 (select .cse9 v_arrayElimCell_288))) (or (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse36) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse36) (bvule .cse3 .cse36)))) .cse37)) (or .cse38 .cse39) .cse40 (or .cse41 .cse42) .cse43 (or .cse13 (and (or .cse7 (forall ((v_arrayElimCell_273 (_ BitVec 32)) (v_arrayElimCell_286 (_ BitVec 32))) (let ((.cse44 (select .cse9 v_arrayElimCell_286))) (or (bvule .cse3 .cse44) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse44)))) .cse20) (or .cse7 .cse20 (forall ((v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_285 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse45 (select .cse9 v_arrayElimCell_285))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse45) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse45) (bvule .cse3 .cse45))))) .cse25 .cse26)) (or (and (forall ((v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_295 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse46 (select .cse9 v_arrayElimCell_295))) (or (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse46) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse46) (bvule .cse3 .cse46)))) .cse47 .cse48 (or .cse13 (forall ((v_arrayElimCell_294 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse49 (select .cse9 v_arrayElimCell_294))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse49) (bvule .cse3 .cse49))))) (forall ((v_arrayElimCell_292 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse50 (select .cse9 v_arrayElimCell_292))) (or (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse50) (bvule .cse3 .cse50) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse50))))) .cse7 .cse20) (or .cse38 .cse41) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse51 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse51 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse52 (select .cse51 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse52) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse52) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse52) (bvule .cse3 .cse52))))))) (or .cse13 (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse54 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse53 (select .cse54 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse53) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse54 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse53) (bvule .cse3 .cse53)))))) .cse55 .cse56 .cse57 (or .cse7 (and (forall ((v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_284 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse58 (select .cse9 v_arrayElimCell_284))) (or (bvule .cse3 .cse58) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse58) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse58) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse58)))) .cse59 (or (forall ((v_arrayElimCell_281 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse60 (select .cse9 v_arrayElimCell_281))) (or (bvule .cse3 .cse60) (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse60) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse60)))) .cse13) (forall ((v_arrayElimCell_283 (_ BitVec 32)) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse61 (select .cse9 v_arrayElimCell_283))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse61) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse61) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse61) (bvule .cse3 .cse61))))) .cse20) (or (and (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse63 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse62 (select .cse63 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse62) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse63 |c_create_sub_list_~sub#1.base|))) (bvule .cse3 .cse62))))) .cse13) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse65 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse64 (select .cse65 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse64) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse64) (bvule .cse3 .cse64)))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse65 |c_create_sub_list_~sub#1.base|)))))) .cse66 .cse67 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse68 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse68 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse69 (select .cse68 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (forall ((v_arrayElimCell_272 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse69)) (bvule .cse3 .cse69))))))) .cse70 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse72 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse71 (select .cse72 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse71) (forall ((v_arrayElimCell_272 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse71)) (bvule .cse3 .cse71)))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse72 |c_create_sub_list_~sub#1.base|)))))) (or .cse13 (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse73 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse73 |c_create_sub_list_~sub#1.base|))) (bvule .cse3 (select .cse73 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))))))) .cse74) .cse75 .cse76 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse77 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse77 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_272 (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse78 (select .cse77 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse78) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse78) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse78) (bvule .cse3 .cse78))))))) .cse79 (or (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32)) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse81 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (let ((.cse80 (select .cse81 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse80) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse81 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse80) (bvule .cse3 .cse80))))) .cse13) (or .cse21 (bvule (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~sub~0#1.offset|) .cse3)) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse82 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (not (bvule .cse0 (select .cse82 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse83 (select .cse82 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse83) (forall ((v_arrayElimCell_272 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse83)) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse83) (bvule .cse3 .cse83))))))) (or .cse32 .cse21) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ BitVec 32))) (let ((.cse84 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_71| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_71|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_71| |c_create_sub_list_~sub#1.base|) (not (bvule .cse0 (select .cse84 |c_create_sub_list_~sub#1.base|))) (forall ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32)) (v_arrayElimCell_273 (_ BitVec 32))) (let ((.cse85 (select .cse84 (select (select (store (store (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2572) .cse5 v_ArrVal_2571) |v_create_sub_list_insert_sub_~sub~0#1.base_71| v_ArrVal_2553) |c_create_sub_list_~sub#1.base|) .cse6)))) (or (bvule (bvadd v_arrayElimCell_273 (_ bv4 32)) .cse85) (forall ((v_arrayElimCell_272 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_272 (_ bv4 32)) .cse85)) (bvule (bvadd v_arrayElimCell_271 (_ bv4 32)) .cse85) (bvule .cse3 .cse85))))))) .cse86 (or .cse42 .cse39)))))))) is different from true [2022-11-18 19:36:14,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:36:14,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1463146308] [2022-11-18 19:36:14,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1463146308] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:36:14,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [815825361] [2022-11-18 19:36:14,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:36:14,850 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 19:36:14,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 19:36:14,854 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 19:36:14,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2022-11-18 19:36:18,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:36:18,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:36:18,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 137 conjunts are in the unsatisfiable core [2022-11-18 19:36:18,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:36:18,459 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-18 19:36:18,516 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-18 19:36:18,543 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-18 19:36:18,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:36:18,866 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-18 19:36:18,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:36:18,888 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-18 19:36:18,963 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:36:18,963 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-18 19:36:19,383 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-18 19:36:19,413 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-18 19:36:22,986 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-18 19:36:23,064 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2022-11-18 19:36:23,065 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-18 19:36:23,074 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-18 19:36:23,085 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-18 19:36:23,672 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-18 19:36:23,785 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 19:36:23,786 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-18 19:36:24,504 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-18 19:36:24,504 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 102 treesize of output 92 [2022-11-18 19:36:24,606 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-18 19:36:25,097 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-18 19:36:25,221 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 19:36:25,222 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-18 19:36:25,243 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-18 19:36:25,588 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 19:36:25,588 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-18 19:36:25,892 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-18 19:36:25,892 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-18 19:36:25,903 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-18 19:36:26,327 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-18 19:36:26,419 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-18 19:36:26,419 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-18 19:36:26,672 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-18 19:36:26,672 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-18 19:36:26,706 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-18 19:36:27,186 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-18 19:36:27,220 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-18 19:36:28,136 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:36:28,137 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-18 19:36:28,152 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:36:28,153 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-18 19:36:29,371 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-18 19:36:29,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:36:34,782 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:36:34,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 75 [2022-11-18 19:36:34,909 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:36:34,909 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 922 treesize of output 915 [2022-11-18 19:36:34,931 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 898 treesize of output 890 [2022-11-18 19:36:34,952 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 890 treesize of output 858 [2022-11-18 19:36:34,974 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 858 treesize of output 842 [2022-11-18 19:36:44,625 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-18 19:36:44,867 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-18 19:36:45,050 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-18 19:36:45,341 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-18 19:36:45,437 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-18 19:36:45,508 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-18 19:36:45,541 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-18 19:36:45,572 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-18 19:36:45,731 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-18 19:36:45,971 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-18 19:36:46,251 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 43 treesize of output 31 [2022-11-18 19:36:46,445 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-18 19:36:46,480 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-18 19:36:46,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-18 19:36:46,831 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-18 19:36:47,062 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-18 19:36:47,315 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-18 19:36:47,365 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 43 treesize of output 31 [2022-11-18 19:36:47,818 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-18 19:36:47,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 29 treesize of output 21 [2022-11-18 19:36:48,077 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 43 treesize of output 31 [2022-11-18 19:36:48,563 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-18 19:36:48,773 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-18 19:36:48,808 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-18 19:36:48,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 29 treesize of output 21 [2022-11-18 19:36:49,396 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-18 19:36:49,429 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-18 19:36:49,607 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-18 19:36:49,788 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-18 19:36:50,026 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-18 19:36:50,292 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-18 19:36:50,351 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 43 treesize of output 31 [2022-11-18 19:36:50,829 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-18 19:36:50,868 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-18 19:36:51,090 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 43 treesize of output 31 [2022-11-18 19:36:51,562 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-18 19:36:51,774 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-18 19:36:51,808 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-18 19:36:51,863 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-18 19:36:52,559 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 43 treesize of output 31 [2022-11-18 19:36:52,794 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-18 19:36:52,967 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-18 19:36:53,350 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:36:53,350 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-18 19:36:53,422 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:36:53,422 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-18 19:36:53,456 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 189 treesize of output 173 [2022-11-18 19:36:53,472 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 362 treesize of output 298 [2022-11-18 19:36:53,499 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-18 19:36:56,567 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse114 (select |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~head#1.base|)) (.cse115 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (let ((.cse19 (= |c_create_sub_list_insert_sub_~sub~0#1.base| |c_create_sub_list_~sub#1.base|)) (.cse8 (select .cse114 .cse115))) (let ((.cse20 (= .cse8 |c_create_sub_list_~sub#1.base|)) (.cse14 (not .cse19)) (.cse7 (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~head#1.base| (store .cse114 .cse115 |c_create_sub_list_insert_sub_~sub~0#1.base|))) (.cse9 (bvadd (_ bv4 32) |c_create_sub_list_~sub#1.offset|)) (.cse10 (bvadd (_ bv8 32) |c_create_sub_list_~sub#1.offset|))) (let ((.cse26 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse113 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse112 (select .cse113 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse112) (forall ((v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse112))))) (not (bvule .cse10 (select .cse113 |c_create_sub_list_~sub#1.base|))))))) (.cse28 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse111 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) (select .cse111 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (not (bvule .cse10 (select .cse111 |c_create_sub_list_~sub#1.base|))))))) (.cse69 (or (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_347 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse110 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) (select .cse110 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (not (bvule .cse10 (select .cse110 |c_create_sub_list_~sub#1.base|)))))) .cse14)) (.cse44 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse109 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse108 (select .cse109 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse108) (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) .cse108)))) (not (bvule .cse10 (select .cse109 |c_create_sub_list_~sub#1.base|))))))) (.cse25 (not .cse20)) (.cse3 (bvadd (_ bv8 32) |c_create_sub_list_insert_sub_~sub~0#1.offset|))) (let ((.cse17 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse107 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse106 (select .cse107 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (forall ((v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse106)) (bvule .cse3 .cse106)))) (not (bvule .cse10 (select .cse107 |c_create_sub_list_~sub#1.base|))))))) (.cse18 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse105 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule .cse3 (select .cse105 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (not (bvule .cse10 (select .cse105 |c_create_sub_list_~sub#1.base|))))))) (.cse36 (= |c_create_sub_list_insert_sub_~head#1.offset| |c_create_sub_list_~sub#1.offset|)) (.cse32 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (not (bvule .cse10 (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)) |c_create_sub_list_~sub#1.base|)))))) (.cse37 (or (and .cse69 .cse44) .cse25)) (.cse35 (or (and (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse102 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse101 (select .cse102 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse101) (forall ((v_arrayElimCell_345 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse101)) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse101)))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (not (bvule .cse10 (select .cse102 |c_create_sub_list_~sub#1.base|)))))) (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_347 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse104 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (let ((.cse103 (select .cse104 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse103) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse103) (not (bvule .cse10 (select .cse104 |c_create_sub_list_~sub#1.base|))))))) .cse25)) .cse14)) (.cse42 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse100 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse99 (select .cse100 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse99) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse99) (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) .cse99)))) (not (bvule .cse10 (select .cse100 |c_create_sub_list_~sub#1.base|))))))) (.cse40 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse98 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse97 (select .cse98 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse97) (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) .cse97) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse97)))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (not (bvule .cse10 (select .cse98 |c_create_sub_list_~sub#1.base|))))))) (.cse38 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse96 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse95 (select .cse96 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse95) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse95) (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) .cse95) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse95)))) (not (bvule .cse10 (select .cse96 |c_create_sub_list_~sub#1.base|))))))) (.cse27 (or .cse19 (and .cse26 .cse28))) (.cse29 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse93 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (not (bvule .cse10 (select .cse93 |c_create_sub_list_~sub#1.base|))) (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse94 (select .cse93 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (forall ((v_arrayElimCell_347 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse94)) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse94)))))))) (.cse50 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse92 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse91 (select .cse92 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse91) (forall ((v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse91)) (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) .cse91)))) (not (bvule .cse10 (select .cse92 |c_create_sub_list_~sub#1.base|))))))) (.cse11 (or (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse90 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (not (bvule .cse10 (select .cse90 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) (select .cse90 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))))) .cse14)) (.cse12 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse89 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) (select .cse89 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (not (bvule .cse10 (select .cse89 |c_create_sub_list_~sub#1.base|))))))) (.cse13 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse88 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse87 (select .cse88 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (forall ((v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse87)) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse87)))) (not (bvule .cse10 (select .cse88 |c_create_sub_list_~sub#1.base|))))))) (.cse48 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse86 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (not (bvule .cse10 (select .cse86 |c_create_sub_list_~sub#1.base|))) (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) (select .cse86 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))))))) (.cse49 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse85 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse84 (select .cse85 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (forall ((v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse84)) (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) .cse84)))) (not (bvule .cse10 (select .cse85 |c_create_sub_list_~sub#1.base|))))))) (.cse53 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse83 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse82 (select .cse83 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (forall ((v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse82)) (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) .cse82) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse82)))) (not (bvule .cse10 (select .cse83 |c_create_sub_list_~sub#1.base|))))))) (.cse54 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse81 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse80 (select .cse81 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) .cse80) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse80)))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (not (bvule .cse10 (select .cse81 |c_create_sub_list_~sub#1.base|))))))) (.cse33 (= |c_create_sub_list_insert_sub_~head#1.base| |c_create_sub_list_~sub#1.base|)) (.cse30 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse79 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse78 (select .cse79 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse78) (bvule .cse3 .cse78) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse78)))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (not (bvule .cse10 (select .cse79 |c_create_sub_list_~sub#1.base|))))))) (.cse0 (not (bvule .cse10 (_ bv12 32)))) (.cse1 (not (= (select |c_#valid| |c_create_sub_list_~sub#1.base|) (_ bv0 1)))) (.cse4 (store |c_#length| |c_create_sub_list_~sub#1.base| (_ bv12 32))) (.cse56 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse76 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (not (bvule .cse10 (select .cse76 |c_create_sub_list_~sub#1.base|))) (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse77 (select .cse76 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse77) (bvule .cse3 .cse77) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse77) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse77)))))))) (.cse41 (or (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse75 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (let ((.cse74 (select .cse75 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse74) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (not (bvule .cse10 (select .cse75 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse74))))) .cse14)) (.cse45 (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse73 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (let ((.cse72 (select .cse73 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse72) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse72) (not (bvule .cse10 (select .cse73 |c_create_sub_list_~sub#1.base|))) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse72))))) .cse14)) (.cse22 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse71 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse70 (select .cse71 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse70) (bvule .cse3 .cse70)))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (not (bvule .cse10 (select .cse71 |c_create_sub_list_~sub#1.base|)))))))) (and (or (and (or .cse0 .cse1 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_352 (_ BitVec 32))) (let ((.cse2 (select .cse4 v_arrayElimCell_352))) (or (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse2) (bvule .cse3 .cse2))))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse6 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select .cse6 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule .cse3 .cse5) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse5)))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (not (bvule .cse10 (select .cse6 |c_create_sub_list_~sub#1.base|)))))) .cse11 (or .cse0 .cse1 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_353 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_353)))) (or (and .cse12 .cse13 (or .cse0 .cse1 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_351 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_351))))) .cse14) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse16 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select .cse16 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (forall ((v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse15)) (bvule .cse3 .cse15) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse15)))) (not (bvule .cse10 (select .cse16 |c_create_sub_list_~sub#1.base|)))))) (or (and .cse17 (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_350 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_350))) .cse0 .cse1) .cse18) .cse19)) .cse20) (or (and (or (and .cse17 (or .cse0 .cse1 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_349 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_349)))) .cse18) .cse20) (or .cse0 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_348 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32))) (let ((.cse21 (select .cse4 v_arrayElimCell_348))) (or (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse21) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse21)))) .cse1) .cse22 (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse24 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select .cse24 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse23) (forall ((v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse23)) (bvule .cse3 .cse23)))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (not (bvule .cse10 (select .cse24 |c_create_sub_list_~sub#1.base|))))))) .cse19) (or .cse25 (and (or .cse0 (forall ((v_arrayElimCell_357 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_357))) .cse1) .cse26 .cse27 .cse28 (or (and .cse29 .cse28 (or .cse0 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_356 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_356))) .cse1)) .cse14))) (or .cse25 (and .cse30 (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_389 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32))) (let ((.cse31 (select .cse4 v_arrayElimCell_389))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse31) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse31)))) .cse0 .cse1))) (or .cse0 .cse1) (or .cse32 .cse14) (or .cse32 .cse33) (or .cse0 (and (forall ((v_arrayElimCell_355 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_355))) (forall ((v_arrayElimCell_354 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32))) (let ((.cse34 (select .cse4 v_arrayElimCell_354))) (or (bvule .cse3 .cse34) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse34))))) .cse1) .cse35 (or .cse32 (bvule (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~sub~0#1.offset|) .cse3)) (or .cse36 (and .cse37 (or .cse25 (and (or .cse0 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_364 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_364))) .cse1) .cse26 (or .cse14 (and .cse29 (or .cse0 .cse1 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_363 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_363)))) .cse28)) .cse27 .cse28)) (or (and .cse38 (or .cse0 .cse1 (forall ((v_arrayElimCell_365 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32))) (let ((.cse39 (select .cse4 v_arrayElimCell_365))) (or (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse39) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse39) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse39)))))) .cse14) (or .cse20 (and .cse40 .cse38 .cse41 (or .cse19 (and .cse42 (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_369 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32))) (let ((.cse43 (select .cse4 v_arrayElimCell_369))) (or (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse43) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse43)))) .cse0 .cse1) .cse44)) .cse45 (or .cse0 .cse1 (forall ((v_arrayElimCell_368 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32))) (let ((.cse46 (select .cse4 v_arrayElimCell_368))) (or (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse46) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse46) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse46))))))) (or .cse19 (and (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_367 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32))) (let ((.cse47 (select .cse4 v_arrayElimCell_367))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse47) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse47)))) .cse0 .cse1) (or (and .cse48 (or .cse0 .cse1 (forall ((v_arrayElimCell_366 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_366)))) .cse49) .cse20) .cse50 .cse44)) .cse35 (or .cse0 (and (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_371 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_371))) (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_370 (_ BitVec 32))) (let ((.cse51 (select .cse4 v_arrayElimCell_370))) (or (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse51) (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) .cse51))))) .cse1) .cse41 (or (and .cse11 (or (and (or .cse0 .cse1 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_359 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_359)))) .cse48 .cse49) .cse19) (or (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_360 (_ BitVec 32))) (let ((.cse52 (select .cse4 v_arrayElimCell_360))) (or (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse52) (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) .cse52)))) .cse0 .cse1) (or (and .cse12 .cse13 (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_361 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_361))) .cse0 .cse1)) .cse14) (or .cse0 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_362 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_362))) .cse1) .cse53 .cse54) .cse20) (or .cse25 (and .cse42 (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32)) (v_arrayElimCell_372 (_ BitVec 32))) (let ((.cse55 (select .cse4 v_arrayElimCell_372))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse55) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse55)))) .cse0 .cse1))))) (or .cse25 .cse32) (or .cse36 .cse32) (or (and .cse56 (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_358 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32))) (let ((.cse57 (select .cse4 v_arrayElimCell_358))) (or (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse57) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse57) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse57)))) .cse0 .cse1)) .cse14) .cse41 (or (and .cse37 (or .cse25 (and .cse42 (or .cse0 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32)) (v_arrayElimCell_386 (_ BitVec 32))) (let ((.cse58 (select .cse4 v_arrayElimCell_386))) (or (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse58) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse58)))) .cse1))) (or .cse0 (and (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_384 (_ BitVec 32))) (let ((.cse59 (select .cse4 v_arrayElimCell_384))) (or (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) .cse59) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse59)))) (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_385 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_385)))) .cse1) .cse35 (or (and (or (and .cse42 (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32)) (v_arrayElimCell_383 (_ BitVec 32))) (let ((.cse60 (select .cse4 v_arrayElimCell_383))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse60) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse60)))) .cse0 .cse1) .cse44) .cse19) .cse40 .cse38 (or .cse0 .cse1 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32)) (v_arrayElimCell_382 (_ BitVec 32))) (let ((.cse61 (select .cse4 v_arrayElimCell_382))) (or (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse61) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse61) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse61))))) .cse41 .cse45) .cse20) .cse41 (or (and .cse38 (or .cse0 (forall ((v_arrayElimCell_379 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32))) (let ((.cse62 (select .cse4 v_arrayElimCell_379))) (or (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse62) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse62) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse62)))) .cse1)) .cse14) (or .cse25 (and .cse26 .cse27 (or (and .cse29 (or (forall ((v_arrayElimCell_377 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_377))) .cse0 .cse1) .cse28) .cse14) (or .cse0 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_378 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_378))) .cse1) .cse28)) (or .cse19 (and (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32)) (v_arrayElimCell_381 (_ BitVec 32))) (let ((.cse63 (select .cse4 v_arrayElimCell_381))) (or (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse63) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse63)))) .cse0 .cse1) .cse50 (or (and .cse48 (or .cse0 .cse1 (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_380 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_380)))) .cse49) .cse20) .cse44)) (or .cse20 (and .cse11 (or (forall ((v_arrayElimCell_344 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_374 (_ BitVec 32))) (let ((.cse64 (select .cse4 v_arrayElimCell_374))) (or (bvule (bvadd v_arrayElimCell_344 (_ bv4 32)) .cse64) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse64)))) .cse0 .cse1) (or (forall ((v_arrayElimCell_376 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_376))) .cse0 .cse1) (or (and .cse12 .cse13 (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_375 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_375))) .cse0 .cse1)) .cse14) (or .cse19 (and .cse48 .cse49 (or (forall ((v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_373 (_ BitVec 32))) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) (select .cse4 v_arrayElimCell_373))) .cse0 .cse1))) .cse53 .cse54))) .cse33) (or (and (or (and .cse30 .cse22 (or .cse0 .cse1 (forall ((v_arrayElimCell_388 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32))) (let ((.cse65 (select .cse4 v_arrayElimCell_388))) (or (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse65) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse65)))))) .cse19) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ BitVec 32))) (let ((.cse67 (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_74| (_ bv12 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_74|))) (forall ((v_ArrVal_2739 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32)) (v_ArrVal_2759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2757 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse66 (select .cse67 (select (select (store (store (store .cse7 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2757) .cse8 v_ArrVal_2759) |v_create_sub_list_insert_sub_~sub~0#1.base_74| v_ArrVal_2739) |c_create_sub_list_~sub#1.base|) .cse9)))) (or (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse66) (bvule .cse3 .cse66) (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse66)))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_74| |c_create_sub_list_~sub#1.base|) (not (bvule .cse10 (select .cse67 |c_create_sub_list_~sub#1.base|)))))) (or .cse0 .cse1 (forall ((v_arrayElimCell_387 (_ BitVec 32)) (v_arrayElimCell_346 (_ BitVec 32)) (v_arrayElimCell_345 (_ BitVec 32)) (v_arrayElimCell_347 (_ BitVec 32))) (let ((.cse68 (select .cse4 v_arrayElimCell_387))) (or (bvule (bvadd v_arrayElimCell_345 (_ bv4 32)) .cse68) (bvule (bvadd v_arrayElimCell_347 (_ bv4 32)) .cse68) (bvule (bvadd v_arrayElimCell_346 (_ bv4 32)) .cse68))))) .cse56 .cse41 .cse45) .cse20) (or (and .cse69 .cse22) .cse25))))))) is different from true [2022-11-18 19:36:56,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [815825361] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:36:56,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:36:56,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 48 [2022-11-18 19:36:56,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236472621] [2022-11-18 19:36:56,595 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:36:56,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-18 19:36:56,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:36:56,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-18 19:36:56,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=3329, Unknown=22, NotChecked=234, Total=3782 [2022-11-18 19:36:56,597 INFO L87 Difference]: Start difference. First operand 222 states and 245 transitions. Second operand has 49 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 43 states have internal predecessors, (71), 6 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 19:37:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:16,891 INFO L93 Difference]: Finished difference Result 222 states and 244 transitions. [2022-11-18 19:37:16,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-18 19:37:16,893 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 43 states have internal predecessors, (71), 6 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-11-18 19:37:16,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:16,894 INFO L225 Difference]: With dead ends: 222 [2022-11-18 19:37:16,894 INFO L226 Difference]: Without dead ends: 222 [2022-11-18 19:37:16,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 84 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1750 ImplicationChecksByTransitivity, 37.3s TimeCoverageRelationStatistics Valid=491, Invalid=6439, Unknown=50, NotChecked=330, Total=7310 [2022-11-18 19:37:16,897 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 76 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 827 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:16,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1051 Invalid, 1819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 972 Invalid, 0 Unknown, 827 Unchecked, 4.8s Time] [2022-11-18 19:37:16,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-11-18 19:37:16,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-11-18 19:37:16,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 166 states have (on average 1.2349397590361446) internal successors, (205), 191 states have internal predecessors, (205), 16 states have call successors, (16), 15 states have call predecessors, (16), 17 states have return successors, (23), 15 states have call predecessors, (23), 16 states have call successors, (23) [2022-11-18 19:37:16,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 244 transitions. [2022-11-18 19:37:16,906 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 244 transitions. Word has length 51 [2022-11-18 19:37:16,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:16,906 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 244 transitions. [2022-11-18 19:37:16,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 43 states have internal predecessors, (71), 6 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 19:37:16,907 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 244 transitions. [2022-11-18 19:37:16,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-18 19:37:16,908 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:16,908 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-18 19:37:16,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2022-11-18 19:37:17,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-11-18 19:37:17,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:37:17,320 INFO L420 AbstractCegarLoop]: === Iteration 24 === 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-18 19:37:17,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:17,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1861045348, now seen corresponding path program 1 times [2022-11-18 19:37:17,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:37:17,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281942452] [2022-11-18 19:37:17,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:17,322 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-18 19:37:17,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:37:17,323 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:37:17,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:37:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:17,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-18 19:37:17,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:37:18,196 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-18 19:37:18,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:37:18,614 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-18 19:37:18,614 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-18 19:37:18,699 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-18 19:37:18,702 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-18 19:37:18,753 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-18 19:37:18,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:37:18,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281942452] [2022-11-18 19:37:18,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281942452] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:37:18,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:37:18,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2022-11-18 19:37:18,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83858463] [2022-11-18 19:37:18,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:37:18,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 19:37:18,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:37:18,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 19:37:18,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:37:18,756 INFO L87 Difference]: Start difference. First operand 222 states and 244 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-18 19:37:20,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:20,826 INFO L93 Difference]: Finished difference Result 230 states and 251 transitions. [2022-11-18 19:37:20,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 19:37:20,827 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-18 19:37:20,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:20,828 INFO L225 Difference]: With dead ends: 230 [2022-11-18 19:37:20,828 INFO L226 Difference]: Without dead ends: 230 [2022-11-18 19:37:20,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-11-18 19:37:20,829 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 96 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:20,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 415 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-18 19:37:20,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-18 19:37:20,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 221. [2022-11-18 19:37:20,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 166 states have (on average 1.2228915662650603) internal successors, (203), 190 states have internal predecessors, (203), 16 states have call successors, (16), 15 states have call predecessors, (16), 17 states have return successors, (23), 15 states have call predecessors, (23), 16 states have call successors, (23) [2022-11-18 19:37:20,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 242 transitions. [2022-11-18 19:37:20,839 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 242 transitions. Word has length 54 [2022-11-18 19:37:20,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:20,839 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 242 transitions. [2022-11-18 19:37:20,839 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-18 19:37:20,840 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 242 transitions. [2022-11-18 19:37:20,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-18 19:37:20,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:20,841 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-18 19:37:20,863 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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)] Ended with exit code 0 [2022-11-18 19:37:21,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:37:21,064 INFO L420 AbstractCegarLoop]: === Iteration 25 === 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-18 19:37:21,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:21,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1861045347, now seen corresponding path program 1 times [2022-11-18 19:37:21,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:37:21,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7989946] [2022-11-18 19:37:21,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:21,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 19:37:21,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:37:21,068 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:37:21,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-11-18 19:37:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:21,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-18 19:37:21,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:37:22,323 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-18 19:37:22,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:37:23,610 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-18 19:37:24,449 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:37:24,450 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-18 19:37:25,729 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:37:25,729 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-18 19:37:26,927 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-18 19:37:26,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:37:26,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7989946] [2022-11-18 19:37:26,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7989946] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:37:26,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:37:26,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-11-18 19:37:26,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347469157] [2022-11-18 19:37:26,928 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:37:26,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-18 19:37:26,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:37:26,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-18 19:37:26,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2022-11-18 19:37:26,942 INFO L87 Difference]: Start difference. First operand 221 states and 242 transitions. Second operand has 22 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 18 states have internal predecessors, (70), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-18 19:37:32,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:32,704 INFO L93 Difference]: Finished difference Result 221 states and 238 transitions. [2022-11-18 19:37:32,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-18 19:37:32,705 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 18 states have internal predecessors, (70), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 54 [2022-11-18 19:37:32,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:32,706 INFO L225 Difference]: With dead ends: 221 [2022-11-18 19:37:32,706 INFO L226 Difference]: Without dead ends: 221 [2022-11-18 19:37:32,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122 [2022-11-18 19:37:32,708 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 208 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:32,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 636 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 461 Invalid, 0 Unknown, 55 Unchecked, 3.5s Time] [2022-11-18 19:37:32,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-11-18 19:37:32,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2022-11-18 19:37:32,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 166 states have (on average 1.1987951807228916) internal successors, (199), 188 states have internal predecessors, (199), 16 states have call successors, (16), 15 states have call predecessors, (16), 17 states have return successors, (23), 15 states have call predecessors, (23), 16 states have call successors, (23) [2022-11-18 19:37:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 238 transitions. [2022-11-18 19:37:32,717 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 238 transitions. Word has length 54 [2022-11-18 19:37:32,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:32,718 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 238 transitions. [2022-11-18 19:37:32,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 18 states have internal predecessors, (70), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-18 19:37:32,718 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 238 transitions. [2022-11-18 19:37:32,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 19:37:32,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:32,720 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-18 19:37:32,742 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-11-18 19:37:32,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:37:32,937 INFO L420 AbstractCegarLoop]: === Iteration 26 === 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-18 19:37:32,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:32,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1758182945, now seen corresponding path program 1 times [2022-11-18 19:37:32,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:37:32,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139590904] [2022-11-18 19:37:32,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:32,938 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-18 19:37:32,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:37:32,939 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:37:32,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-11-18 19:37:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:33,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-18 19:37:33,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:37:33,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:33,730 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 18 [2022-11-18 19:37:33,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:33,941 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-18 19:37:33,942 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 24 treesize of output 41 [2022-11-18 19:37:34,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-18 19:37:34,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:34,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:37:34,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-11-18 19:37:35,118 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-18 19:37:37,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2022-11-18 19:37:37,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:37,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:37,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:37,547 INFO L321 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2022-11-18 19:37:37,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 37 [2022-11-18 19:37:37,558 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-18 19:37:37,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:37,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:37,681 INFO L321 Elim1Store]: treesize reduction 16, result has 48.4 percent of original size [2022-11-18 19:37:37,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 35 [2022-11-18 19:37:38,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-18 19:37:38,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2022-11-18 19:37:39,419 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-18 19:37:42,299 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2022-11-18 19:37:42,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:42,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:42,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:42,442 INFO L321 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2022-11-18 19:37:42,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 37 [2022-11-18 19:37:42,467 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 28 treesize of output 16 [2022-11-18 19:37:42,537 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:37:42,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-18 19:37:43,422 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-18 19:37:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 19:37:44,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:37:44,517 INFO L321 Elim1Store]: treesize reduction 7, result has 56.3 percent of original size [2022-11-18 19:37:44,518 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 22 treesize of output 21 [2022-11-18 19:37:47,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:37:47,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139590904] [2022-11-18 19:37:47,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139590904] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:37:47,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [513470025] [2022-11-18 19:37:47,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:47,277 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 19:37:47,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 19:37:47,278 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 19:37:47,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2022-11-18 19:37:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:49,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-18 19:37:49,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:37:50,302 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-18 19:37:50,303 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-18 19:37:50,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:50,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:50,762 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-18 19:37:50,763 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 32 [2022-11-18 19:37:51,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:51,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:51,319 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:37:51,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2022-11-18 19:37:51,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 19:37:54,055 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-18 19:37:56,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:56,027 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 53 [2022-11-18 19:37:56,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:56,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:56,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:56,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:56,180 INFO L321 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2022-11-18 19:37:56,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 35 [2022-11-18 19:37:56,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:56,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:56,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:56,341 INFO L321 Elim1Store]: treesize reduction 61, result has 20.8 percent of original size [2022-11-18 19:37:56,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 48 [2022-11-18 19:37:56,409 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-18 19:37:57,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:57,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:37:57,062 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 19:37:57,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2022-11-18 19:37:57,105 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-18 19:38:01,292 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-18 19:38:06,379 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_create_sub_list_insert_sub_~sub~0#1.base_BEFORE_CALL_20| (_ BitVec 32))) (and (bvult |v_create_sub_list_insert_sub_~sub~0#1.base_BEFORE_CALL_20| |c_#StackHeapBarrier|) (= (_ bv0 1) (bvadd (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_BEFORE_CALL_20|) (_ bv1 1))))) (exists ((v_ArrVal_3317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3314 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3316 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store (store (store |c_old(#memory_$Pointer$.base)| |c_list_add_tail_#in~head#1.base| v_ArrVal_3314) |c_list_add_tail_#in~new#1.base| v_ArrVal_3316) (select (select |c_old(#memory_$Pointer$.base)| |c_list_add_tail_#in~head#1.base|) (bvadd (_ bv4 32) |c_list_add_tail_#in~head#1.offset|)) v_ArrVal_3317))) (exists ((|v_ULTIMATE.start_insert_top_~top~0#1.base_BEFORE_CALL_34| (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_97| (_ BitVec 32))) (and (not (= |v_create_sub_list_insert_sub_~sub~0#1.base_97| |v_ULTIMATE.start_insert_top_~top~0#1.base_BEFORE_CALL_34|)) (bvult |v_create_sub_list_insert_sub_~sub~0#1.base_97| |c_#StackHeapBarrier|) (bvult |v_ULTIMATE.start_insert_top_~top~0#1.base_BEFORE_CALL_34| |c_#StackHeapBarrier|) (not (= |v_create_sub_list_insert_sub_~sub~0#1.base_97| (_ bv1 32))))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2022-11-18 19:38:07,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:07,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2022-11-18 19:38:07,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:07,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:07,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:07,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:07,973 INFO L321 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2022-11-18 19:38:07,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 31 [2022-11-18 19:38:08,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:08,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:08,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:08,214 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-11-18 19:38:08,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 55 [2022-11-18 19:38:08,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 5 treesize of output 3 [2022-11-18 19:38:10,956 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-18 19:38:13,214 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-18 19:38:13,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:38:16,305 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_103| (_ BitVec 32)) (v_ArrVal_3343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3344 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3346 (_ BitVec 32))) (or (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_103| (_ bv1 1)) (select (select (let ((.cse1 (bvadd |c_ULTIMATE.start_insert_top_~top~0#1.offset| (_ bv20 32)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_top_~top~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_top_~top~0#1.base|) .cse1 |c_ULTIMATE.start_insert_top_~top~0#1.base|) (bvadd (_ bv16 32) |c_ULTIMATE.start_insert_top_~top~0#1.offset|) v_ArrVal_3346)) |v_create_sub_list_insert_sub_~sub~0#1.base_103| v_ArrVal_3345))) (store (store (store .cse0 |c_ULTIMATE.start_insert_top_~top~0#1.base| v_ArrVal_3342) |v_create_sub_list_insert_sub_~sub~0#1.base_103| v_ArrVal_3344) (select (select .cse0 |c_ULTIMATE.start_insert_top_~top~0#1.base|) .cse1) v_ArrVal_3343))) |c_ULTIMATE.start_insert_top_~head#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_insert_top_~head#1.offset|)))) (_ bv0 1)) (not (bvult |v_create_sub_list_insert_sub_~sub~0#1.base_103| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_103|) (_ bv0 1))))) is different from false [2022-11-18 19:38:16,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [513470025] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:38:16,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:38:16,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 39] total 65 [2022-11-18 19:38:16,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039723858] [2022-11-18 19:38:16,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:38:16,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-18 19:38:16,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:38:16,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-18 19:38:16,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=5163, Unknown=121, NotChecked=294, Total=5852 [2022-11-18 19:38:16,319 INFO L87 Difference]: Start difference. First operand 219 states and 238 transitions. Second operand has 67 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 55 states have internal predecessors, (82), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-18 19:38:33,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:33,439 INFO L93 Difference]: Finished difference Result 221 states and 239 transitions. [2022-11-18 19:38:33,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-18 19:38:33,440 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 55 states have internal predecessors, (82), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 56 [2022-11-18 19:38:33,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:33,441 INFO L225 Difference]: With dead ends: 221 [2022-11-18 19:38:33,441 INFO L226 Difference]: Without dead ends: 221 [2022-11-18 19:38:33,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 95 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2645 ImplicationChecksByTransitivity, 42.5s TimeCoverageRelationStatistics Valid=445, Invalid=8307, Unknown=186, NotChecked=374, Total=9312 [2022-11-18 19:38:33,445 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 35 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1355 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:33,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1395 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 370 Invalid, 0 Unknown, 1355 Unchecked, 1.7s Time] [2022-11-18 19:38:33,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-11-18 19:38:33,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2022-11-18 19:38:33,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 166 states have (on average 1.1927710843373494) internal successors, (198), 188 states have internal predecessors, (198), 16 states have call successors, (16), 15 states have call predecessors, (16), 17 states have return successors, (23), 15 states have call predecessors, (23), 16 states have call successors, (23) [2022-11-18 19:38:33,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 237 transitions. [2022-11-18 19:38:33,454 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 237 transitions. Word has length 56 [2022-11-18 19:38:33,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:33,454 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 237 transitions. [2022-11-18 19:38:33,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 55 states have internal predecessors, (82), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-18 19:38:33,455 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 237 transitions. [2022-11-18 19:38:33,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 19:38:33,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:33,456 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-18 19:38:33,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2022-11-18 19:38:33,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-11-18 19:38:33,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:38:33,868 INFO L420 AbstractCegarLoop]: === Iteration 27 === 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-18 19:38:33,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:33,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1758182944, now seen corresponding path program 1 times [2022-11-18 19:38:33,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:38:33,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487189133] [2022-11-18 19:38:33,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:33,870 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-18 19:38:33,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:38:33,872 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:38:33,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-11-18 19:38:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:34,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 140 conjunts are in the unsatisfiable core [2022-11-18 19:38:34,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:38:34,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-18 19:38:34,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 19:38:35,058 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 19:38:35,058 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-18 19:38:35,095 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-18 19:38:35,324 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 15 treesize of output 11 [2022-11-18 19:38:35,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 19:38:35,347 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-18 19:38:35,357 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-18 19:38:36,500 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-18 19:38:36,510 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-18 19:38:39,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:39,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:39,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:39,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:38:39,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 48 treesize of output 43 [2022-11-18 19:38:39,339 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 58 treesize of output 51 [2022-11-18 19:38:39,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:39,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:39,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:39,491 INFO L321 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2022-11-18 19:38:39,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 35 [2022-11-18 19:38:39,503 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-18 19:38:39,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:39,522 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-18 19:38:39,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:39,578 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:38:39,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2022-11-18 19:38:39,967 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-18 19:38:39,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2022-11-18 19:38:39,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 19:38:40,005 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-18 19:38:41,699 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-18 19:38:41,710 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-18 19:38:44,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:44,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:44,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:44,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:38:44,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43 [2022-11-18 19:38:45,024 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-18 19:38:45,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:45,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:45,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:45,194 INFO L321 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2022-11-18 19:38:45,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 35 [2022-11-18 19:38:45,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:45,265 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-18 19:38:45,289 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 28 treesize of output 16 [2022-11-18 19:38:45,355 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:38:45,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-18 19:38:46,396 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-18 19:38:46,410 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-18 19:38:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 19:38:47,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:38:52,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:38:52,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487189133] [2022-11-18 19:38:52,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487189133] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:38:52,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [163501131] [2022-11-18 19:38:52,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:52,688 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 19:38:52,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 19:38:52,689 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 19:38:52,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2022-11-18 19:38:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:56,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 151 conjunts are in the unsatisfiable core [2022-11-18 19:38:56,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:38:56,368 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-18 19:38:56,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:38:56,865 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-18 19:38:56,888 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-18 19:38:57,516 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-18 19:38:57,527 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-18 19:38:57,537 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-18 19:38:57,575 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-18 19:39:00,713 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-18 19:39:00,725 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-18 19:39:03,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:39:03,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:39:03,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:39:03,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:39:03,435 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:39:03,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 50 treesize of output 45 [2022-11-18 19:39:03,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:39:03,474 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 53 [2022-11-18 19:39:03,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:39:03,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:39:03,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:39:03,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:39:03,632 INFO L321 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2022-11-18 19:39:03,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 35 [2022-11-18 19:39:03,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:39:03,663 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-18 19:39:03,718 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:39:03,718 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-18 19:39:03,759 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-18 19:39:04,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2022-11-18 19:39:04,375 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-18 19:39:04,386 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-18 19:39:04,395 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-18 19:39:09,122 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-18 19:39:09,145 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-18 19:39:14,046 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_list_add_tail_#in~head#1.base|) (bvadd (_ bv4 32) |c_list_add_tail_#in~head#1.offset|)))) (and (exists ((v_ArrVal_3735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3729 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store (store (store |c_old(#memory_$Pointer$.offset)| |c_list_add_tail_#in~head#1.base| v_ArrVal_3729) |c_list_add_tail_#in~new#1.base| v_ArrVal_3732) .cse0 v_ArrVal_3735) |c_#memory_$Pointer$.offset|)) (exists ((|v_create_sub_list_insert_sub_~sub~0#1.base_110| (_ BitVec 32)) (|v_ULTIMATE.start_insert_top_~top~0#1.base_BEFORE_CALL_39| (_ BitVec 32))) (and (bvult |v_create_sub_list_insert_sub_~sub~0#1.base_110| |c_#StackHeapBarrier|) (bvult |v_ULTIMATE.start_insert_top_~top~0#1.base_BEFORE_CALL_39| |c_#StackHeapBarrier|) (not (= |v_create_sub_list_insert_sub_~sub~0#1.base_110| |v_ULTIMATE.start_insert_top_~top~0#1.base_BEFORE_CALL_39|)))) (exists ((v_ArrVal_3736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3728 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store (store (store |c_old(#memory_$Pointer$.base)| |c_list_add_tail_#in~head#1.base| v_ArrVal_3728) |c_list_add_tail_#in~new#1.base| v_ArrVal_3734) .cse0 v_ArrVal_3736))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))))) is different from true [2022-11-18 19:39:16,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:39:16,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:39:16,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:39:16,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:39:16,492 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:39:16,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2022-11-18 19:39:16,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:39:16,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2022-11-18 19:39:16,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:39:16,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:39:16,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:39:16,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:39:16,719 INFO L321 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2022-11-18 19:39:16,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 31 [2022-11-18 19:39:16,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:39:16,753 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-18 19:39:16,816 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:39:16,817 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-18 19:39:16,957 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-18 19:39:19,374 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-18 19:39:19,388 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-18 19:39:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-18 19:39:21,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:39:28,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [163501131] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:39:28,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:39:28,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 39] total 64 [2022-11-18 19:39:28,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669125081] [2022-11-18 19:39:28,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:39:28,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-18 19:39:28,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:39:28,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-18 19:39:28,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=4588, Unknown=130, NotChecked=138, Total=5112 [2022-11-18 19:39:28,517 INFO L87 Difference]: Start difference. First operand 219 states and 237 transitions. Second operand has 65 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 54 states have internal predecessors, (81), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-18 19:39:56,959 WARN L233 SmtUtils]: Spent 5.92s on a formula simplification. DAG size of input: 141 DAG size of output: 117 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 19:39:58,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:39:58,796 INFO L93 Difference]: Finished difference Result 221 states and 238 transitions. [2022-11-18 19:39:58,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-18 19:39:58,797 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 54 states have internal predecessors, (81), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 56 [2022-11-18 19:39:58,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:39:58,798 INFO L225 Difference]: With dead ends: 221 [2022-11-18 19:39:58,798 INFO L226 Difference]: Without dead ends: 221 [2022-11-18 19:39:58,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2125 ImplicationChecksByTransitivity, 63.6s TimeCoverageRelationStatistics Valid=381, Invalid=6570, Unknown=193, NotChecked=166, Total=7310 [2022-11-18 19:39:58,800 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 16 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1111 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-18 19:39:58,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1528 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 388 Invalid, 0 Unknown, 1111 Unchecked, 1.9s Time] [2022-11-18 19:39:58,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-11-18 19:39:58,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2022-11-18 19:39:58,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 166 states have (on average 1.1867469879518073) internal successors, (197), 188 states have internal predecessors, (197), 16 states have call successors, (16), 15 states have call predecessors, (16), 17 states have return successors, (23), 15 states have call predecessors, (23), 16 states have call successors, (23) [2022-11-18 19:39:58,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 236 transitions. [2022-11-18 19:39:58,809 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 236 transitions. Word has length 56 [2022-11-18 19:39:58,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:39:58,810 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 236 transitions. [2022-11-18 19:39:58,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 54 states have internal predecessors, (81), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-18 19:39:58,810 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 236 transitions. [2022-11-18 19:39:58,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-18 19:39:58,811 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:39:58,811 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:39:58,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2022-11-18 19:39:59,033 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 0 [2022-11-18 19:39:59,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt [2022-11-18 19:39:59,225 INFO L420 AbstractCegarLoop]: === Iteration 28 === 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-18 19:39:59,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:39:59,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1649914890, now seen corresponding path program 1 times [2022-11-18 19:39:59,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:39:59,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977061066] [2022-11-18 19:39:59,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:39:59,226 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-18 19:39:59,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:39:59,227 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:39:59,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:40:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:00,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-18 19:40:00,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:40:00,767 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-18 19:40:00,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-18 19:40:00,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:40:00,915 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-18 19:40:00,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:40:00,942 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-18 19:40:01,047 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 19:40:01,048 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-18 19:40:01,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 16 treesize of output 18 [2022-11-18 19:40:01,393 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-18 19:40:01,466 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-18 19:40:01,477 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-18 19:40:04,047 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-18 19:40:04,180 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2022-11-18 19:40:04,181 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-18 19:40:04,192 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-18 19:40:04,205 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-18 19:40:04,227 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-18 19:40:04,822 INFO L321 Elim1Store]: treesize reduction 62, result has 36.1 percent of original size [2022-11-18 19:40:04,823 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 32 treesize of output 55 [2022-11-18 19:40:05,171 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 40 treesize of output 38 [2022-11-18 19:40:06,051 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-18 19:40:06,737 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:40:06,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:40:07,742 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3960 (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_3960) |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-18 19:40:10,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:40:10,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977061066] [2022-11-18 19:40:10,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977061066] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:40:10,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1143293614] [2022-11-18 19:40:10,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:40:10,903 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 19:40:10,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 19:40:10,905 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 19:40:10,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-11-18 19:40:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:14,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-18 19:40:14,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:40:14,638 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-18 19:40:14,654 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-18 19:40:14,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:40:14,687 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-18 19:40:14,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:40:14,714 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-18 19:40:14,745 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-18 19:40:14,874 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 19:40:14,874 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-18 19:40:15,410 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-18 19:40:15,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 19:40:15,533 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-18 19:40:15,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 19:40:20,286 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 97 treesize of output 56 [2022-11-18 19:40:20,397 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2022-11-18 19:40:20,397 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 107 treesize of output 137 [2022-11-18 19:40:20,411 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 141 treesize of output 101 [2022-11-18 19:40:20,425 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 72 treesize of output 36 [2022-11-18 19:40:21,308 INFO L321 Elim1Store]: treesize reduction 78, result has 31.0 percent of original size [2022-11-18 19:40:21,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 55 [2022-11-18 19:40:21,389 INFO L321 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-11-18 19:40:21,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 19 treesize of output 19 [2022-11-18 19:40:21,949 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 19:40:21,950 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 90 treesize of output 78 [2022-11-18 19:40:23,023 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-18 19:40:23,747 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:40:23,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:40:23,833 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4138 (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_4138) |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-18 19:40:27,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1143293614] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:40:27,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:40:27,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 43 [2022-11-18 19:40:27,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140559852] [2022-11-18 19:40:27,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:40:27,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-18 19:40:27,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:40:27,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-18 19:40:27,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2520, Unknown=58, NotChecked=206, Total=2970 [2022-11-18 19:40:27,900 INFO L87 Difference]: Start difference. First operand 219 states and 236 transitions. Second operand has 44 states, 40 states have (on average 1.825) internal successors, (73), 38 states have internal predecessors, (73), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 19:40:31,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:40:31,724 INFO L93 Difference]: Finished difference Result 230 states and 249 transitions. [2022-11-18 19:40:31,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-18 19:40:31,725 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 1.825) internal successors, (73), 38 states have internal predecessors, (73), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 57 [2022-11-18 19:40:31,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:40:31,726 INFO L225 Difference]: With dead ends: 230 [2022-11-18 19:40:31,726 INFO L226 Difference]: Without dead ends: 230 [2022-11-18 19:40:31,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=270, Invalid=3582, Unknown=62, NotChecked=246, Total=4160 [2022-11-18 19:40:31,728 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 44 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 667 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-18 19:40:31,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1106 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 341 Invalid, 0 Unknown, 667 Unchecked, 1.7s Time] [2022-11-18 19:40:31,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-18 19:40:31,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2022-11-18 19:40:31,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 176 states have (on average 1.1818181818181819) internal successors, (208), 198 states have internal predecessors, (208), 17 states have call successors, (17), 16 states have call predecessors, (17), 17 states have return successors, (24), 15 states have call predecessors, (24), 17 states have call successors, (24) [2022-11-18 19:40:31,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 249 transitions. [2022-11-18 19:40:31,737 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 249 transitions. Word has length 57 [2022-11-18 19:40:31,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:40:31,737 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 249 transitions. [2022-11-18 19:40:31,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 1.825) internal successors, (73), 38 states have internal predecessors, (73), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 19:40:31,738 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 249 transitions. [2022-11-18 19:40:31,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-18 19:40:31,739 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:40:31,739 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:40:31,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2022-11-18 19:40:31,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:40:32,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:40:32,153 INFO L420 AbstractCegarLoop]: === Iteration 29 === 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-18 19:40:32,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:40:32,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1649914891, now seen corresponding path program 1 times [2022-11-18 19:40:32,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:40:32,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324231921] [2022-11-18 19:40:32,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:40:32,155 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-18 19:40:32,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:40:32,156 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:40:32,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2022-11-18 19:40:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:40:33,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 101 conjunts are in the unsatisfiable core [2022-11-18 19:40:33,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:40:33,746 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-18 19:40:33,762 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-18 19:40:33,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:40:33,896 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-18 19:40:33,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:40:33,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 21 treesize of output 20 [2022-11-18 19:40:34,020 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:40:34,021 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-18 19:40:34,041 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-18 19:40:34,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 19:40:34,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 19:40:34,420 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-18 19:40:34,430 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-18 19:40:37,886 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-18 19:40:37,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:40:37,909 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-18 19:40:37,920 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-18 19:40:38,033 INFO L321 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-11-18 19:40:38,033 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 82 treesize of output 114 [2022-11-18 19:40:38,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:40:38,046 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 118 treesize of output 82 [2022-11-18 19:40:38,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:40:38,134 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-18 19:40:38,729 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:40:38,729 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-18 19:40:38,831 INFO L321 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-11-18 19:40:38,832 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 18 treesize of output 20 [2022-11-18 19:40:39,366 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-18 19:40:39,367 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 113 treesize of output 101 [2022-11-18 19:40:39,382 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-18 19:40:40,326 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-18 19:40:40,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-18 19:40:40,853 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:40:40,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:40:42,931 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_4320 (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_4320) |c_create_sub_list_insert_sub_~head#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_4321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4320 (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_4320) |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_4321) |c_create_sub_list_insert_sub_~head#1.base|) .cse1)))))) is different from false [2022-11-18 19:40:57,719 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:40:57,720 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 295 treesize of output 319 [2022-11-18 19:41:14,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:41:14,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324231921] [2022-11-18 19:41:14,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324231921] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:41:14,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [217012627] [2022-11-18 19:41:14,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:41:14,097 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 19:41:14,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 19:41:14,098 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 19:41:14,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2022-11-18 19:41:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:41:19,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 108 conjunts are in the unsatisfiable core [2022-11-18 19:41:19,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:41:20,311 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-18 19:41:20,341 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-18 19:41:20,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:41:20,371 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-18 19:41:20,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:41:20,410 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-18 19:41:20,573 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 19:41:20,573 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-18 19:41:20,643 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-18 19:41:21,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 19:41:21,327 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-18 19:41:21,417 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-18 19:41:21,430 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-18 19:41:33,345 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-18 19:41:33,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:41:33,374 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-18 19:41:33,390 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 86 treesize of output 45 [2022-11-18 19:41:33,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:41:33,407 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-18 19:41:33,570 INFO L321 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-11-18 19:41:33,571 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-18 19:41:33,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:41:33,604 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-18 19:41:33,631 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-18 19:41:35,065 INFO L321 Elim1Store]: treesize reduction 12, result has 55.6 percent of original size [2022-11-18 19:41:35,065 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 26 treesize of output 28 [2022-11-18 19:41:35,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-18 19:41:35,833 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 16 treesize of output 18 [2022-11-18 19:41:35,857 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 38 treesize of output 36 [2022-11-18 19:41:36,227 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-18 19:41:36,245 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-18 19:41:36,344 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:41:36,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:41:36,638 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_4513 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4514 (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_4514) |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_4513) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)))) (forall ((v_ArrVal_4514 (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_4514) |c_create_sub_list_insert_sub_~head#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) is different from false [2022-11-18 19:41:56,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [217012627] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:41:56,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:41:56,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 39 [2022-11-18 19:41:56,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251256639] [2022-11-18 19:41:56,169 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:41:56,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-18 19:41:56,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:41:56,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-18 19:41:56,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2161, Unknown=48, NotChecked=190, Total=2550 [2022-11-18 19:41:56,171 INFO L87 Difference]: Start difference. First operand 230 states and 249 transitions. Second operand has 40 states, 37 states have (on average 1.837837837837838) internal successors, (68), 35 states have internal predecessors, (68), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 19:42:23,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:42:23,364 INFO L93 Difference]: Finished difference Result 233 states and 250 transitions. [2022-11-18 19:42:23,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-18 19:42:23,364 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 1.837837837837838) internal successors, (68), 35 states have internal predecessors, (68), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 57 [2022-11-18 19:42:23,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:42:23,367 INFO L225 Difference]: With dead ends: 233 [2022-11-18 19:42:23,367 INFO L226 Difference]: Without dead ends: 233 [2022-11-18 19:42:23,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 73.3s TimeCoverageRelationStatistics Valid=316, Invalid=4044, Unknown=70, NotChecked=262, Total=4692 [2022-11-18 19:42:23,369 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 75 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 704 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-18 19:42:23,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1188 Invalid, 1496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 782 Invalid, 0 Unknown, 704 Unchecked, 4.9s Time] [2022-11-18 19:42:23,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-11-18 19:42:23,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2022-11-18 19:42:23,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 178 states have (on average 1.1741573033707866) internal successors, (209), 201 states have internal predecessors, (209), 17 states have call successors, (17), 16 states have call predecessors, (17), 18 states have return successors, (24), 15 states have call predecessors, (24), 17 states have call successors, (24) [2022-11-18 19:42:23,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 250 transitions. [2022-11-18 19:42:23,390 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 250 transitions. Word has length 57 [2022-11-18 19:42:23,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:42:23,391 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 250 transitions. [2022-11-18 19:42:23,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 1.837837837837838) internal successors, (68), 35 states have internal predecessors, (68), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 19:42:23,392 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 250 transitions. [2022-11-18 19:42:23,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-18 19:42:23,393 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:42:23,394 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:42:23,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (43)] Forceful destruction successful, exit code 0 [2022-11-18 19:42:23,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2022-11-18 19:42:23,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:42:23,810 INFO L420 AbstractCegarLoop]: === Iteration 30 === 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-18 19:42:23,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:42:23,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1484713093, now seen corresponding path program 2 times [2022-11-18 19:42:23,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:42:23,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666630009] [2022-11-18 19:42:23,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:42:23,812 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-18 19:42:23,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:42:23,813 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:42:23,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-11-18 19:42:24,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:42:24,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:42:24,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-18 19:42:24,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:42:24,610 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-18 19:42:24,629 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-18 19:42:25,140 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-18 19:42:25,715 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:42:25,716 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-18 19:42:28,063 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 19:42:28,063 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-18 19:42:28,074 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-18 19:42:30,521 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:42:30,521 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-18 19:42:30,589 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4680 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_129| (_ BitVec 32)) (v_ArrVal_4679 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_130| (_ BitVec 32)) (|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32)) (v_ArrVal_4678 (_ BitVec 32))) (and (= (store (store (store |c_old(#length)| |v_create_sub_list_insert_sub_~sub~0#1.base_129| v_ArrVal_4678) |v_create_sub_list_insert_sub_~sub~0#1.base_130| v_ArrVal_4679) |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_4680) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |v_create_sub_list_insert_sub_~sub~0#1.base_129|)) (not (= |c_create_sub_list_#in~sub#1.base| |create_sub_list_insert_sub_~sub~0#1.base|)) (not (= |v_create_sub_list_insert_sub_~sub~0#1.base_130| |c_create_sub_list_#in~sub#1.base|)))) is different from true [2022-11-18 19:42:30,921 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-18 19:42:30,922 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 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-18 19:42:30,935 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-18 19:42:31,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:31,470 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-18 19:42:31,471 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 2 case distinctions, treesize of input 18 treesize of output 35 [2022-11-18 19:42:31,569 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:42:31,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-18 19:42:32,014 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 10 not checked. [2022-11-18 19:42:32,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:42:33,973 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-18 19:42:33,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 15 treesize of output 14 [2022-11-18 19:42:34,057 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-18 19:42:34,058 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 15 treesize of output 14 [2022-11-18 19:42:41,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:42:41,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666630009] [2022-11-18 19:42:41,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666630009] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:42:41,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [314991931] [2022-11-18 19:42:41,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:42:41,151 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 19:42:41,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 19:42:41,152 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 19:42:41,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2022-11-18 19:42:42,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:42:42,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:42:42,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-18 19:42:42,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:42:42,803 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-18 19:42:42,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-18 19:42:45,647 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-18 19:42:48,216 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:42:48,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 13 treesize of output 13 [2022-11-18 19:42:50,821 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 19:42:50,822 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-18 19:42:50,834 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-18 19:42:53,530 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:42:53,530 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-18 19:42:54,305 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-18 19:42:54,306 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 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-18 19:42:54,319 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-18 19:42:55,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:42:56,201 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-18 19:42:56,201 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 2 case distinctions, treesize of input 18 treesize of output 35 [2022-11-18 19:42:56,276 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:42:56,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-18 19:42:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 19:42:56,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:42:59,162 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-18 19:42:59,162 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-18 19:42:59,241 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-18 19:42:59,241 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 15 treesize of output 14 [2022-11-18 19:43:02,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [314991931] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:43:02,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:43:02,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 25 [2022-11-18 19:43:02,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184425140] [2022-11-18 19:43:02,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:43:02,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-18 19:43:02,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:43:02,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-18 19:43:02,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=786, Unknown=11, NotChecked=56, Total=930 [2022-11-18 19:43:02,632 INFO L87 Difference]: Start difference. First operand 233 states and 250 transitions. Second operand has 26 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 23 states have internal predecessors, (71), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-18 19:43:10,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:43:10,932 INFO L93 Difference]: Finished difference Result 273 states and 306 transitions. [2022-11-18 19:43:10,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 19:43:10,933 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 23 states have internal predecessors, (71), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-11-18 19:43:10,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:43:10,935 INFO L225 Difference]: With dead ends: 273 [2022-11-18 19:43:10,935 INFO L226 Difference]: Without dead ends: 273 [2022-11-18 19:43:10,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 31.8s TimeCoverageRelationStatistics Valid=117, Invalid=1064, Unknown=13, NotChecked=66, Total=1260 [2022-11-18 19:43:10,937 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 92 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 684 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-18 19:43:10,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 561 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 475 Invalid, 0 Unknown, 684 Unchecked, 2.7s Time] [2022-11-18 19:43:10,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-11-18 19:43:10,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 239. [2022-11-18 19:43:10,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 183 states have (on average 1.174863387978142) internal successors, (215), 206 states have internal predecessors, (215), 18 states have call successors, (18), 16 states have call predecessors, (18), 18 states have return successors, (25), 16 states have call predecessors, (25), 18 states have call successors, (25) [2022-11-18 19:43:10,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 258 transitions. [2022-11-18 19:43:10,947 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 258 transitions. Word has length 61 [2022-11-18 19:43:10,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:43:10,948 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 258 transitions. [2022-11-18 19:43:10,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 23 states have internal predecessors, (71), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-18 19:43:10,949 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 258 transitions. [2022-11-18 19:43:10,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-18 19:43:10,950 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:43:10,950 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-18 19:43:10,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (45)] Forceful destruction successful, exit code 0 [2022-11-18 19:43:11,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Forceful destruction successful, exit code 0 [2022-11-18 19:43:11,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:43:11,362 INFO L420 AbstractCegarLoop]: === Iteration 31 === 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-18 19:43:11,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:43:11,362 INFO L85 PathProgramCache]: Analyzing trace with hash -874034692, now seen corresponding path program 1 times [2022-11-18 19:43:11,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:43:11,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941851955] [2022-11-18 19:43:11,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:43:11,363 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-18 19:43:11,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:43:11,364 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:43:11,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:43:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:11,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-18 19:43:11,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:43:12,394 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-18 19:43:12,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:43:12,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:43:12,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941851955] [2022-11-18 19:43:12,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941851955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:43:12,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:43:12,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:43:12,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642867436] [2022-11-18 19:43:12,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:43:12,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 19:43:12,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:43:12,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 19:43:12,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:43:12,398 INFO L87 Difference]: Start difference. First operand 239 states and 258 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-18 19:43:13,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:43:13,678 INFO L93 Difference]: Finished difference Result 245 states and 266 transitions. [2022-11-18 19:43:13,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:43:13,679 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 63 [2022-11-18 19:43:13,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:43:13,681 INFO L225 Difference]: With dead ends: 245 [2022-11-18 19:43:13,681 INFO L226 Difference]: Without dead ends: 245 [2022-11-18 19:43:13,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-11-18 19:43:13,682 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 87 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:43:13,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 305 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-18 19:43:13,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-11-18 19:43:13,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 238. [2022-11-18 19:43:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 183 states have (on average 1.169398907103825) internal successors, (214), 205 states have internal predecessors, (214), 18 states have call successors, (18), 16 states have call predecessors, (18), 18 states have return successors, (25), 16 states have call predecessors, (25), 18 states have call successors, (25) [2022-11-18 19:43:13,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 257 transitions. [2022-11-18 19:43:13,691 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 257 transitions. Word has length 63 [2022-11-18 19:43:13,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:43:13,692 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 257 transitions. [2022-11-18 19:43:13,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-18 19:43:13,692 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 257 transitions. [2022-11-18 19:43:13,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-18 19:43:13,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:43:13,694 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-18 19:43:13,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:43:13,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:43:13,912 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-18 19:43:13,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:43:13,913 INFO L85 PathProgramCache]: Analyzing trace with hash -874034691, now seen corresponding path program 1 times [2022-11-18 19:43:13,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:43:13,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891813034] [2022-11-18 19:43:13,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:43:13,913 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-18 19:43:13,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:43:13,914 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:43:13,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:43:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:14,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-18 19:43:14,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:43:15,374 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-18 19:43:15,374 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:43:15,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:43:15,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891813034] [2022-11-18 19:43:15,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891813034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:43:15,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:43:15,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:43:15,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486893647] [2022-11-18 19:43:15,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:43:15,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 19:43:15,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:43:15,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 19:43:15,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:43:15,376 INFO L87 Difference]: Start difference. First operand 238 states and 257 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-18 19:43:16,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:43:16,904 INFO L93 Difference]: Finished difference Result 237 states and 256 transitions. [2022-11-18 19:43:16,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:43:16,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 63 [2022-11-18 19:43:16,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:43:16,906 INFO L225 Difference]: With dead ends: 237 [2022-11-18 19:43:16,907 INFO L226 Difference]: Without dead ends: 237 [2022-11-18 19:43:16,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-11-18 19:43:16,909 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 85 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:43:16,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 288 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-18 19:43:16,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-11-18 19:43:16,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2022-11-18 19:43:16,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 183 states have (on average 1.1639344262295082) internal successors, (213), 204 states have internal predecessors, (213), 18 states have call successors, (18), 16 states have call predecessors, (18), 18 states have return successors, (25), 16 states have call predecessors, (25), 18 states have call successors, (25) [2022-11-18 19:43:16,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 256 transitions. [2022-11-18 19:43:16,918 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 256 transitions. Word has length 63 [2022-11-18 19:43:16,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:43:16,919 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 256 transitions. [2022-11-18 19:43:16,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-18 19:43:16,919 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 256 transitions. [2022-11-18 19:43:16,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-18 19:43:16,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:43:16,921 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2022-11-18 19:43:16,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:43:17,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:43:17,135 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-18 19:43:17,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:43:17,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2019287991, now seen corresponding path program 1 times [2022-11-18 19:43:17,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:43:17,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1513451777] [2022-11-18 19:43:17,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:43:17,136 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-18 19:43:17,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:43:17,137 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:43:17,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2022-11-18 19:43:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:18,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 143 conjunts are in the unsatisfiable core [2022-11-18 19:43:18,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:43:18,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:18,691 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 18 [2022-11-18 19:43:18,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:19,088 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-18 19:43:19,089 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 24 treesize of output 41 [2022-11-18 19:43:19,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-18 19:43:19,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-18 19:43:19,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:19,644 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:43:19,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-11-18 19:43:21,038 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-18 19:43:24,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:24,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:24,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:24,647 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:43:24,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 50 treesize of output 45 [2022-11-18 19:43:24,668 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 60 treesize of output 53 [2022-11-18 19:43:24,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:24,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:24,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:24,848 INFO L321 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2022-11-18 19:43:24,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 37 [2022-11-18 19:43:24,864 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-18 19:43:24,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:24,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:25,066 INFO L321 Elim1Store]: treesize reduction 16, result has 48.4 percent of original size [2022-11-18 19:43:25,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 35 [2022-11-18 19:43:25,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-18 19:43:25,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-18 19:43:25,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2022-11-18 19:43:27,656 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-18 19:43:29,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:29,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:29,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:29,737 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:43:29,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2022-11-18 19:43:29,777 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2022-11-18 19:43:29,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:29,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:29,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:29,982 INFO L321 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2022-11-18 19:43:29,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 37 [2022-11-18 19:43:30,056 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:43:30,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-18 19:43:30,192 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-18 19:43:30,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-18 19:43:30,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-18 19:43:33,924 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 29 treesize of output 19 [2022-11-18 19:43:34,776 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 93 treesize of output 63 [2022-11-18 19:43:34,793 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 69 treesize of output 39 [2022-11-18 19:43:36,276 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 43 treesize of output 23 [2022-11-18 19:43:37,159 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-18 19:43:37,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:43:38,695 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 60 treesize of output 56 [2022-11-18 19:43:39,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:43:39,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1513451777] [2022-11-18 19:43:39,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1513451777] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:43:39,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [172801526] [2022-11-18 19:43:39,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:43:39,330 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 19:43:39,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 19:43:39,331 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 19:43:39,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (49)] Waiting until timeout for monitored process [2022-11-18 19:43:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:43,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 152 conjunts are in the unsatisfiable core [2022-11-18 19:43:43,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:43:44,070 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-18 19:43:44,979 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-18 19:43:44,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 19:43:45,017 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-18 19:43:48,534 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-18 19:43:51,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:51,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:51,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:51,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:51,626 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:43:51,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 52 treesize of output 47 [2022-11-18 19:43:51,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:51,665 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 55 [2022-11-18 19:43:51,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:51,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:51,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:51,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:51,877 INFO L321 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2022-11-18 19:43:51,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 37 [2022-11-18 19:43:51,941 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:43:51,942 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-18 19:43:51,985 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-18 19:43:52,835 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-18 19:43:52,848 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-18 19:43:52,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2022-11-18 19:43:58,122 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-18 19:44:05,307 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_list_add_tail_#in~head#1.base|) (bvadd (_ bv4 32) |c_list_add_tail_#in~head#1.offset|)))) (and (exists ((|v_create_sub_list_insert_sub_~sub~0#1.base_BEFORE_CALL_32| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_BEFORE_CALL_32|) (_ bv1 1))) (bvult |v_create_sub_list_insert_sub_~sub~0#1.base_BEFORE_CALL_32| |c_#StackHeapBarrier|))) (exists ((v_ArrVal_5444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5452 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store (store (store |c_old(#memory_$Pointer$.base)| |c_list_add_tail_#in~head#1.base| v_ArrVal_5444) |c_list_add_tail_#in~new#1.base| v_ArrVal_5450) .cse0 v_ArrVal_5452) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| |c_list_add_tail_#in~head#1.base| v_ArrVal_5445) |c_list_add_tail_#in~new#1.base| v_ArrVal_5448) .cse0 v_ArrVal_5451))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (exists ((|v_create_sub_list_insert_sub_~sub~0#1.base_154| (_ BitVec 32)) (|v_ULTIMATE.start_insert_top_~top~0#1.base_BEFORE_CALL_53| (_ BitVec 32))) (and (not (= |v_create_sub_list_insert_sub_~sub~0#1.base_154| |v_ULTIMATE.start_insert_top_~top~0#1.base_BEFORE_CALL_53|)) (bvult |v_ULTIMATE.start_insert_top_~top~0#1.base_BEFORE_CALL_53| |c_#StackHeapBarrier|) (bvult |v_create_sub_list_insert_sub_~sub~0#1.base_154| |c_#StackHeapBarrier|))))) is different from true [2022-11-18 19:44:07,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:44:07,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:44:07,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:44:07,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:44:07,397 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:44:07,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2022-11-18 19:44:07,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:44:07,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2022-11-18 19:44:07,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:44:07,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:44:07,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:44:07,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:44:07,670 INFO L321 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2022-11-18 19:44:07,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 33 [2022-11-18 19:44:07,848 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 19:44:07,848 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 19 treesize of output 27 [2022-11-18 19:44:08,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 5 treesize of output 3 [2022-11-18 19:44:09,174 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-18 19:44:09,199 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-18 19:44:15,323 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 29 treesize of output 19 [2022-11-18 19:44:16,981 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 92 treesize of output 62 [2022-11-18 19:44:17,006 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 68 treesize of output 38 [2022-11-18 19:44:20,087 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 22 [2022-11-18 19:44:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-18 19:44:22,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:44:23,319 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 60 treesize of output 56 [2022-11-18 19:44:23,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [172801526] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:44:23,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:44:23,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 44] total 68 [2022-11-18 19:44:23,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495282352] [2022-11-18 19:44:23,831 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:44:23,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-11-18 19:44:23,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 19:44:23,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-11-18 19:44:23,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=4698, Unknown=37, NotChecked=138, Total=5112 [2022-11-18 19:44:23,833 INFO L87 Difference]: Start difference. First operand 237 states and 256 transitions. Second operand has 69 states, 61 states have (on average 1.459016393442623) internal successors, (89), 58 states have internal predecessors, (89), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-18 19:44:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:44:48,754 INFO L93 Difference]: Finished difference Result 247 states and 269 transitions. [2022-11-18 19:44:48,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-18 19:44:48,755 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 61 states have (on average 1.459016393442623) internal successors, (89), 58 states have internal predecessors, (89), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 66 [2022-11-18 19:44:48,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:44:48,757 INFO L225 Difference]: With dead ends: 247 [2022-11-18 19:44:48,757 INFO L226 Difference]: Without dead ends: 247 [2022-11-18 19:44:48,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 65 SyntacticMatches, 13 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2175 ImplicationChecksByTransitivity, 64.5s TimeCoverageRelationStatistics Valid=368, Invalid=7048, Unknown=70, NotChecked=170, Total=7656 [2022-11-18 19:44:48,759 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 23 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1021 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-18 19:44:48,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1384 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 217 Invalid, 0 Unknown, 1021 Unchecked, 1.4s Time] [2022-11-18 19:44:48,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-11-18 19:44:48,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 244. [2022-11-18 19:44:48,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 190 states have (on average 1.1736842105263159) internal successors, (223), 210 states have internal predecessors, (223), 18 states have call successors, (18), 16 states have call predecessors, (18), 18 states have return successors, (25), 17 states have call predecessors, (25), 18 states have call successors, (25) [2022-11-18 19:44:48,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 266 transitions. [2022-11-18 19:44:48,768 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 266 transitions. Word has length 66 [2022-11-18 19:44:48,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:44:48,769 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 266 transitions. [2022-11-18 19:44:48,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 61 states have (on average 1.459016393442623) internal successors, (89), 58 states have internal predecessors, (89), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-18 19:44:48,770 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 266 transitions. [2022-11-18 19:44:48,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-18 19:44:48,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:44:48,771 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2022-11-18 19:44:48,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (49)] Forceful destruction successful, exit code 0 [2022-11-18 19:44:49,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Forceful destruction successful, exit code 0 [2022-11-18 19:44:49,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:44:49,194 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-18 19:44:49,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:44:49,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2019287992, now seen corresponding path program 1 times [2022-11-18 19:44:49,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 19:44:49,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264106189] [2022-11-18 19:44:49,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:44:49,195 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-18 19:44:49,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 19:44:49,196 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:44:49,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 19:44:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:50,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 164 conjunts are in the unsatisfiable core [2022-11-18 19:44:50,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:44:50,632 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-18 19:44:50,814 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-18 19:44:50,964 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 19:44:50,965 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-18 19:44:51,421 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 15 treesize of output 11 [2022-11-18 19:44:51,441 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-18 19:44:51,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-18 19:44:51,477 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-18 19:44:53,098 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-18 19:44:53,112 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-18 19:44:56,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:44:56,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:44:56,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:44:56,875 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:44:56,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 50 treesize of output 45 [2022-11-18 19:44:56,913 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 60 treesize of output 53 [2022-11-18 19:44:56,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:44:56,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:44:56,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:44:57,081 INFO L321 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2022-11-18 19:44:57,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 37 [2022-11-18 19:44:57,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:44:57,120 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-18 19:44:57,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:44:57,199 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:44:57,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2022-11-18 19:44:57,260 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-18 19:44:57,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-18 19:44:57,759 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-18 19:44:57,783 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-18 19:44:57,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2022-11-18 19:45:00,771 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-18 19:45:00,784 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-18 19:45:05,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:05,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:05,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:05,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:45:05,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2022-11-18 19:45:05,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 55 [2022-11-18 19:45:05,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:05,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:05,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:05,599 INFO L321 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2022-11-18 19:45:05,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 37 [2022-11-18 19:45:05,613 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-18 19:45:05,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:05,643 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 12 treesize of output 14 [2022-11-18 19:45:05,729 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:45:05,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-18 19:45:06,493 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-18 19:45:06,517 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-18 19:45:09,949 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 29 treesize of output 19 [2022-11-18 19:45:09,974 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 29 treesize of output 19 [2022-11-18 19:45:11,166 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 110 treesize of output 74 [2022-11-18 19:45:11,183 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 80 treesize of output 44 [2022-11-18 19:45:13,065 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 41 treesize of output 21 [2022-11-18 19:45:13,098 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-18 19:45:14,209 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 19:45:14,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:45:18,460 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 60 treesize of output 52 [2022-11-18 19:45:18,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:18,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:18,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:18,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:20,763 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 120 treesize of output 104 [2022-11-18 19:45:20,777 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 186 treesize of output 154 [2022-11-18 19:45:21,548 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 84 treesize of output 52 [2022-11-18 19:45:32,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 19:45:32,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264106189] [2022-11-18 19:45:32,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264106189] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:45:32,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [425653346] [2022-11-18 19:45:32,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:45:32,706 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 19:45:32,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 19:45:32,707 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 19:45:32,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e077585-8ee8-4da5-85de-97bef4ff1b7f/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process [2022-11-18 19:45:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:37,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 165 conjunts are in the unsatisfiable core [2022-11-18 19:45:37,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:45:38,098 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-18 19:45:38,165 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-18 19:45:39,253 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-18 19:45:39,267 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-18 19:45:39,311 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-18 19:45:39,325 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-18 19:45:41,179 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-18 19:45:41,192 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-18 19:45:44,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:44,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:44,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:44,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:44,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:45:44,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 52 treesize of output 47 [2022-11-18 19:45:44,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:44,625 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 55 [2022-11-18 19:45:44,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:44,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:44,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:44,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:44,853 INFO L321 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2022-11-18 19:45:44,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 37 [2022-11-18 19:45:44,870 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-18 19:45:44,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:44,909 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-18 19:45:44,975 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:45:44,976 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-18 19:45:46,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 19:45:46,084 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-18 19:45:46,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2022-11-18 19:45:46,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-18 19:45:52,971 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-18 19:45:52,985 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-18 19:46:00,778 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_list_add_tail_#in~head#1.base|) (bvadd (_ bv4 32) |c_list_add_tail_#in~head#1.offset|)))) (and (exists ((v_ArrVal_5856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5861 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5862 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| |c_list_add_tail_#in~head#1.base| v_ArrVal_5856) |c_list_add_tail_#in~new#1.base| v_ArrVal_5861) .cse0 v_ArrVal_5862))) (exists ((v_ArrVal_5857 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5860 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store (store (store |c_old(#memory_$Pointer$.base)| |c_list_add_tail_#in~head#1.base| v_ArrVal_5857) |c_list_add_tail_#in~new#1.base| v_ArrVal_5860) .cse0 v_ArrVal_5863))) (exists ((|v_ULTIMATE.start_insert_top_~top~0#1.base_BEFORE_CALL_61| (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_167| (_ BitVec 32))) (and (bvult |v_create_sub_list_insert_sub_~sub~0#1.base_167| |c_#StackHeapBarrier|) (bvult |v_ULTIMATE.start_insert_top_~top~0#1.base_BEFORE_CALL_61| |c_#StackHeapBarrier|) (not (= |v_create_sub_list_insert_sub_~sub~0#1.base_167| |v_ULTIMATE.start_insert_top_~top~0#1.base_BEFORE_CALL_61|)))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))))) is different from true [2022-11-18 19:46:04,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:46:04,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:46:04,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:46:04,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:46:04,069 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:46:04,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2022-11-18 19:46:04,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:46:04,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 55 [2022-11-18 19:46:04,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:46:04,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:46:04,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:46:04,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:46:04,386 INFO L321 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2022-11-18 19:46:04,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 37 [2022-11-18 19:46:04,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:46:04,433 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-18 19:46:04,523 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:46:04,523 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-18 19:46:04,714 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-18 19:46:06,113 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-18 19:46:06,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 19:46:16,784 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 29 treesize of output 19 [2022-11-18 19:46:16,809 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 29 treesize of output 19 [2022-11-18 19:46:19,475 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 109 treesize of output 73 [2022-11-18 19:46:19,496 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 79 treesize of output 43 [2022-11-18 19:46:23,065 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 40 treesize of output 20 [2022-11-18 19:46:23,098 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-18 19:46:26,660 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-18 19:46:26,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:46:28,420 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 60 treesize of output 52 [2022-11-18 19:46:28,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:46:28,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:46:28,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:46:28,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:46:28,911 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 120 treesize of output 104 [2022-11-18 19:46:28,928 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 186 treesize of output 154 [2022-11-18 19:46:29,682 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 84 treesize of output 52