./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a 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_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R --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 72a3b80a468e10df778a3b8ff41e4c2b1e0b82c1005f056b209a19315511b1a5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:29:22,308 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:29:22,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:29:22,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:29:22,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:29:22,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:29:22,353 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:29:22,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:29:22,359 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:29:22,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:29:22,369 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:29:22,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:29:22,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:29:22,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:29:22,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:29:22,381 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:29:22,383 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:29:22,384 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:29:22,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:29:22,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:29:22,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:29:22,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:29:22,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:29:22,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:29:22,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:29:22,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:29:22,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:29:22,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:29:22,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:29:22,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:29:22,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:29:22,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:29:22,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:29:22,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:29:22,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:29:22,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:29:22,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:29:22,421 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:29:22,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:29:22,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:29:22,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:29:22,426 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 18:29:22,463 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:29:22,464 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:29:22,465 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:29:22,465 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:29:22,466 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:29:22,466 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:29:22,467 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:29:22,467 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:29:22,467 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:29:22,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:29:22,469 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:29:22,469 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 18:29:22,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:29:22,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:29:22,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:29:22,470 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 18:29:22,470 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 18:29:22,470 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 18:29:22,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:29:22,471 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 18:29:22,471 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:29:22,471 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:29:22,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:29:22,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:29:22,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:29:22,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:29:22,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:29:22,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:29:22,473 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:29:22,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:29:22,474 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:29:22,474 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:29:22,474 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:29:22,475 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/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_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R 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 -> 72a3b80a468e10df778a3b8ff41e4c2b1e0b82c1005f056b209a19315511b1a5 [2022-11-25 18:29:22,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:29:22,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:29:22,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:29:22,817 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:29:22,817 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:29:22,818 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i [2022-11-25 18:29:25,856 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:29:26,181 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:29:26,181 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i [2022-11-25 18:29:26,209 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/data/ba10ed18a/2cd66335d5254588934a5ad4d71f2004/FLAG89a129cc4 [2022-11-25 18:29:26,229 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/data/ba10ed18a/2cd66335d5254588934a5ad4d71f2004 [2022-11-25 18:29:26,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:29:26,236 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:29:26,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:29:26,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:29:26,246 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:29:26,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:29:26" (1/1) ... [2022-11-25 18:29:26,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@260b51c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:26, skipping insertion in model container [2022-11-25 18:29:26,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:29:26" (1/1) ... [2022-11-25 18:29:26,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:29:26,345 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:29:26,890 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i[33021,33034] [2022-11-25 18:29:27,032 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 18:29:27,059 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i[44590,44603] [2022-11-25 18:29:27,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:29:27,112 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-11-25 18:29:27,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@16a44100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:27, skipping insertion in model container [2022-11-25 18:29:27,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:29:27,113 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-25 18:29:27,115 INFO L158 Benchmark]: Toolchain (without parser) took 877.83ms. Allocated memory is still 153.1MB. Free memory was 114.1MB in the beginning and 108.7MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 18:29:27,115 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 119.5MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:29:27,116 INFO L158 Benchmark]: CACSL2BoogieTranslator took 871.18ms. Allocated memory is still 153.1MB. Free memory was 113.8MB in the beginning and 108.7MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 18:29:27,117 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.21ms. Allocated memory is still 119.5MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 871.18ms. Allocated memory is still 153.1MB. Free memory was 113.8MB in the beginning and 108.7MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 736]: 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_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R --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 72a3b80a468e10df778a3b8ff41e4c2b1e0b82c1005f056b209a19315511b1a5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:29:29,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:29:29,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:29:29,452 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:29:29,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:29:29,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:29:29,455 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:29:29,457 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:29:29,459 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:29:29,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:29:29,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:29:29,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:29:29,462 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:29:29,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:29:29,465 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:29:29,466 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:29:29,467 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:29:29,468 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:29:29,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:29:29,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:29:29,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:29:29,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:29:29,477 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:29:29,478 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:29:29,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:29:29,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:29:29,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:29:29,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:29:29,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:29:29,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:29:29,485 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:29:29,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:29:29,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:29:29,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:29:29,501 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:29:29,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:29:29,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:29:29,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:29:29,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:29:29,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:29:29,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:29:29,506 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 18:29:29,548 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:29:29,549 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:29:29,549 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:29:29,549 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:29:29,550 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:29:29,555 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:29:29,556 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:29:29,556 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:29:29,556 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:29:29,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:29:29,558 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:29:29,558 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 18:29:29,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:29:29,559 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:29:29,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:29:29,559 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 18:29:29,559 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 18:29:29,560 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 18:29:29,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:29:29,560 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 18:29:29,560 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 18:29:29,561 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 18:29:29,561 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:29:29,562 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:29:29,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:29:29,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:29:29,563 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:29:29,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:29:29,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:29:29,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:29:29,564 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 18:29:29,564 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 18:29:29,564 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:29:29,565 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:29:29,565 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:29:29,565 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 18:29:29,565 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/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_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R 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 -> 72a3b80a468e10df778a3b8ff41e4c2b1e0b82c1005f056b209a19315511b1a5 [2022-11-25 18:29:29,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:29:29,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:29:29,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:29:29,983 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:29:29,983 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:29:29,985 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i [2022-11-25 18:29:33,052 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:29:33,451 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:29:33,452 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i [2022-11-25 18:29:33,466 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/data/5bf0e4af2/ed0eb8a65aa446809a5a5fcab94a5be7/FLAGc6ea4d9e8 [2022-11-25 18:29:33,482 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/data/5bf0e4af2/ed0eb8a65aa446809a5a5fcab94a5be7 [2022-11-25 18:29:33,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:29:33,487 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:29:33,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:29:33,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:29:33,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:29:33,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:29:33" (1/1) ... [2022-11-25 18:29:33,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36fdccc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:33, skipping insertion in model container [2022-11-25 18:29:33,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:29:33" (1/1) ... [2022-11-25 18:29:33,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:29:33,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:29:33,998 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i[33021,33034] [2022-11-25 18:29:34,197 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 18:29:34,206 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i[44590,44603] [2022-11-25 18:29:34,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:29:34,234 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-25 18:29:34,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:29:34,264 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i[33021,33034] [2022-11-25 18:29:34,330 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 18:29:34,338 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i[44590,44603] [2022-11-25 18:29:34,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:29:34,369 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:29:34,397 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i[33021,33034] [2022-11-25 18:29:34,481 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 18:29:34,488 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i[44590,44603] [2022-11-25 18:29:34,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:29:34,535 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:29:34,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:34 WrapperNode [2022-11-25 18:29:34,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:29:34,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:29:34,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:29:34,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:29:34,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:34" (1/1) ... [2022-11-25 18:29:34,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:34" (1/1) ... [2022-11-25 18:29:34,650 INFO L138 Inliner]: procedures = 180, calls = 336, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1201 [2022-11-25 18:29:34,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:29:34,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:29:34,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:29:34,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:29:34,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:34" (1/1) ... [2022-11-25 18:29:34,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:34" (1/1) ... [2022-11-25 18:29:34,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:34" (1/1) ... [2022-11-25 18:29:34,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:34" (1/1) ... [2022-11-25 18:29:34,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:34" (1/1) ... [2022-11-25 18:29:34,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:34" (1/1) ... [2022-11-25 18:29:34,774 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:34" (1/1) ... [2022-11-25 18:29:34,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:34" (1/1) ... [2022-11-25 18:29:34,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:29:34,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:29:34,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:29:34,796 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:29:34,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:34" (1/1) ... [2022-11-25 18:29:34,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:29:34,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:29:34,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:29:34,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:29:34,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-25 18:29:34,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-25 18:29:34,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 18:29:34,886 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 18:29:34,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-25 18:29:34,886 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-25 18:29:34,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 18:29:34,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:29:34,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 18:29:34,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:29:34,887 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-25 18:29:34,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 18:29:34,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:29:34,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 18:29:34,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 18:29:34,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:29:34,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:29:35,188 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:29:35,190 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:29:35,194 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 18:29:40,609 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:29:40,628 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:29:40,632 INFO L300 CfgBuilder]: Removed 72 assume(true) statements. [2022-11-25 18:29:40,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:29:40 BoogieIcfgContainer [2022-11-25 18:29:40,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:29:40,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:29:40,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:29:40,643 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:29:40,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:29:33" (1/3) ... [2022-11-25 18:29:40,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57495e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:29:40, skipping insertion in model container [2022-11-25 18:29:40,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:29:34" (2/3) ... [2022-11-25 18:29:40,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57495e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:29:40, skipping insertion in model container [2022-11-25 18:29:40,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:29:40" (3/3) ... [2022-11-25 18:29:40,649 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test3-2.i [2022-11-25 18:29:40,667 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:29:40,668 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 639 error locations. [2022-11-25 18:29:40,761 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:29:40,770 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=PETRI_NET, 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;@b5c8644, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:29:40,770 INFO L358 AbstractCegarLoop]: Starting to check reachability of 639 error locations. [2022-11-25 18:29:40,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 1270 states, 623 states have (on average 2.258426966292135) internal successors, (1407), 1264 states have internal predecessors, (1407), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 18:29:40,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 18:29:40,787 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:40,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 18:29:40,788 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:29:40,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:40,798 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2022-11-25 18:29:40,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:29:40,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984784153] [2022-11-25 18:29:40,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:40,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-25 18:29:40,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:29:40,822 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:29:40,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 18:29:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:41,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 18:29:41,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:29:41,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 18:29:41,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:41,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:29:41,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:29:41,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984784153] [2022-11-25 18:29:41,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984784153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:41,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:41,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:29:41,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971533295] [2022-11-25 18:29:41,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:41,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:29:41,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:29:41,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:29:41,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:29:41,169 INFO L87 Difference]: Start difference. First operand has 1270 states, 623 states have (on average 2.258426966292135) internal successors, (1407), 1264 states have internal predecessors, (1407), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:43,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:43,838 INFO L93 Difference]: Finished difference Result 1442 states and 1526 transitions. [2022-11-25 18:29:43,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:29:43,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-25 18:29:43,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:43,885 INFO L225 Difference]: With dead ends: 1442 [2022-11-25 18:29:43,890 INFO L226 Difference]: Without dead ends: 1440 [2022-11-25 18:29:43,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:29:43,895 INFO L413 NwaCegarLoop]: 767 mSDtfsCounter, 1179 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:43,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 926 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-25 18:29:43,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2022-11-25 18:29:44,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1255. [2022-11-25 18:29:44,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 623 states have (on average 2.110754414125201) internal successors, (1315), 1249 states have internal predecessors, (1315), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 18:29:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1331 transitions. [2022-11-25 18:29:44,023 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1331 transitions. Word has length 3 [2022-11-25 18:29:44,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:44,024 INFO L495 AbstractCegarLoop]: Abstraction has 1255 states and 1331 transitions. [2022-11-25 18:29:44,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:44,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1331 transitions. [2022-11-25 18:29:44,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 18:29:44,025 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:44,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 18:29:44,043 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -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)] Ended with exit code 0 [2022-11-25 18:29:44,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:29:44,237 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:29:44,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:44,238 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2022-11-25 18:29:44,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:29:44,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213456667] [2022-11-25 18:29:44,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:44,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:29:44,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:29:44,263 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:29:44,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 18:29:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:44,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 18:29:44,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:29:44,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:29:44,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:44,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:29:44,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:29:44,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213456667] [2022-11-25 18:29:44,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213456667] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:44,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:44,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:29:44,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14763773] [2022-11-25 18:29:44,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:44,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:29:44,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:29:44,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:29:44,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:29:44,445 INFO L87 Difference]: Start difference. First operand 1255 states and 1331 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:48,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:48,871 INFO L93 Difference]: Finished difference Result 1864 states and 1991 transitions. [2022-11-25 18:29:48,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:29:48,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-25 18:29:48,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:48,879 INFO L225 Difference]: With dead ends: 1864 [2022-11-25 18:29:48,880 INFO L226 Difference]: Without dead ends: 1864 [2022-11-25 18:29:48,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:29:48,881 INFO L413 NwaCegarLoop]: 1045 mSDtfsCounter, 650 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 1746 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:48,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 1746 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-11-25 18:29:48,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2022-11-25 18:29:48,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1455. [2022-11-25 18:29:48,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1455 states, 824 states have (on average 2.095873786407767) internal successors, (1727), 1449 states have internal predecessors, (1727), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 18:29:48,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 1743 transitions. [2022-11-25 18:29:48,929 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 1743 transitions. Word has length 3 [2022-11-25 18:29:48,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:48,929 INFO L495 AbstractCegarLoop]: Abstraction has 1455 states and 1743 transitions. [2022-11-25 18:29:48,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:48,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 1743 transitions. [2022-11-25 18:29:48,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 18:29:48,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:48,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:48,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:29:49,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:29:49,135 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:29:49,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:49,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1466973012, now seen corresponding path program 1 times [2022-11-25 18:29:49,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:29:49,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612488480] [2022-11-25 18:29:49,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:49,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-25 18:29:49,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:29:49,138 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:29:49,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 18:29:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:49,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 18:29:49,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:29:49,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:29:49,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 18:29:49,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:29:49,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 18:29:49,429 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:29:49,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 18:29:49,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:49,457 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:29:49,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:29:49,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612488480] [2022-11-25 18:29:49,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612488480] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:49,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:49,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:29:49,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893237694] [2022-11-25 18:29:49,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:49,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:29:49,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:29:49,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:29:49,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:29:49,464 INFO L87 Difference]: Start difference. First operand 1455 states and 1743 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:53,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:53,561 INFO L93 Difference]: Finished difference Result 1633 states and 1932 transitions. [2022-11-25 18:29:53,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:29:53,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2022-11-25 18:29:53,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:53,567 INFO L225 Difference]: With dead ends: 1633 [2022-11-25 18:29:53,567 INFO L226 Difference]: Without dead ends: 1633 [2022-11-25 18:29:53,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:29:53,568 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 1470 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:53,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 542 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-25 18:29:53,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2022-11-25 18:29:53,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1244. [2022-11-25 18:29:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 623 states have (on average 2.091492776886035) internal successors, (1303), 1238 states have internal predecessors, (1303), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 18:29:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1319 transitions. [2022-11-25 18:29:53,594 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1319 transitions. Word has length 7 [2022-11-25 18:29:53,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:53,594 INFO L495 AbstractCegarLoop]: Abstraction has 1244 states and 1319 transitions. [2022-11-25 18:29:53,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:53,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1319 transitions. [2022-11-25 18:29:53,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 18:29:53,595 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:53,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:53,607 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -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)] Ended with exit code 0 [2022-11-25 18:29:53,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:29:53,807 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:29:53,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:53,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476910, now seen corresponding path program 1 times [2022-11-25 18:29:53,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:29:53,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686034120] [2022-11-25 18:29:53,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:53,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:29:53,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:29:53,810 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:29:53,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 18:29:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:53,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 18:29:53,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:29:53,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 18:29:53,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:53,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:29:53,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:29:53,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686034120] [2022-11-25 18:29:53,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686034120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:53,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:53,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:29:53,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267959878] [2022-11-25 18:29:53,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:53,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:29:53,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:29:53,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:29:53,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:29:53,971 INFO L87 Difference]: Start difference. First operand 1244 states and 1319 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:56,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:56,576 INFO L93 Difference]: Finished difference Result 1571 states and 1675 transitions. [2022-11-25 18:29:56,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:29:56,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-25 18:29:56,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:56,583 INFO L225 Difference]: With dead ends: 1571 [2022-11-25 18:29:56,583 INFO L226 Difference]: Without dead ends: 1571 [2022-11-25 18:29:56,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:29:56,584 INFO L413 NwaCegarLoop]: 1161 mSDtfsCounter, 988 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:56,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 1507 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-25 18:29:56,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2022-11-25 18:29:56,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1195. [2022-11-25 18:29:56,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 623 states have (on average 2.012841091492777) internal successors, (1254), 1189 states have internal predecessors, (1254), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 18:29:56,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1270 transitions. [2022-11-25 18:29:56,637 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1270 transitions. Word has length 8 [2022-11-25 18:29:56,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:56,638 INFO L495 AbstractCegarLoop]: Abstraction has 1195 states and 1270 transitions. [2022-11-25 18:29:56,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:29:56,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1270 transitions. [2022-11-25 18:29:56,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 18:29:56,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:56,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:56,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:29:56,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:29:56,839 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:29:56,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:56,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476909, now seen corresponding path program 1 times [2022-11-25 18:29:56,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:29:56,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200851968] [2022-11-25 18:29:56,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:56,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:29:56,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:29:56,843 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:29:56,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 18:29:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:56,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 18:29:56,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:29:57,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:29:57,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:29:57,042 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:29:57,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:29:57,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200851968] [2022-11-25 18:29:57,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200851968] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:57,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:57,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:29:57,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563220868] [2022-11-25 18:29:57,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:57,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:29:57,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:29:57,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:29:57,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:29:57,045 INFO L87 Difference]: Start difference. First operand 1195 states and 1270 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:00,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:00,732 INFO L93 Difference]: Finished difference Result 1649 states and 1756 transitions. [2022-11-25 18:30:00,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:30:00,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-25 18:30:00,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:00,737 INFO L225 Difference]: With dead ends: 1649 [2022-11-25 18:30:00,737 INFO L226 Difference]: Without dead ends: 1649 [2022-11-25 18:30:00,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:30:00,738 INFO L413 NwaCegarLoop]: 1370 mSDtfsCounter, 673 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:00,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 1910 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-25 18:30:00,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2022-11-25 18:30:00,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1217. [2022-11-25 18:30:00,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 655 states have (on average 2.0) internal successors, (1310), 1211 states have internal predecessors, (1310), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 18:30:00,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1326 transitions. [2022-11-25 18:30:00,766 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1326 transitions. Word has length 8 [2022-11-25 18:30:00,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:00,766 INFO L495 AbstractCegarLoop]: Abstraction has 1217 states and 1326 transitions. [2022-11-25 18:30:00,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:00,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1326 transitions. [2022-11-25 18:30:00,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 18:30:00,767 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:00,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:30:00,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 18:30:00,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:00,979 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr526REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:30:00,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:00,980 INFO L85 PathProgramCache]: Analyzing trace with hash 693876885, now seen corresponding path program 1 times [2022-11-25 18:30:00,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:30:00,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610930692] [2022-11-25 18:30:00,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:30:00,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:00,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:30:00,981 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:30:00,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 18:30:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:01,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 18:30:01,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:30:01,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:30:01,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:30:01,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:30:01,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610930692] [2022-11-25 18:30:01,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610930692] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:30:01,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:30:01,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:30:01,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814181357] [2022-11-25 18:30:01,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:30:01,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:30:01,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:30:01,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:30:01,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:30:01,231 INFO L87 Difference]: Start difference. First operand 1217 states and 1326 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:02,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:02,251 INFO L93 Difference]: Finished difference Result 1863 states and 2015 transitions. [2022-11-25 18:30:02,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:30:02,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 18:30:02,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:02,257 INFO L225 Difference]: With dead ends: 1863 [2022-11-25 18:30:02,258 INFO L226 Difference]: Without dead ends: 1863 [2022-11-25 18:30:02,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:30:02,259 INFO L413 NwaCegarLoop]: 1390 mSDtfsCounter, 754 mSDsluCounter, 2343 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 3733 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:02,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 3733 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 18:30:02,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2022-11-25 18:30:02,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1461. [2022-11-25 18:30:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 899 states have (on average 1.967741935483871) internal successors, (1769), 1455 states have internal predecessors, (1769), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 18:30:02,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 1785 transitions. [2022-11-25 18:30:02,291 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 1785 transitions. Word has length 11 [2022-11-25 18:30:02,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:02,291 INFO L495 AbstractCegarLoop]: Abstraction has 1461 states and 1785 transitions. [2022-11-25 18:30:02,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:02,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 1785 transitions. [2022-11-25 18:30:02,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 18:30:02,292 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:02,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:30:02,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-11-25 18:30:02,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:02,504 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr340REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:30:02,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:02,504 INFO L85 PathProgramCache]: Analyzing trace with hash 518331069, now seen corresponding path program 1 times [2022-11-25 18:30:02,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:30:02,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854189590] [2022-11-25 18:30:02,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:30:02,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:02,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:30:02,510 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:30:02,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 18:30:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:02,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 18:30:02,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:30:02,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:30:02,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:30:02,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:30:02,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854189590] [2022-11-25 18:30:02,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854189590] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:30:02,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:30:02,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:30:02,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658539888] [2022-11-25 18:30:02,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:30:02,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:30:02,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:30:02,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:30:02,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:30:02,700 INFO L87 Difference]: Start difference. First operand 1461 states and 1785 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:02,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:02,740 INFO L93 Difference]: Finished difference Result 1642 states and 1963 transitions. [2022-11-25 18:30:02,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:30:02,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2022-11-25 18:30:02,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:02,746 INFO L225 Difference]: With dead ends: 1642 [2022-11-25 18:30:02,750 INFO L226 Difference]: Without dead ends: 1642 [2022-11-25 18:30:02,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:30:02,751 INFO L413 NwaCegarLoop]: 1219 mSDtfsCounter, 602 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 2068 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:02,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 2068 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:30:02,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2022-11-25 18:30:02,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1401. [2022-11-25 18:30:02,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 863 states have (on average 1.9501738122827346) internal successors, (1683), 1395 states have internal predecessors, (1683), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 18:30:02,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1699 transitions. [2022-11-25 18:30:02,784 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1699 transitions. Word has length 13 [2022-11-25 18:30:02,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:02,785 INFO L495 AbstractCegarLoop]: Abstraction has 1401 states and 1699 transitions. [2022-11-25 18:30:02,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:02,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1699 transitions. [2022-11-25 18:30:02,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 18:30:02,787 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:02,787 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:30:02,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 18:30:02,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:02,999 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr364REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:30:02,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:02,999 INFO L85 PathProgramCache]: Analyzing trace with hash -100024073, now seen corresponding path program 1 times [2022-11-25 18:30:03,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:30:03,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65465129] [2022-11-25 18:30:03,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:30:03,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:03,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:30:03,001 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:30:03,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 18:30:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:03,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 18:30:03,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:30:03,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:30:03,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:30:03,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:30:03,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65465129] [2022-11-25 18:30:03,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [65465129] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:30:03,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:30:03,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:30:03,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027230071] [2022-11-25 18:30:03,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:30:03,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:30:03,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:30:03,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:30:03,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:30:03,197 INFO L87 Difference]: Start difference. First operand 1401 states and 1699 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:03,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:03,292 INFO L93 Difference]: Finished difference Result 1614 states and 1907 transitions. [2022-11-25 18:30:03,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:30:03,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2022-11-25 18:30:03,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:03,298 INFO L225 Difference]: With dead ends: 1614 [2022-11-25 18:30:03,298 INFO L226 Difference]: Without dead ends: 1614 [2022-11-25 18:30:03,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:30:03,299 INFO L413 NwaCegarLoop]: 1174 mSDtfsCounter, 583 mSDsluCounter, 2016 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 3190 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:03,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 3190 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:30:03,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2022-11-25 18:30:03,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1371. [2022-11-25 18:30:03,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 847 states have (on average 1.9185360094451003) internal successors, (1625), 1365 states have internal predecessors, (1625), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 18:30:03,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1641 transitions. [2022-11-25 18:30:03,333 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1641 transitions. Word has length 15 [2022-11-25 18:30:03,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:03,334 INFO L495 AbstractCegarLoop]: Abstraction has 1371 states and 1641 transitions. [2022-11-25 18:30:03,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:03,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1641 transitions. [2022-11-25 18:30:03,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 18:30:03,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:03,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:30:03,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 18:30:03,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:03,546 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr637ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:30:03,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:03,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1191550546, now seen corresponding path program 1 times [2022-11-25 18:30:03,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:30:03,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954640665] [2022-11-25 18:30:03,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:30:03,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:03,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:30:03,548 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:30:03,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 18:30:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:03,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 18:30:03,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:30:03,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:30:03,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:30:03,767 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:30:03,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2022-11-25 18:30:03,828 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:30:03,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2022-11-25 18:30:03,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:30:03,844 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:30:03,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:30:03,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954640665] [2022-11-25 18:30:03,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954640665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:30:03,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:30:03,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:30:03,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794089341] [2022-11-25 18:30:03,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:30:03,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:30:03,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:30:03,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:30:03,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:30:03,846 INFO L87 Difference]: Start difference. First operand 1371 states and 1641 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:05,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:05,643 INFO L93 Difference]: Finished difference Result 1825 states and 2165 transitions. [2022-11-25 18:30:05,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:30:05,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2022-11-25 18:30:05,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:05,649 INFO L225 Difference]: With dead ends: 1825 [2022-11-25 18:30:05,649 INFO L226 Difference]: Without dead ends: 1825 [2022-11-25 18:30:05,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:30:05,649 INFO L413 NwaCegarLoop]: 1141 mSDtfsCounter, 444 mSDsluCounter, 2160 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 3301 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:05,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 3301 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-25 18:30:05,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2022-11-25 18:30:05,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1370. [2022-11-25 18:30:05,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 846 states have (on average 1.9184397163120568) internal successors, (1623), 1364 states have internal predecessors, (1623), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 18:30:05,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1639 transitions. [2022-11-25 18:30:05,688 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1639 transitions. Word has length 16 [2022-11-25 18:30:05,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:05,688 INFO L495 AbstractCegarLoop]: Abstraction has 1370 states and 1639 transitions. [2022-11-25 18:30:05,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:05,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1639 transitions. [2022-11-25 18:30:05,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 18:30:05,689 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:05,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:30:05,706 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-11-25 18:30:05,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:05,901 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:30:05,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:05,901 INFO L85 PathProgramCache]: Analyzing trace with hash -344619170, now seen corresponding path program 1 times [2022-11-25 18:30:05,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:30:05,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067063023] [2022-11-25 18:30:05,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:30:05,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:05,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:30:05,905 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:30:05,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-25 18:30:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:06,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 18:30:06,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:30:06,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:30:06,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:30:06,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:30:06,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067063023] [2022-11-25 18:30:06,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2067063023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:30:06,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:30:06,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:30:06,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376052546] [2022-11-25 18:30:06,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:30:06,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:30:06,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:30:06,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:30:06,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:30:06,140 INFO L87 Difference]: Start difference. First operand 1370 states and 1639 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:06,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:06,174 INFO L93 Difference]: Finished difference Result 1310 states and 1553 transitions. [2022-11-25 18:30:06,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:30:06,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2022-11-25 18:30:06,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:06,179 INFO L225 Difference]: With dead ends: 1310 [2022-11-25 18:30:06,179 INFO L226 Difference]: Without dead ends: 1310 [2022-11-25 18:30:06,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:30:06,180 INFO L413 NwaCegarLoop]: 1135 mSDtfsCounter, 1104 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:06,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 1167 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:30:06,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2022-11-25 18:30:06,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1310. [2022-11-25 18:30:06,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 810 states have (on average 1.8975308641975308) internal successors, (1537), 1304 states have internal predecessors, (1537), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 18:30:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1553 transitions. [2022-11-25 18:30:06,230 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1553 transitions. Word has length 18 [2022-11-25 18:30:06,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:06,230 INFO L495 AbstractCegarLoop]: Abstraction has 1310 states and 1553 transitions. [2022-11-25 18:30:06,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:06,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1553 transitions. [2022-11-25 18:30:06,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 18:30:06,233 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:06,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:30:06,245 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-11-25 18:30:06,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:06,445 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:30:06,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:06,445 INFO L85 PathProgramCache]: Analyzing trace with hash -466544200, now seen corresponding path program 1 times [2022-11-25 18:30:06,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:30:06,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973682132] [2022-11-25 18:30:06,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:30:06,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:06,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:30:06,447 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:30:06,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-25 18:30:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:06,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 18:30:06,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:30:06,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:30:06,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:30:06,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:30:06,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973682132] [2022-11-25 18:30:06,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973682132] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:30:06,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:30:06,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:30:06,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160388089] [2022-11-25 18:30:06,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:30:06,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:30:06,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:30:06,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:30:06,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:30:06,672 INFO L87 Difference]: Start difference. First operand 1310 states and 1553 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:06,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:06,759 INFO L93 Difference]: Finished difference Result 1282 states and 1497 transitions. [2022-11-25 18:30:06,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:30:06,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2022-11-25 18:30:06,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:06,763 INFO L225 Difference]: With dead ends: 1282 [2022-11-25 18:30:06,764 INFO L226 Difference]: Without dead ends: 1282 [2022-11-25 18:30:06,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:30:06,765 INFO L413 NwaCegarLoop]: 1090 mSDtfsCounter, 1085 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:06,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 2205 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:30:06,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2022-11-25 18:30:06,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1280. [2022-11-25 18:30:06,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 794 states have (on average 1.86272040302267) internal successors, (1479), 1274 states have internal predecessors, (1479), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 18:30:06,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1495 transitions. [2022-11-25 18:30:06,786 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1495 transitions. Word has length 20 [2022-11-25 18:30:06,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:06,786 INFO L495 AbstractCegarLoop]: Abstraction has 1280 states and 1495 transitions. [2022-11-25 18:30:06,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:06,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1495 transitions. [2022-11-25 18:30:06,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-25 18:30:06,788 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:06,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:30:06,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-25 18:30:06,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:07,000 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:30:07,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:07,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531686, now seen corresponding path program 1 times [2022-11-25 18:30:07,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:30:07,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136804764] [2022-11-25 18:30:07,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:30:07,001 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:07,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:30:07,002 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:30:07,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-25 18:30:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:07,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 18:30:07,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:30:07,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 18:30:07,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:30:07,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:30:07,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:30:07,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136804764] [2022-11-25 18:30:07,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136804764] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:30:07,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:30:07,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:30:07,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364825032] [2022-11-25 18:30:07,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:30:07,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:30:07,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:30:07,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:30:07,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:30:07,340 INFO L87 Difference]: Start difference. First operand 1280 states and 1495 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:10,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:10,458 INFO L93 Difference]: Finished difference Result 1879 states and 2228 transitions. [2022-11-25 18:30:10,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:30:10,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2022-11-25 18:30:10,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:10,464 INFO L225 Difference]: With dead ends: 1879 [2022-11-25 18:30:10,464 INFO L226 Difference]: Without dead ends: 1879 [2022-11-25 18:30:10,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:30:10,465 INFO L413 NwaCegarLoop]: 601 mSDtfsCounter, 1764 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1769 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:10,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1769 Valid, 1269 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-25 18:30:10,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2022-11-25 18:30:10,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1276. [2022-11-25 18:30:10,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 794 states have (on average 1.8526448362720402) internal successors, (1471), 1270 states have internal predecessors, (1471), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 18:30:10,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1487 transitions. [2022-11-25 18:30:10,491 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1487 transitions. Word has length 34 [2022-11-25 18:30:10,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:10,491 INFO L495 AbstractCegarLoop]: Abstraction has 1276 states and 1487 transitions. [2022-11-25 18:30:10,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:10,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1487 transitions. [2022-11-25 18:30:10,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-25 18:30:10,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:10,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:30:10,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-25 18:30:10,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:10,705 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:30:10,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:10,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531687, now seen corresponding path program 1 times [2022-11-25 18:30:10,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:30:10,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441296789] [2022-11-25 18:30:10,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:30:10,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:10,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:30:10,707 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:30:10,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-25 18:30:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:10,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 18:30:10,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:30:10,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:30:11,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:30:11,153 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:30:11,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:30:11,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [441296789] [2022-11-25 18:30:11,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [441296789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:30:11,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:30:11,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:30:11,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017846148] [2022-11-25 18:30:11,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:30:11,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:30:11,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:30:11,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:30:11,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:30:11,155 INFO L87 Difference]: Start difference. First operand 1276 states and 1487 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:15,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:15,951 INFO L93 Difference]: Finished difference Result 2007 states and 2335 transitions. [2022-11-25 18:30:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:30:15,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2022-11-25 18:30:15,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:15,955 INFO L225 Difference]: With dead ends: 2007 [2022-11-25 18:30:15,955 INFO L226 Difference]: Without dead ends: 2007 [2022-11-25 18:30:15,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:30:15,956 INFO L413 NwaCegarLoop]: 1436 mSDtfsCounter, 1230 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:15,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 2576 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-11-25 18:30:15,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2022-11-25 18:30:15,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 1272. [2022-11-25 18:30:16,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 794 states have (on average 1.8425692695214106) internal successors, (1463), 1266 states have internal predecessors, (1463), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 18:30:16,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1479 transitions. [2022-11-25 18:30:16,003 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1479 transitions. Word has length 34 [2022-11-25 18:30:16,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:16,003 INFO L495 AbstractCegarLoop]: Abstraction has 1272 states and 1479 transitions. [2022-11-25 18:30:16,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:16,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1479 transitions. [2022-11-25 18:30:16,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-25 18:30:16,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:16,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:30:16,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-25 18:30:16,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:16,222 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:30:16,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:16,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1509555205, now seen corresponding path program 1 times [2022-11-25 18:30:16,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:30:16,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003744391] [2022-11-25 18:30:16,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:30:16,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:16,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:30:16,225 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:30:16,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-25 18:30:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:16,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 18:30:16,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:30:16,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:30:16,594 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:30:16,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:30:16,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003744391] [2022-11-25 18:30:16,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003744391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:30:16,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:30:16,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:30:16,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135769589] [2022-11-25 18:30:16,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:30:16,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:30:16,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:30:16,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:30:16,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:30:16,597 INFO L87 Difference]: Start difference. First operand 1272 states and 1479 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:16,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:16,668 INFO L93 Difference]: Finished difference Result 1260 states and 1459 transitions. [2022-11-25 18:30:16,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:30:16,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2022-11-25 18:30:16,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:16,674 INFO L225 Difference]: With dead ends: 1260 [2022-11-25 18:30:16,674 INFO L226 Difference]: Without dead ends: 1260 [2022-11-25 18:30:16,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:30:16,675 INFO L413 NwaCegarLoop]: 1084 mSDtfsCounter, 1054 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 2183 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:16,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 2183 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:30:16,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2022-11-25 18:30:16,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1260. [2022-11-25 18:30:16,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 782 states have (on average 1.8452685421994885) internal successors, (1443), 1254 states have internal predecessors, (1443), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 18:30:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1459 transitions. [2022-11-25 18:30:16,695 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1459 transitions. Word has length 52 [2022-11-25 18:30:16,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:16,696 INFO L495 AbstractCegarLoop]: Abstraction has 1260 states and 1459 transitions. [2022-11-25 18:30:16,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:16,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1459 transitions. [2022-11-25 18:30:16,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-25 18:30:16,697 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:16,697 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:30:16,710 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-25 18:30:16,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:16,911 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:30:16,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:16,912 INFO L85 PathProgramCache]: Analyzing trace with hash -881686959, now seen corresponding path program 1 times [2022-11-25 18:30:16,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:30:16,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313920487] [2022-11-25 18:30:16,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:30:16,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-25 18:30:16,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:30:16,914 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:30:16,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-25 18:30:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:17,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 18:30:17,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:30:17,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 18:30:17,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:30:17,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:30:17,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 18:30:17,979 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:30:17,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 18:30:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:30:17,996 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:30:17,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:30:17,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313920487] [2022-11-25 18:30:17,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313920487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:30:17,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:30:17,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:30:17,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940313817] [2022-11-25 18:30:17,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:30:17,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:30:17,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:30:17,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:30:17,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:30:17,998 INFO L87 Difference]: Start difference. First operand 1260 states and 1459 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:21,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:21,297 INFO L93 Difference]: Finished difference Result 1608 states and 1924 transitions. [2022-11-25 18:30:21,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:30:21,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2022-11-25 18:30:21,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:21,304 INFO L225 Difference]: With dead ends: 1608 [2022-11-25 18:30:21,304 INFO L226 Difference]: Without dead ends: 1608 [2022-11-25 18:30:21,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:30:21,305 INFO L413 NwaCegarLoop]: 525 mSDtfsCounter, 1754 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1757 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:21,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1757 Valid, 791 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-25 18:30:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2022-11-25 18:30:21,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1190. [2022-11-25 18:30:21,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 750 states have (on average 1.7853333333333334) internal successors, (1339), 1184 states have internal predecessors, (1339), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 18:30:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1355 transitions. [2022-11-25 18:30:21,325 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1355 transitions. Word has length 60 [2022-11-25 18:30:21,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:21,326 INFO L495 AbstractCegarLoop]: Abstraction has 1190 states and 1355 transitions. [2022-11-25 18:30:21,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:21,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1355 transitions. [2022-11-25 18:30:21,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-25 18:30:21,327 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:21,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:30:21,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-25 18:30:21,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:21,542 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:30:21,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:21,542 INFO L85 PathProgramCache]: Analyzing trace with hash -855470841, now seen corresponding path program 1 times [2022-11-25 18:30:21,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:30:21,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268551389] [2022-11-25 18:30:21,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:30:21,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:21,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:30:21,544 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:30:21,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 18:30:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:21,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 18:30:21,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:30:21,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 18:30:21,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:30:21,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-25 18:30:21,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:30:21,953 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:30:21,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:30:21,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268551389] [2022-11-25 18:30:21,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268551389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:30:21,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:30:21,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:30:21,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004277078] [2022-11-25 18:30:21,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:30:21,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:30:21,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:30:21,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:30:21,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:30:21,956 INFO L87 Difference]: Start difference. First operand 1190 states and 1355 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:25,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:25,163 INFO L93 Difference]: Finished difference Result 1189 states and 1354 transitions. [2022-11-25 18:30:25,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:30:25,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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 65 [2022-11-25 18:30:25,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:25,172 INFO L225 Difference]: With dead ends: 1189 [2022-11-25 18:30:25,172 INFO L226 Difference]: Without dead ends: 1189 [2022-11-25 18:30:25,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:30:25,172 INFO L413 NwaCegarLoop]: 1044 mSDtfsCounter, 4 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2676 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:25,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2676 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1505 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-25 18:30:25,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2022-11-25 18:30:25,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1189. [2022-11-25 18:30:25,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 750 states have (on average 1.784) internal successors, (1338), 1183 states have internal predecessors, (1338), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 18:30:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1354 transitions. [2022-11-25 18:30:25,189 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1354 transitions. Word has length 65 [2022-11-25 18:30:25,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:25,189 INFO L495 AbstractCegarLoop]: Abstraction has 1189 states and 1354 transitions. [2022-11-25 18:30:25,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:25,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1354 transitions. [2022-11-25 18:30:25,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-25 18:30:25,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:25,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:30:25,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-11-25 18:30:25,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:25,407 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:30:25,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:25,407 INFO L85 PathProgramCache]: Analyzing trace with hash -855470840, now seen corresponding path program 1 times [2022-11-25 18:30:25,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:30:25,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96575152] [2022-11-25 18:30:25,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:30:25,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:25,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:30:25,408 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:30:25,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-25 18:30:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:25,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 18:30:25,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:30:25,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:30:25,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:30:25,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:30:25,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-25 18:30:25,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 18:30:25,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:30:25,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:30:25,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:30:25,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96575152] [2022-11-25 18:30:25,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [96575152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:30:25,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:30:25,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:30:25,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042234223] [2022-11-25 18:30:25,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:30:25,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:30:25,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:30:25,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:30:25,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:30:25,908 INFO L87 Difference]: Start difference. First operand 1189 states and 1354 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:30,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:30,051 INFO L93 Difference]: Finished difference Result 1188 states and 1353 transitions. [2022-11-25 18:30:30,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:30:30,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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 65 [2022-11-25 18:30:30,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:30,055 INFO L225 Difference]: With dead ends: 1188 [2022-11-25 18:30:30,055 INFO L226 Difference]: Without dead ends: 1188 [2022-11-25 18:30:30,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:30:30,056 INFO L413 NwaCegarLoop]: 1044 mSDtfsCounter, 2 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2729 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:30,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2729 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-11-25 18:30:30,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2022-11-25 18:30:30,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1188. [2022-11-25 18:30:30,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 749 states have (on average 1.7850467289719627) internal successors, (1337), 1182 states have internal predecessors, (1337), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 18:30:30,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1353 transitions. [2022-11-25 18:30:30,072 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1353 transitions. Word has length 65 [2022-11-25 18:30:30,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:30,073 INFO L495 AbstractCegarLoop]: Abstraction has 1188 states and 1353 transitions. [2022-11-25 18:30:30,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:30:30,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1353 transitions. [2022-11-25 18:30:30,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-25 18:30:30,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:30,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:30:30,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-25 18:30:30,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:30,288 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:30:30,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:30,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1808778577, now seen corresponding path program 1 times [2022-11-25 18:30:30,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:30:30,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376369601] [2022-11-25 18:30:30,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:30:30,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:30,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:30:30,290 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:30:30,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-25 18:30:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:30,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 18:30:30,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:30:30,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:30:30,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:30:30,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:30:30,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376369601] [2022-11-25 18:30:30,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1376369601] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:30:30,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:30:30,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:30:30,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063750108] [2022-11-25 18:30:30,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:30:30,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:30:30,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:30:30,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:30:30,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:30:30,707 INFO L87 Difference]: Start difference. First operand 1188 states and 1353 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:30:30,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:30,761 INFO L93 Difference]: Finished difference Result 1191 states and 1357 transitions. [2022-11-25 18:30:30,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:30:30,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-11-25 18:30:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:30,771 INFO L225 Difference]: With dead ends: 1191 [2022-11-25 18:30:30,771 INFO L226 Difference]: Without dead ends: 1191 [2022-11-25 18:30:30,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:30:30,772 INFO L413 NwaCegarLoop]: 1044 mSDtfsCounter, 2 mSDsluCounter, 2083 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3127 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:30,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3127 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:30:30,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2022-11-25 18:30:30,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2022-11-25 18:30:30,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 751 states have (on average 1.7842876165113182) internal successors, (1340), 1185 states have internal predecessors, (1340), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-25 18:30:30,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1357 transitions. [2022-11-25 18:30:30,792 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1357 transitions. Word has length 73 [2022-11-25 18:30:30,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:30,792 INFO L495 AbstractCegarLoop]: Abstraction has 1191 states and 1357 transitions. [2022-11-25 18:30:30,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:30:30,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1357 transitions. [2022-11-25 18:30:30,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-25 18:30:30,794 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:30,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:30:30,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-25 18:30:31,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:31,009 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:30:31,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:31,009 INFO L85 PathProgramCache]: Analyzing trace with hash 483111072, now seen corresponding path program 1 times [2022-11-25 18:30:31,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:30:31,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666621682] [2022-11-25 18:30:31,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:30:31,010 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:31,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:30:31,011 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:30:31,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 18:30:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:31,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 18:30:31,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:30:31,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:30:31,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:30:31,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:30:31,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:30:31,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666621682] [2022-11-25 18:30:31,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666621682] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:30:31,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:30:31,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-11-25 18:30:31,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903823097] [2022-11-25 18:30:31,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:30:31,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:30:31,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:30:31,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:30:31,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:30:31,495 INFO L87 Difference]: Start difference. First operand 1191 states and 1357 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:30:31,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:31,727 INFO L93 Difference]: Finished difference Result 1203 states and 1374 transitions. [2022-11-25 18:30:31,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:30:31,728 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2022-11-25 18:30:31,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:31,732 INFO L225 Difference]: With dead ends: 1203 [2022-11-25 18:30:31,732 INFO L226 Difference]: Without dead ends: 1203 [2022-11-25 18:30:31,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:30:31,733 INFO L413 NwaCegarLoop]: 1045 mSDtfsCounter, 12 mSDsluCounter, 3123 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4168 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:31,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4168 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:30:31,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2022-11-25 18:30:31,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1201. [2022-11-25 18:30:31,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 760 states have (on average 1.7828947368421053) internal successors, (1355), 1194 states have internal predecessors, (1355), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-25 18:30:31,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1372 transitions. [2022-11-25 18:30:31,753 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1372 transitions. Word has length 74 [2022-11-25 18:30:31,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:31,753 INFO L495 AbstractCegarLoop]: Abstraction has 1201 states and 1372 transitions. [2022-11-25 18:30:31,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:30:31,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1372 transitions. [2022-11-25 18:30:31,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-25 18:30:31,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:31,755 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:30:31,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 18:30:31,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:31,970 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:30:31,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:31,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1705595153, now seen corresponding path program 2 times [2022-11-25 18:30:31,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:30:31,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475347572] [2022-11-25 18:30:31,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:30:31,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:31,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:30:31,972 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:30:31,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-25 18:30:32,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:30:32,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:30:32,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 18:30:32,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:30:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:30:32,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:30:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:30:32,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:30:32,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475347572] [2022-11-25 18:30:32,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475347572] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:30:32,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:30:32,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-11-25 18:30:32,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774044338] [2022-11-25 18:30:32,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:30:32,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 18:30:32,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:30:32,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 18:30:32,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:30:32,823 INFO L87 Difference]: Start difference. First operand 1201 states and 1372 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:30:33,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:33,564 INFO L93 Difference]: Finished difference Result 1222 states and 1400 transitions. [2022-11-25 18:30:33,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:30:33,565 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 77 [2022-11-25 18:30:33,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:33,568 INFO L225 Difference]: With dead ends: 1222 [2022-11-25 18:30:33,569 INFO L226 Difference]: Without dead ends: 1218 [2022-11-25 18:30:33,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-11-25 18:30:33,570 INFO L413 NwaCegarLoop]: 1048 mSDtfsCounter, 22 mSDsluCounter, 5223 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 6271 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:33,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 6271 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:30:33,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2022-11-25 18:30:33,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1210. [2022-11-25 18:30:33,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 769 states have (on average 1.777633289986996) internal successors, (1367), 1203 states have internal predecessors, (1367), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-25 18:30:33,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1384 transitions. [2022-11-25 18:30:33,590 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1384 transitions. Word has length 77 [2022-11-25 18:30:33,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:33,591 INFO L495 AbstractCegarLoop]: Abstraction has 1210 states and 1384 transitions. [2022-11-25 18:30:33,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:30:33,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1384 transitions. [2022-11-25 18:30:33,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-25 18:30:33,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:33,592 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:30:33,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-25 18:30:33,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:33,806 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:30:33,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:33,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1677221553, now seen corresponding path program 3 times [2022-11-25 18:30:33,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:30:33,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187584391] [2022-11-25 18:30:33,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:30:33,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:33,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:30:33,808 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:30:33,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 18:30:34,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-25 18:30:34,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:30:34,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 18:30:34,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:30:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:30:34,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:30:35,802 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:30:35,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:30:35,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187584391] [2022-11-25 18:30:35,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187584391] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:30:35,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:30:35,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-11-25 18:30:35,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875795659] [2022-11-25 18:30:35,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:30:35,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 18:30:35,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:30:35,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 18:30:35,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-11-25 18:30:35,805 INFO L87 Difference]: Start difference. First operand 1210 states and 1384 transitions. Second operand has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:30:40,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:40,018 INFO L93 Difference]: Finished difference Result 1252 states and 1446 transitions. [2022-11-25 18:30:40,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:30:40,023 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83 [2022-11-25 18:30:40,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:40,032 INFO L225 Difference]: With dead ends: 1252 [2022-11-25 18:30:40,032 INFO L226 Difference]: Without dead ends: 1246 [2022-11-25 18:30:40,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-11-25 18:30:40,034 INFO L413 NwaCegarLoop]: 1053 mSDtfsCounter, 47 mSDsluCounter, 13616 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 14669 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:40,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 14669 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-25 18:30:40,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2022-11-25 18:30:40,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1228. [2022-11-25 18:30:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 787 states have (on average 1.7662007623888183) internal successors, (1390), 1221 states have internal predecessors, (1390), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-25 18:30:40,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1407 transitions. [2022-11-25 18:30:40,054 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1407 transitions. Word has length 83 [2022-11-25 18:30:40,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:40,054 INFO L495 AbstractCegarLoop]: Abstraction has 1228 states and 1407 transitions. [2022-11-25 18:30:40,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:30:40,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1407 transitions. [2022-11-25 18:30:40,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-25 18:30:40,056 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:40,056 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:30:40,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 18:30:40,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:40,277 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:30:40,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:40,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1527361039, now seen corresponding path program 4 times [2022-11-25 18:30:40,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:30:40,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949281942] [2022-11-25 18:30:40,278 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 18:30:40,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:40,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:30:40,279 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:30:40,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 18:30:40,707 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 18:30:40,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:30:40,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-25 18:30:40,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:30:41,187 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:30:41,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:30:43,583 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:30:43,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:30:43,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949281942] [2022-11-25 18:30:43,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949281942] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:30:43,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:30:43,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-11-25 18:30:43,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574848528] [2022-11-25 18:30:43,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:30:43,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-25 18:30:43,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:30:43,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-25 18:30:43,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-11-25 18:30:43,587 INFO L87 Difference]: Start difference. First operand 1228 states and 1407 transitions. Second operand has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:30:55,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:55,890 INFO L93 Difference]: Finished difference Result 1308 states and 1519 transitions. [2022-11-25 18:30:55,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-25 18:30:55,892 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2022-11-25 18:30:55,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:55,895 INFO L225 Difference]: With dead ends: 1308 [2022-11-25 18:30:55,895 INFO L226 Difference]: Without dead ends: 1304 [2022-11-25 18:30:55,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-11-25 18:30:55,898 INFO L413 NwaCegarLoop]: 1065 mSDtfsCounter, 84 mSDsluCounter, 25446 mSDsCounter, 0 mSdLazyCounter, 2431 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 26511 SdHoareTripleChecker+Invalid, 2499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 2431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:55,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 26511 Invalid, 2499 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [68 Valid, 2431 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-25 18:30:55,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2022-11-25 18:30:55,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1262. [2022-11-25 18:30:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 821 states have (on average 1.7490864799025578) internal successors, (1436), 1255 states have internal predecessors, (1436), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-25 18:30:55,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1453 transitions. [2022-11-25 18:30:55,919 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1453 transitions. Word has length 95 [2022-11-25 18:30:55,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:55,919 INFO L495 AbstractCegarLoop]: Abstraction has 1262 states and 1453 transitions. [2022-11-25 18:30:55,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:30:55,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1453 transitions. [2022-11-25 18:30:55,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-25 18:30:55,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:55,921 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:30:55,941 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-11-25 18:30:56,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:56,137 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:30:56,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:56,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1550558865, now seen corresponding path program 5 times [2022-11-25 18:30:56,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:30:56,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331098726] [2022-11-25 18:30:56,138 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 18:30:56,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:30:56,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:30:56,139 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:30:56,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-25 18:30:57,738 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-25 18:30:57,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:30:57,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 111 conjunts are in the unsatisfiable core [2022-11-25 18:30:57,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:30:57,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 18:30:58,118 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:30:58,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 18:30:58,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:30:58,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:30:58,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:30:58,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-11-25 18:30:58,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 18:30:58,474 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1944) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:30:58,490 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1947) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1946)))) is different from true [2022-11-25 18:30:58,531 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1949))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:30:58,556 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:30:58,623 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:30:58,680 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:30:58,774 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:30:58,790 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966)))) is different from true [2022-11-25 18:30:58,809 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1968))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1969) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:30:58,824 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970)))) is different from true [2022-11-25 18:30:58,845 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1973) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1972) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:30:58,866 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1974))) (exists ((v_ArrVal_1975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1975))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:30:58,880 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977)))) is different from true [2022-11-25 18:30:58,893 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1979) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1978 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1978)))) is different from true [2022-11-25 18:30:58,907 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:30:58,991 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:30:59,037 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1991))) (exists ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1990))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:30:59,080 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:30:59,125 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1999))) (exists ((v_ArrVal_1998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1998))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:30:59,137 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2001) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2000)))) is different from true [2022-11-25 18:30:59,149 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2002))) (exists ((v_ArrVal_2003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2003) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:30:59,164 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2005))) (exists ((v_ArrVal_2004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2004))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:30:59,176 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2006))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2007 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2007) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:30:59,235 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011))) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:30:59,248 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2012))) (exists ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2013))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:30:59,262 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2015))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2014)))) is different from true [2022-11-25 18:30:59,276 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2017))) (exists ((v_ArrVal_2016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2016))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:30:59,289 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2018))) (exists ((v_ArrVal_2019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2019))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:30:59,341 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2023))) (exists ((v_ArrVal_2022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2022) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:30:59,491 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:30:59,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 18:30:59,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 18:30:59,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:30:59,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-25 18:30:59,591 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 105 trivial. 870 not checked. [2022-11-25 18:30:59,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:31:00,683 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2121 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2121) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2121 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2121) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-25 18:31:00,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:31:00,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331098726] [2022-11-25 18:31:00,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331098726] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:31:00,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1367664288] [2022-11-25 18:31:00,693 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 18:31:00,693 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 18:31:00,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 18:31:00,698 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 18:31:00,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-11-25 18:32:11,034 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-25 18:32:11,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:32:11,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-25 18:32:11,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:32:11,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 18:32:11,410 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:32:11,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 18:32:11,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:32:11,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:32:11,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:32:11,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 18:32:11,702 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-25 18:32:11,765 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:32:11,779 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:32:11,793 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:32:11,808 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:32:11,823 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:32:11,870 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510)))) is different from true [2022-11-25 18:32:11,884 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:32:11,933 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:32:11,947 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:32:11,962 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:32:11,976 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:32:12,167 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533)))) is different from true [2022-11-25 18:32:12,180 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:32:12,194 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538))) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:32:12,207 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:32:12,334 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:32:12,347 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:32:12,512 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:32:12,593 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2565))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566)))) is different from true [2022-11-25 18:32:12,606 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_2568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2568) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:32:12,777 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2579 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2579))) (exists ((v_ArrVal_2580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2580))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:32:12,829 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:32:12,879 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:32:12,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 18:32:12,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 18:32:12,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 18:32:12,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 18:32:12,984 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 737 not checked. [2022-11-25 18:32:12,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:32:13,902 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2675 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2676 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2675) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2676 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-11-25 18:32:13,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1367664288] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:32:13,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:32:13,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 30] total 63 [2022-11-25 18:32:13,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091660722] [2022-11-25 18:32:13,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:32:13,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-25 18:32:13,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:32:13,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-25 18:32:13,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=212, Unknown=65, NotChecked=4134, Total=4556 [2022-11-25 18:32:13,914 INFO L87 Difference]: Start difference. First operand 1262 states and 1453 transitions. Second operand has 64 states, 61 states have (on average 3.377049180327869) internal successors, (206), 64 states have internal predecessors, (206), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:32:15,170 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:32:15,187 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1991))) (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499))) (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011))) (exists ((v_ArrVal_2565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2565))) (exists ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2023))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1990))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1999))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994))) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_ArrVal_2579 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2579))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500))) (exists ((v_ArrVal_2580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2580))) (exists ((v_ArrVal_1998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1998))) (exists ((v_ArrVal_2022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2022) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1944) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566)))) is different from true [2022-11-25 18:32:15,204 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2012))) (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1947) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1991))) (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011))) (exists ((v_ArrVal_2565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2565))) (exists ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2023))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1990))) (exists ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2013))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2001) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1999))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994))) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502))) (exists ((v_ArrVal_2579 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2579))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_2580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2580))) (exists ((v_ArrVal_2568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2568) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1998))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2022) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1946))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1944) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966))) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566))) (exists ((v_ArrVal_2000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2000)))) is different from true [2022-11-25 18:32:15,208 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-11-25 18:32:15,239 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2012))) (exists ((v_ArrVal_1948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1947) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1991))) (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011))) (exists ((v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2015))) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_ArrVal_2565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2565))) (exists ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2023))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1968))) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1990))) (exists ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2013))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2002))) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2001) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538))) (exists ((v_ArrVal_1999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1999))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994))) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_ArrVal_2003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_2579 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2579))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_2580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2580))) (exists ((v_ArrVal_2568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2568) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1998))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2022) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1949))) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1946))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1944) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966))) (exists ((v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2014))) (exists ((v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1969) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566))) (exists ((v_ArrVal_2000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2000)))) is different from true [2022-11-25 18:32:15,257 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2012))) (exists ((v_ArrVal_1948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1947) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1991))) (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011))) (exists ((v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2015))) (exists ((v_ArrVal_2565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2565))) (exists ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2023))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1968))) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1990))) (exists ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2013))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2002))) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2001) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538))) (exists ((v_ArrVal_1999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1999))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_2005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2005))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_2004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2004))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2017))) (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994))) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_ArrVal_2003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_2579 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2579))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_2580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2580))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2568) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1998))) (exists ((v_ArrVal_2016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2016))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2022) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1949))) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1946))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1944) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966))) (exists ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970))) (exists ((v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2014))) (exists ((v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1969) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566))) (exists ((v_ArrVal_2000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2000)))) is different from true [2022-11-25 18:32:15,275 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2012))) (exists ((v_ArrVal_1948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1947) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1991))) (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011))) (exists ((v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1973) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2015))) (exists ((v_ArrVal_2565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2565))) (exists ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2023))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1968))) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1990))) (exists ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2013))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2002))) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2001) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538))) (exists ((v_ArrVal_1999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1999))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2018))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_2005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2005))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_2004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2004))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2006))) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2017))) (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994))) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_ArrVal_2003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_2579 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2579))) (exists ((v_ArrVal_2019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2019))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_2580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2580))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2568) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1998))) (exists ((v_ArrVal_2016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2016))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2022) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1949))) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1946))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1944) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966))) (exists ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970))) (exists ((v_ArrVal_2007 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2007) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2014))) (exists ((v_ArrVal_1972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1972) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1969) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566))) (exists ((v_ArrVal_2000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2000)))) is different from true [2022-11-25 18:32:15,293 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2012))) (exists ((v_ArrVal_1948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1947) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1991))) (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011))) (exists ((v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1973) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2015))) (exists ((v_ArrVal_2565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2565))) (exists ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2023))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1968))) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1990))) (exists ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2013))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2002))) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2001) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538))) (exists ((v_ArrVal_1999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1999))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2018))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_2005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2005))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_2004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2004))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2006))) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1974))) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2017))) (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994))) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_ArrVal_2003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_2579 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2579))) (exists ((v_ArrVal_2019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2019))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_2580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2580))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2568) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1998))) (exists ((v_ArrVal_1975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1975))) (exists ((v_ArrVal_2016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2016))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2022) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1949))) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1946))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1944) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966))) (exists ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970))) (exists ((v_ArrVal_2007 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2007) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2014))) (exists ((v_ArrVal_1972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1972) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1969) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566))) (exists ((v_ArrVal_2000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2000)))) is different from true [2022-11-25 18:32:15,311 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2012))) (exists ((v_ArrVal_1948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1947) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1991))) (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011))) (exists ((v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1973) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2015))) (exists ((v_ArrVal_2565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2565))) (exists ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2023))) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1968))) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1990))) (exists ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2013))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2002))) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2001) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538))) (exists ((v_ArrVal_1999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1999))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2018))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_2005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2005))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_2004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2004))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2006))) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1974))) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2017))) (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994))) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_ArrVal_2003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_2579 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2579))) (exists ((v_ArrVal_2019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2019))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_2580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2580))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2568) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1998))) (exists ((v_ArrVal_1975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1975))) (exists ((v_ArrVal_2016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2016))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2022) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1949))) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1946))) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1944) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966))) (exists ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970))) (exists ((v_ArrVal_2007 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2007) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2014))) (exists ((v_ArrVal_1972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1972) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1969) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566))) (exists ((v_ArrVal_2000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2000)))) is different from true [2022-11-25 18:32:15,329 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2012))) (exists ((v_ArrVal_1948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1947) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1991))) (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011))) (exists ((v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1973) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2015))) (exists ((v_ArrVal_2565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2565))) (exists ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2023))) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1968))) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1990))) (exists ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2013))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2002))) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2001) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538))) (exists ((v_ArrVal_1999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1999))) (exists ((v_ArrVal_1979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1979) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2018))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_2005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2005))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_2004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2004))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2006))) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1974))) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2017))) (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994))) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_ArrVal_2003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_2579 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2579))) (exists ((v_ArrVal_2019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2019))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_2580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2580))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2568) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1998))) (exists ((v_ArrVal_1975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1975))) (exists ((v_ArrVal_2016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2016))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2022) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1949))) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1946))) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1944) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966))) (exists ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970))) (exists ((v_ArrVal_2007 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2007) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2014))) (exists ((v_ArrVal_1972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1972) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1969) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566))) (exists ((v_ArrVal_1978 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1978))) (exists ((v_ArrVal_2000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2000)))) is different from true [2022-11-25 18:32:15,348 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2012))) (exists ((v_ArrVal_1948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1947 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1947) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1991))) (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011))) (exists ((v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1973) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2015))) (exists ((v_ArrVal_2565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2565))) (exists ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2023))) (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1968))) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1990))) (exists ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2013))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2002))) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2001) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538))) (exists ((v_ArrVal_1999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1999))) (exists ((v_ArrVal_1979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1979) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2018))) (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_2005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2005))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_2004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2004))) (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2006))) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1974))) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2017))) (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994))) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010))) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_ArrVal_2003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2003) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_ArrVal_2579 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2579))) (exists ((v_ArrVal_2019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2019))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_2580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2580))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2568) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1998))) (exists ((v_ArrVal_1975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1975))) (exists ((v_ArrVal_2016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2016))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_2022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2022) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1949))) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1946))) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1944) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966))) (exists ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970))) (exists ((v_ArrVal_2007 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2007) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2014))) (exists ((v_ArrVal_1972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1972) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1969) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566))) (exists ((v_ArrVal_1978 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1978))) (exists ((v_ArrVal_2000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2000)))) is different from true [2022-11-25 18:32:28,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:32:28,551 INFO L93 Difference]: Finished difference Result 1653 states and 1958 transitions. [2022-11-25 18:32:28,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:32:28,553 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 61 states have (on average 3.377049180327869) internal successors, (206), 64 states have internal predecessors, (206), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 117 [2022-11-25 18:32:28,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:32:28,557 INFO L225 Difference]: With dead ends: 1653 [2022-11-25 18:32:28,557 INFO L226 Difference]: Without dead ends: 1647 [2022-11-25 18:32:28,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 135 SyntacticMatches, 39 SemanticMatches, 82 ConstructedPredicates, 64 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=211, Invalid=344, Unknown=81, NotChecked=6336, Total=6972 [2022-11-25 18:32:28,560 INFO L413 NwaCegarLoop]: 677 mSDtfsCounter, 734 mSDsluCounter, 3252 mSDsCounter, 0 mSdLazyCounter, 5416 mSolverCounterSat, 9 mSolverCounterUnsat, 515 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 3929 SdHoareTripleChecker+Invalid, 76628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 5416 IncrementalHoareTripleChecker+Invalid, 515 IncrementalHoareTripleChecker+Unknown, 70688 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:32:28,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 3929 Invalid, 76628 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9 Valid, 5416 Invalid, 515 Unknown, 70688 Unchecked, 13.9s Time] [2022-11-25 18:32:28,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2022-11-25 18:32:28,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1261. [2022-11-25 18:32:28,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 821 states have (on average 1.7429963459196103) internal successors, (1431), 1254 states have internal predecessors, (1431), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-25 18:32:28,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1448 transitions. [2022-11-25 18:32:28,580 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1448 transitions. Word has length 117 [2022-11-25 18:32:28,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:32:28,580 INFO L495 AbstractCegarLoop]: Abstraction has 1261 states and 1448 transitions. [2022-11-25 18:32:28,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 61 states have (on average 3.377049180327869) internal successors, (206), 64 states have internal predecessors, (206), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:32:28,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1448 transitions. [2022-11-25 18:32:28,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-25 18:32:28,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:32:28,582 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:32:28,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-11-25 18:32:28,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2022-11-25 18:32:29,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt [2022-11-25 18:32:29,007 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:32:29,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:32:29,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1550558866, now seen corresponding path program 1 times [2022-11-25 18:32:29,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:32:29,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [537750701] [2022-11-25 18:32:29,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:32:29,008 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:32:29,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:32:29,009 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:32:29,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-25 18:32:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:32:29,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-25 18:32:29,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:32:29,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 18:32:30,007 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 18:32:30,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 18:32:30,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:32:30,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-25 18:32:30,372 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3053 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3053)))) is different from true [2022-11-25 18:32:30,477 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3056) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:32:30,497 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3057) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:32:31,180 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3074 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3074) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:32:31,352 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:32:31,934 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:32:31,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 18:32:31,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-25 18:32:32,017 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 741 trivial. 210 not checked. [2022-11-25 18:32:32,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:32:34,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:32:34,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [537750701] [2022-11-25 18:32:34,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [537750701] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:32:34,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [664094884] [2022-11-25 18:32:34,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:32:34,428 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 18:32:34,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 18:32:34,429 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 18:32:34,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2022-11-25 18:32:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:32:36,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-25 18:32:36,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:32:36,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 18:32:36,228 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 18:32:36,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 18:32:36,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:32:36,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-25 18:32:36,398 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3513)))) is different from true [2022-11-25 18:32:36,418 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3514 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3514) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:32:36,690 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3522 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3522)))) is different from true [2022-11-25 18:32:37,167 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3535) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:32:37,613 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3547) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:32:38,014 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:32:38,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 18:32:38,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-25 18:32:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 741 trivial. 210 not checked. [2022-11-25 18:32:38,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:32:40,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [664094884] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:32:40,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:32:40,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2022-11-25 18:32:40,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863705341] [2022-11-25 18:32:40,439 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:32:40,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 18:32:40,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:32:40,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 18:32:40,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=103, Unknown=20, NotChecked=290, Total=462 [2022-11-25 18:32:40,441 INFO L87 Difference]: Start difference. First operand 1261 states and 1448 transitions. Second operand has 19 states, 17 states have (on average 5.352941176470588) internal successors, (91), 19 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:32:41,665 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3513)))) is different from true [2022-11-25 18:32:41,671 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3514 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3514) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3053 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3053))) (exists ((v_ArrVal_3056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3056) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3074 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3074) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3522 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3522))) (exists ((v_ArrVal_3547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3535) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:32:41,676 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3050))) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_32)) (_ bv0 1)) (not (= v_arrayElimCell_32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|))))) (exists ((v_ArrVal_3079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3079) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3053 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3053))) (exists ((v_ArrVal_3056 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3056) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3074 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3074) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3057) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3522 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3522))) (exists ((v_ArrVal_3547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3547) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3535) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:32:53,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:32:53,322 INFO L93 Difference]: Finished difference Result 1646 states and 1950 transitions. [2022-11-25 18:32:53,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:32:53,324 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.352941176470588) internal successors, (91), 19 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-11-25 18:32:53,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:32:53,327 INFO L225 Difference]: With dead ends: 1646 [2022-11-25 18:32:53,327 INFO L226 Difference]: Without dead ends: 1646 [2022-11-25 18:32:53,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 139 SyntacticMatches, 81 SemanticMatches, 26 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=74, Invalid=162, Unknown=26, NotChecked=494, Total=756 [2022-11-25 18:32:53,335 INFO L413 NwaCegarLoop]: 673 mSDtfsCounter, 714 mSDsluCounter, 3053 mSDsCounter, 0 mSdLazyCounter, 3434 mSolverCounterSat, 6 mSolverCounterUnsat, 793 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 3726 SdHoareTripleChecker+Invalid, 14819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3434 IncrementalHoareTripleChecker+Invalid, 793 IncrementalHoareTripleChecker+Unknown, 10586 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:32:53,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 3726 Invalid, 14819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3434 Invalid, 793 Unknown, 10586 Unchecked, 12.6s Time] [2022-11-25 18:32:53,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2022-11-25 18:32:53,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1260. [2022-11-25 18:32:53,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 821 states have (on average 1.7417783191230207) internal successors, (1430), 1253 states have internal predecessors, (1430), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-25 18:32:53,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1447 transitions. [2022-11-25 18:32:53,361 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1447 transitions. Word has length 117 [2022-11-25 18:32:53,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:32:53,361 INFO L495 AbstractCegarLoop]: Abstraction has 1260 states and 1447 transitions. [2022-11-25 18:32:53,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.352941176470588) internal successors, (91), 19 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:32:53,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1447 transitions. [2022-11-25 18:32:53,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-25 18:32:53,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:32:53,363 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:32:53,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2022-11-25 18:32:53,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-11-25 18:32:53,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:32:53,774 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:32:53,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:32:53,775 INFO L85 PathProgramCache]: Analyzing trace with hash -325619528, now seen corresponding path program 1 times [2022-11-25 18:32:53,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:32:53,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994951076] [2022-11-25 18:32:53,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:32:53,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:32:53,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:32:53,777 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:32:53,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-25 18:32:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:32:54,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-25 18:32:54,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:32:54,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 18:32:54,826 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 18:32:54,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 18:32:54,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:32:54,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-25 18:32:56,329 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4016)))) is different from true [2022-11-25 18:32:56,433 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4019) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:32:56,747 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:32:56,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 18:32:56,892 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:32:56,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 18:32:56,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-25 18:32:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 87 not checked. [2022-11-25 18:32:56,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:32:57,032 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4026) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-25 18:32:57,044 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4026) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-25 18:32:57,402 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4072))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4026)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-25 18:32:57,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:32:57,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994951076] [2022-11-25 18:32:57,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994951076] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:32:57,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [694230565] [2022-11-25 18:32:57,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:32:57,406 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 18:32:57,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 18:32:57,408 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 18:32:57,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-11-25 18:33:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:33:01,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-25 18:33:01,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:33:01,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 18:33:01,761 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 18:33:01,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 18:33:01,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:33:01,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-25 18:33:02,094 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4457)))) is different from true [2022-11-25 18:33:02,175 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4460 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4460)))) is different from true [2022-11-25 18:33:02,271 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4463) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:33:02,321 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4465) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:33:02,887 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4481) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:33:03,011 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_42 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_42) (_ bv1 1))) (not (= v_arrayElimCell_42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_4485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4485)))) is different from true [2022-11-25 18:33:03,444 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:33:03,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 18:33:03,519 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:33:03,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 18:33:03,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-25 18:33:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 703 trivial. 249 not checked. [2022-11-25 18:33:03,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:33:03,579 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4496) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-25 18:33:03,591 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4496) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-25 18:33:03,904 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4542))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4496)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-25 18:33:03,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [694230565] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:33:03,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:33:03,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 17 [2022-11-25 18:33:03,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648704427] [2022-11-25 18:33:03,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:33:03,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 18:33:03,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:33:03,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 18:33:03,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=106, Unknown=23, NotChecked=462, Total=650 [2022-11-25 18:33:03,908 INFO L87 Difference]: Start difference. First operand 1260 states and 1447 transitions. Second operand has 18 states, 16 states have (on average 5.75) internal successors, (92), 18 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:33:15,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:33:15,916 INFO L93 Difference]: Finished difference Result 1645 states and 1949 transitions. [2022-11-25 18:33:15,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:33:15,918 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.75) internal successors, (92), 18 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 120 [2022-11-25 18:33:15,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:33:15,921 INFO L225 Difference]: With dead ends: 1645 [2022-11-25 18:33:15,921 INFO L226 Difference]: Without dead ends: 1645 [2022-11-25 18:33:15,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 146 SyntacticMatches, 83 SemanticMatches, 27 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=26, NotChecked=546, Total=812 [2022-11-25 18:33:15,922 INFO L413 NwaCegarLoop]: 672 mSDtfsCounter, 713 mSDsluCounter, 2693 mSDsCounter, 0 mSdLazyCounter, 2974 mSolverCounterSat, 7 mSolverCounterUnsat, 813 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 3365 SdHoareTripleChecker+Invalid, 12226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2974 IncrementalHoareTripleChecker+Invalid, 813 IncrementalHoareTripleChecker+Unknown, 8432 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:33:15,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 3365 Invalid, 12226 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7 Valid, 2974 Invalid, 813 Unknown, 8432 Unchecked, 11.7s Time] [2022-11-25 18:33:15,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2022-11-25 18:33:15,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1259. [2022-11-25 18:33:15,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 821 states have (on average 1.7405602923264312) internal successors, (1429), 1252 states have internal predecessors, (1429), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-25 18:33:15,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1446 transitions. [2022-11-25 18:33:15,941 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 1446 transitions. Word has length 120 [2022-11-25 18:33:15,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:33:15,942 INFO L495 AbstractCegarLoop]: Abstraction has 1259 states and 1446 transitions. [2022-11-25 18:33:15,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.75) internal successors, (92), 18 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:33:15,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1446 transitions. [2022-11-25 18:33:15,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-25 18:33:15,943 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:33:15,944 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:33:15,964 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2022-11-25 18:33:16,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-25 18:33:16,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:33:16,360 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:33:16,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:33:16,360 INFO L85 PathProgramCache]: Analyzing trace with hash -325619527, now seen corresponding path program 1 times [2022-11-25 18:33:16,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:33:16,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793983346] [2022-11-25 18:33:16,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:33:16,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:33:16,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:33:16,362 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:33:16,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-11-25 18:33:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:33:17,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-25 18:33:17,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:33:17,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 18:33:17,523 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:33:17,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 18:33:17,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:33:17,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:33:17,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:33:17,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 18:33:17,709 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-25 18:33:17,772 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4924))) (exists ((v_ArrVal_4925 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4925) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-25 18:33:17,785 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4926 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4926) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4927)))) is different from true [2022-11-25 18:33:17,801 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4928))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4929)))) is different from true [2022-11-25 18:33:17,885 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4935))) (exists ((v_ArrVal_4934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4934)))) is different from true [2022-11-25 18:33:17,993 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4943 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4943) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4942))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-25 18:33:18,037 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4946 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4946) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4947)))) is different from true [2022-11-25 18:33:18,052 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4949)))) is different from true [2022-11-25 18:33:18,143 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4954))) (exists ((v_ArrVal_4955 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4955) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:33:18,158 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4957 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4957) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4956 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4956) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:33:18,277 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4964))) (exists ((v_ArrVal_4965 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4965) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:33:18,322 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4969))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4968)))) is different from true [2022-11-25 18:33:18,481 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4978) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4979) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-25 18:33:18,493 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4980))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4981)))) is different from true [2022-11-25 18:33:18,572 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4986))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4987 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4987) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:33:18,584 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4988))) (exists ((v_ArrVal_4989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4989)))) is different from true [2022-11-25 18:33:18,597 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4991 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4991) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4990)))) is different from true [2022-11-25 18:33:18,720 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4999))) (exists ((v_ArrVal_4998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4998)))) is different from true [2022-11-25 18:33:18,734 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5001))) (exists ((v_ArrVal_5000 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5000) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-25 18:33:18,747 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5003 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5003))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5002 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5002) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:33:18,761 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5005))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5004 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5004) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:33:18,811 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5009 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5009))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5008)))) is different from true [2022-11-25 18:33:18,897 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:33:18,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 18:33:18,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 18:33:19,041 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:33:19,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 18:33:19,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 18:33:19,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 18:33:19,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 18:33:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 253 trivial. 714 not checked. [2022-11-25 18:33:19,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:33:19,317 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5013 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2022-11-25 18:33:19,354 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5013 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-25 18:33:20,429 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5105 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5105))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5104) .cse0 v_ArrVal_5013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5105 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5104) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5105) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) is different from false [2022-11-25 18:33:20,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:33:20,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793983346] [2022-11-25 18:33:20,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793983346] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:33:20,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1772162085] [2022-11-25 18:33:20,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:33:20,441 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 18:33:20,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 18:33:20,444 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 18:33:20,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2022-11-25 18:35:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:20,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-25 18:35:20,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:35:20,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 18:35:20,992 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:35:20,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 18:35:21,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:35:21,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:35:21,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:35:21,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 18:35:21,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 18:35:21,172 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5488 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5488) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5487) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:35:21,218 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5492))) (exists ((v_ArrVal_5491 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5491) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-25 18:35:21,304 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5497))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5498) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:35:21,369 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5501))) (exists ((v_ArrVal_5502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5502)))) is different from true [2022-11-25 18:35:21,425 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5505 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5505)))) is different from true [2022-11-25 18:35:21,444 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5507))) (exists ((v_ArrVal_5508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5508) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:35:21,572 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5515))) (exists ((v_ArrVal_5516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5516))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32)))) is different from true [2022-11-25 18:35:21,753 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5527))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5528) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:35:21,766 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5529) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5530) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:35:21,877 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5538) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5537)))) is different from true [2022-11-25 18:35:21,890 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5540))) (exists ((v_ArrVal_5539 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5539) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:35:21,947 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5544 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5544))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5543)))) is different from true [2022-11-25 18:35:21,993 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5547)))) is different from true [2022-11-25 18:35:22,005 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5549) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5550 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5550)))) is different from true [2022-11-25 18:35:22,032 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5551))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5552)))) is different from true [2022-11-25 18:35:22,110 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5557) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5558) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:35:22,123 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5560))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5559)))) is different from true [2022-11-25 18:35:22,271 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5569) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:35:22,285 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5571) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5572) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:35:22,299 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5573))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5574)))) is different from true [2022-11-25 18:35:22,346 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:35:22,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 18:35:22,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 18:35:22,455 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:35:22,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 18:35:22,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 18:35:22,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 18:35:22,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 18:35:22,515 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 690 not checked. [2022-11-25 18:35:22,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:35:22,599 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5575 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5576 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5575) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5576) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5575 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5575) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-11-25 18:35:22,640 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5575 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5576 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5575) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5576) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5575 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5575) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-25 18:35:23,857 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5575 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5668) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5667) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5575) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5575 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5576 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5667))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5668) .cse2 v_ArrVal_5575) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5576) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-25 18:35:23,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1772162085] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:35:23,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:35:23,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 50 [2022-11-25 18:35:23,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256445575] [2022-11-25 18:35:23,872 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:35:23,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-25 18:35:23,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:35:23,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-25 18:35:23,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=144, Unknown=55, NotChecked=3102, Total=3422 [2022-11-25 18:35:23,874 INFO L87 Difference]: Start difference. First operand 1259 states and 1446 transitions. Second operand has 51 states, 49 states have (on average 2.857142857142857) internal successors, (140), 51 states have internal predecessors, (140), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:35:25,139 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4924))) (exists ((v_ArrVal_4930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4930))) (exists ((v_ArrVal_4925 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4925) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_5488 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5488) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5487) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4931)))) is different from true [2022-11-25 18:35:25,150 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4986))) (exists ((v_ArrVal_4978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4978) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5544 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5544))) (exists ((v_ArrVal_4946 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4946) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4930))) (exists ((v_ArrVal_5492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5492))) (exists ((v_ArrVal_4943 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4943) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5009 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5009))) (exists ((v_ArrVal_5491 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5491) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5557) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4926 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4926) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5515))) (exists ((v_ArrVal_4942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4942))) (exists ((v_ArrVal_4969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4969))) (exists ((v_ArrVal_5527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5527))) (exists ((v_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4979) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5516))) (exists ((v_ArrVal_5497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5497))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4954))) (exists ((v_ArrVal_4968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4968))) (exists ((v_ArrVal_4955 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4955) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5538) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4927))) (exists ((v_ArrVal_5548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4987 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4987) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4999))) (exists ((v_ArrVal_5501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5501))) (exists ((v_ArrVal_5008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5008))) (exists ((v_ArrVal_4947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4947))) (exists ((v_ArrVal_5537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5537))) (exists ((v_ArrVal_5570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5558) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4935))) (exists ((v_ArrVal_5502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5502))) (exists ((v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5547))) (exists ((v_ArrVal_5569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5569) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5498) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4934))) (exists ((v_ArrVal_4931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4931))) (exists ((v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5543))) (exists ((v_ArrVal_4964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4964))) (exists ((v_ArrVal_5528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5528) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5505 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5505))) (exists ((v_ArrVal_4998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4998))) (exists ((v_ArrVal_4965 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4965) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:35:25,164 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5560))) (exists ((v_ArrVal_4986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4986))) (exists ((v_ArrVal_4978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4978) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5544 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5544))) (exists ((v_ArrVal_4946 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4946) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4930))) (exists ((v_ArrVal_5492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5492))) (exists ((v_ArrVal_4943 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4943) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5009 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5009))) (exists ((v_ArrVal_5491 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5491) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5557) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5001))) (exists ((v_ArrVal_5515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5515))) (exists ((v_ArrVal_4942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4942))) (exists ((v_ArrVal_4980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4980))) (exists ((v_ArrVal_4969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4969))) (exists ((v_ArrVal_5529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5529) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5000 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5000) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5527))) (exists ((v_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4979) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5516))) (exists ((v_ArrVal_4928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4928))) (exists ((v_ArrVal_5497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5497))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4954))) (exists ((v_ArrVal_4948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4988))) (exists ((v_ArrVal_5571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5571) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4968))) (exists ((v_ArrVal_4955 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4955) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5538) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4987 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4987) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5507))) (exists ((v_ArrVal_5508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5508) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5549) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4999))) (exists ((v_ArrVal_5501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5501))) (exists ((v_ArrVal_5540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5540))) (exists ((v_ArrVal_5008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5008))) (exists ((v_ArrVal_4947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4947))) (exists ((v_ArrVal_5537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5537))) (exists ((v_ArrVal_5539 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5539) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4949))) (exists ((v_ArrVal_5530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5530) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4957 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4957) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5558) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4989))) (exists ((v_ArrVal_4935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4935))) (exists ((v_ArrVal_4956 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4956) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5502))) (exists ((v_ArrVal_5550 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5550))) (exists ((v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5547))) (exists ((v_ArrVal_5569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5569) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5559))) (exists ((v_ArrVal_4929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4929))) (exists ((v_ArrVal_5498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5498) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4981))) (exists ((v_ArrVal_4934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4934))) (exists ((v_ArrVal_5572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5572) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4931))) (exists ((v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5543))) (exists ((v_ArrVal_4964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4964))) (exists ((v_ArrVal_5528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5528) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5505 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5505))) (exists ((v_ArrVal_4998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4998))) (exists ((v_ArrVal_4965 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4965) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:35:25,179 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5560))) (exists ((v_ArrVal_4986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4986))) (exists ((v_ArrVal_4978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4978) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5544 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5544))) (exists ((v_ArrVal_4946 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4946) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4930))) (exists ((v_ArrVal_5492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5492))) (exists ((v_ArrVal_4943 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4943) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5009 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5009))) (exists ((v_ArrVal_5491 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5491) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5557) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4991 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4991) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5551))) (exists ((v_ArrVal_5001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5001))) (exists ((v_ArrVal_5515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5515))) (exists ((v_ArrVal_4942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4942))) (exists ((v_ArrVal_4980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4980))) (exists ((v_ArrVal_5573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5573))) (exists ((v_ArrVal_4969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4969))) (exists ((v_ArrVal_5529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5529) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5003 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5003))) (exists ((v_ArrVal_5000 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5000) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5527))) (exists ((v_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4979) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5516))) (exists ((v_ArrVal_5497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5497))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4954))) (exists ((v_ArrVal_5002 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5002) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4988))) (exists ((v_ArrVal_5552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5552))) (exists ((v_ArrVal_5571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5571) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4968))) (exists ((v_ArrVal_4955 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4955) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5538) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4987 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4987) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5507))) (exists ((v_ArrVal_5508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5508) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5549) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4999))) (exists ((v_ArrVal_5501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5501))) (exists ((v_ArrVal_5540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5540))) (exists ((v_ArrVal_5574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5574))) (exists ((v_ArrVal_5008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5008))) (exists ((v_ArrVal_4947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4947))) (exists ((v_ArrVal_4990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4990))) (exists ((v_ArrVal_5537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5537))) (exists ((v_ArrVal_5539 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5539) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4949))) (exists ((v_ArrVal_5530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5530) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4957 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4957) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5558) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4989))) (exists ((v_ArrVal_4935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4935))) (exists ((v_ArrVal_4956 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4956) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5502))) (exists ((v_ArrVal_5550 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5550))) (exists ((v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5547))) (exists ((v_ArrVal_5569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5569) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5559))) (exists ((v_ArrVal_5498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5498) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4981))) (exists ((v_ArrVal_4934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4934))) (exists ((v_ArrVal_5572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5572) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4931))) (exists ((v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5543))) (exists ((v_ArrVal_4964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4964))) (exists ((v_ArrVal_5528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5528) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5505 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5505))) (exists ((v_ArrVal_4998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4998))) (exists ((v_ArrVal_4965 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4965) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:35:25,195 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5560))) (exists ((v_ArrVal_4986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4986))) (exists ((v_ArrVal_4978 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4978) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5544 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5544))) (exists ((v_ArrVal_4946 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4946) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4930))) (exists ((v_ArrVal_5492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5492))) (exists ((v_ArrVal_4943 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4943) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5009 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5009))) (exists ((v_ArrVal_5491 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5491) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5557) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4991 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4991) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5551))) (exists ((v_ArrVal_5001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5001))) (exists ((v_ArrVal_5515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5515))) (exists ((v_ArrVal_4942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4942))) (exists ((v_ArrVal_4980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4980))) (exists ((v_ArrVal_5573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5573))) (exists ((v_ArrVal_4969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4969))) (exists ((v_ArrVal_5529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5529) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5005))) (exists ((v_ArrVal_5003 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5003))) (exists ((v_ArrVal_5000 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5000) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5527))) (exists ((v_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4979) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5516))) (exists ((v_ArrVal_5497 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5497))) (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_54) (_ bv44 32))) (exists ((v_ArrVal_4954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4954))) (exists ((v_ArrVal_5002 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5002) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4948) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4988))) (exists ((v_ArrVal_5552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5552))) (exists ((v_ArrVal_5571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5571) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4968))) (exists ((v_ArrVal_4955 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4955) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5538) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5548) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4987 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4987) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5507))) (exists ((v_ArrVal_5508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5508) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5549) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4999))) (exists ((v_ArrVal_5501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5501))) (exists ((v_ArrVal_5540 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5540))) (exists ((v_ArrVal_5574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5574))) (exists ((v_ArrVal_5008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5008))) (exists ((v_ArrVal_4947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4947))) (exists ((v_ArrVal_4990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4990))) (exists ((v_ArrVal_5537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5537))) (exists ((v_ArrVal_5539 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5539) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5506) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4949))) (exists ((v_ArrVal_5530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5530) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4957 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4957) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5558) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4989))) (exists ((v_ArrVal_4935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4935))) (exists ((v_ArrVal_4956 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4956) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5004 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5004) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5502))) (exists ((v_ArrVal_5550 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5550))) (exists ((v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5547))) (exists ((v_ArrVal_5569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5569) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5559))) (exists ((v_ArrVal_5498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5498) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4981))) (exists ((v_ArrVal_4934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4934))) (exists ((v_ArrVal_5572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5572) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4931))) (exists ((v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5543))) (exists ((v_ArrVal_4964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4964))) (exists ((v_ArrVal_5528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5528) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5505 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5505))) (exists ((v_ArrVal_4998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4998))) (exists ((v_ArrVal_4965 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4965) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:35:36,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:35:36,990 INFO L93 Difference]: Finished difference Result 1644 states and 1948 transitions. [2022-11-25 18:35:36,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 18:35:36,992 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 2.857142857142857) internal successors, (140), 51 states have internal predecessors, (140), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 120 [2022-11-25 18:35:36,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:35:36,994 INFO L225 Difference]: With dead ends: 1644 [2022-11-25 18:35:36,994 INFO L226 Difference]: Without dead ends: 1644 [2022-11-25 18:35:36,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 146 SyntacticMatches, 50 SemanticMatches, 69 ConstructedPredicates, 52 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=176, Invalid=307, Unknown=67, NotChecked=4420, Total=4970 [2022-11-25 18:35:36,995 INFO L413 NwaCegarLoop]: 672 mSDtfsCounter, 719 mSDsluCounter, 2145 mSDsCounter, 0 mSdLazyCounter, 3710 mSolverCounterSat, 10 mSolverCounterUnsat, 541 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 2817 SdHoareTripleChecker+Invalid, 60486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 3710 IncrementalHoareTripleChecker+Invalid, 541 IncrementalHoareTripleChecker+Unknown, 56225 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:35:36,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 2817 Invalid, 60486 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10 Valid, 3710 Invalid, 541 Unknown, 56225 Unchecked, 12.5s Time] [2022-11-25 18:35:36,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2022-11-25 18:35:37,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1258. [2022-11-25 18:35:37,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 821 states have (on average 1.7393422655298416) internal successors, (1428), 1251 states have internal predecessors, (1428), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-25 18:35:37,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1445 transitions. [2022-11-25 18:35:37,011 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1445 transitions. Word has length 120 [2022-11-25 18:35:37,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:35:37,011 INFO L495 AbstractCegarLoop]: Abstraction has 1258 states and 1445 transitions. [2022-11-25 18:35:37,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 2.857142857142857) internal successors, (140), 51 states have internal predecessors, (140), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:35:37,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1445 transitions. [2022-11-25 18:35:37,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-11-25 18:35:37,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:35:37,013 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:35:37,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-11-25 18:35:37,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2022-11-25 18:35:37,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt [2022-11-25 18:35:37,434 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:35:37,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:35:37,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1800058965, now seen corresponding path program 1 times [2022-11-25 18:35:37,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:35:37,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48355471] [2022-11-25 18:35:37,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:37,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-25 18:35:37,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:35:37,437 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:35:37,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 18:35:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:38,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-25 18:35:38,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:35:38,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 18:35:38,793 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 18:35:38,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 18:35:38,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:35:38,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-25 18:35:39,730 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_74 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_74 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_74)) (_ bv0 1)))) (exists ((v_ArrVal_6077 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6077) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:35:40,081 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_74 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_74 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_74)) (_ bv0 1)))) (exists ((v_ArrVal_6088 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6088)))) is different from true [2022-11-25 18:35:40,228 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_74 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_74 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_74)) (_ bv0 1)))) (exists ((v_ArrVal_6092 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6092) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:35:40,293 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_74 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_74 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_74)) (_ bv0 1)))) (exists ((v_ArrVal_6094 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6094)))) is different from true [2022-11-25 18:35:40,798 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:35:40,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 18:35:40,936 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:35:40,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 18:35:41,066 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:35:41,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 18:35:41,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-25 18:35:41,162 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 780 trivial. 170 not checked. [2022-11-25 18:35:41,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:35:41,264 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6108 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6108) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-25 18:35:41,277 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6108 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6108) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 18:35:41,297 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6107 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6108 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6107))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6108)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-25 18:35:41,312 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6107 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6108 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6107))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6108)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 18:35:41,645 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6107 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6154))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6107)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6108)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-25 18:35:41,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:35:41,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48355471] [2022-11-25 18:35:41,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48355471] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:35:41,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1709069327] [2022-11-25 18:35:41,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:41,649 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 18:35:41,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 18:35:41,650 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 18:35:41,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2022-11-25 18:36:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:09,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-25 18:36:09,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:36:09,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 18:36:09,802 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 18:36:09,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 18:36:09,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:36:09,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-25 18:36:10,002 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_74 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_74 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_74)) (_ bv0 1)))) (exists ((v_ArrVal_6549 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6549)))) is different from true [2022-11-25 18:36:10,159 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_74 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_74 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_74)) (_ bv0 1)))) (exists ((v_ArrVal_6554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6554)))) is different from true [2022-11-25 18:36:11,215 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_74 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_74 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_74)) (_ bv0 1)))) (exists ((v_ArrVal_6583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6583)))) is different from true [2022-11-25 18:36:11,598 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:36:11,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 18:36:11,672 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:36:11,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 18:36:11,734 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:36:11,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 18:36:11,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-25 18:36:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 820 trivial. 129 not checked. [2022-11-25 18:36:11,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:36:11,815 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6594 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6594) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-25 18:36:11,933 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6593 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6594 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6593))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6594)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-25 18:36:11,954 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6593 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6594 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6593))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6594)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 18:36:12,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1709069327] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:36:12,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:36:12,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 17 [2022-11-25 18:36:12,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319237842] [2022-11-25 18:36:12,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:36:12,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 18:36:12,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:36:12,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 18:36:12,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=165, Unknown=29, NotChecked=600, Total=870 [2022-11-25 18:36:12,386 INFO L87 Difference]: Start difference. First operand 1258 states and 1445 transitions. Second operand has 18 states, 16 states have (on average 5.8125) internal successors, (93), 18 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:36:13,464 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_74 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_74 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_74)) (_ bv0 1)))) (exists ((v_ArrVal_6063 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6063))) (exists ((v_ArrVal_6549 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6549)))) is different from true [2022-11-25 18:36:13,469 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_74 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (_ bv0 1)) (not (= v_arrayElimCell_74 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_9|)) (= (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_74)) (_ bv0 1)))) (exists ((v_ArrVal_6077 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6077) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6063 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6063))) (exists ((v_ArrVal_6092 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6092) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6094 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6094))) (exists ((v_ArrVal_6554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6554))) (exists ((v_ArrVal_6088 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6088))) (exists ((v_ArrVal_6583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6583)))) is different from true [2022-11-25 18:36:24,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:36:24,034 INFO L93 Difference]: Finished difference Result 1643 states and 1947 transitions. [2022-11-25 18:36:24,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:36:24,036 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.8125) internal successors, (93), 18 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-11-25 18:36:24,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:36:24,040 INFO L225 Difference]: With dead ends: 1643 [2022-11-25 18:36:24,040 INFO L226 Difference]: Without dead ends: 1643 [2022-11-25 18:36:24,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 153 SyntacticMatches, 83 SemanticMatches, 33 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=101, Invalid=239, Unknown=34, NotChecked=816, Total=1190 [2022-11-25 18:36:24,041 INFO L413 NwaCegarLoop]: 671 mSDtfsCounter, 708 mSDsluCounter, 2296 mSDsCounter, 0 mSdLazyCounter, 2607 mSolverCounterSat, 8 mSolverCounterUnsat, 804 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 2967 SdHoareTripleChecker+Invalid, 10801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2607 IncrementalHoareTripleChecker+Invalid, 804 IncrementalHoareTripleChecker+Unknown, 7382 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:36:24,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 2967 Invalid, 10801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2607 Invalid, 804 Unknown, 7382 Unchecked, 11.4s Time] [2022-11-25 18:36:24,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2022-11-25 18:36:24,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1257. [2022-11-25 18:36:24,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 821 states have (on average 1.738124238733252) internal successors, (1427), 1250 states have internal predecessors, (1427), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-25 18:36:24,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1444 transitions. [2022-11-25 18:36:24,058 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1444 transitions. Word has length 123 [2022-11-25 18:36:24,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:36:24,059 INFO L495 AbstractCegarLoop]: Abstraction has 1257 states and 1444 transitions. [2022-11-25 18:36:24,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.8125) internal successors, (93), 18 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:36:24,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1444 transitions. [2022-11-25 18:36:24,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-11-25 18:36:24,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:36:24,060 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:36:24,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2022-11-25 18:36:24,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 18:36:24,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:36:24,487 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:36:24,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:36:24,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1800058966, now seen corresponding path program 1 times [2022-11-25 18:36:24,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:36:24,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885853044] [2022-11-25 18:36:24,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:24,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:36:24,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:36:24,489 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:36:24,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-11-25 18:36:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:36:25,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-25 18:36:25,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:36:25,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 18:36:25,931 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:36:25,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 18:36:25,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:36:25,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:36:25,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:36:26,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 18:36:26,106 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-25 18:36:26,174 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7037 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7037))) (exists ((v_ArrVal_7038 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7038)))) is different from true [2022-11-25 18:36:26,244 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7041) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7042) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:36:26,258 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7044))) (exists ((v_ArrVal_7043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7043)))) is different from true [2022-11-25 18:36:26,272 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7046 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7046) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7045 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7045) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:36:26,366 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7052 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7052) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7051 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7051)))) is different from true [2022-11-25 18:36:26,381 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7053 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7053))) (exists ((v_ArrVal_7054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7054)))) is different from true [2022-11-25 18:36:26,396 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7056))) (exists ((v_ArrVal_7055 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7055) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:36:26,450 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7059 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7059) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7060 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7060) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:36:26,466 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7062 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7062))) (exists ((v_ArrVal_7061 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7061)))) is different from true [2022-11-25 18:36:26,563 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7068 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7068))) (exists ((v_ArrVal_7067 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7067) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:36:26,579 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7069 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7069) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7070)))) is different from true [2022-11-25 18:36:26,595 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7072 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7072))) (exists ((v_ArrVal_7071 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7071)))) is different from true [2022-11-25 18:36:26,609 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7074 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7074))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7073 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7073)))) is different from true [2022-11-25 18:36:26,622 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7076 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7076) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7075 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7075) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:36:26,666 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7079 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7079))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7080 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7080)))) is different from true [2022-11-25 18:36:26,678 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7081) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7082 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7082)))) is different from true [2022-11-25 18:36:26,691 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7084 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7084))) (exists ((v_ArrVal_7083 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7083)))) is different from true [2022-11-25 18:36:26,704 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7086 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7086) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7085 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7085)))) is different from true [2022-11-25 18:36:26,716 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7088 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7088))) (exists ((v_ArrVal_7087 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7087) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:36:26,729 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7089 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7089) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7090 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7090)))) is different from true [2022-11-25 18:36:26,741 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7092) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7091 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7091)))) is different from true [2022-11-25 18:36:26,753 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7094))) (exists ((v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7093)))) is different from true [2022-11-25 18:36:26,765 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7095 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7095))) (exists ((v_ArrVal_7096 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7096) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:36:26,778 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7098 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7098))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7097) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:36:26,789 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7099))) (exists ((v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7100)))) is different from true [2022-11-25 18:36:26,802 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7101 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7101))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7102 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7102)))) is different from true [2022-11-25 18:36:26,814 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7103 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7103))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7104 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7104) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:36:26,827 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7105 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7105))) (exists ((v_ArrVal_7106 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7106)))) is different from true [2022-11-25 18:36:26,840 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7108 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7108))) (exists ((v_ArrVal_7107 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7107)))) is different from true [2022-11-25 18:36:26,852 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7110 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7110))) (exists ((v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7109)))) is different from true [2022-11-25 18:36:26,865 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7112 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7112) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7111 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7111)))) is different from true [2022-11-25 18:36:26,877 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7113 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7113) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7114 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7114)))) is different from true [2022-11-25 18:36:26,890 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7116 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7116))) (exists ((v_ArrVal_7115 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7115) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:36:26,902 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7117 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7117) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7118 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7118)))) is different from true [2022-11-25 18:36:26,947 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7122 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7122))) (exists ((v_ArrVal_7121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7121)))) is different from true [2022-11-25 18:36:27,039 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:36:27,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 18:36:27,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 18:36:27,168 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:36:27,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 18:36:27,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 18:36:27,295 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:36:27,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 18:36:27,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 18:36:27,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 18:36:27,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 18:36:27,391 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 945 not checked. [2022-11-25 18:36:27,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:36:27,636 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7128 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7127 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2022-11-25 18:36:27,667 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7128 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7127 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2022-11-25 18:36:27,766 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7126) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7125) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7125))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7126) .cse2 v_ArrVal_7127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-25 18:36:27,892 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7125))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7126) .cse1 v_ArrVal_7127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7126) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7125) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2022-11-25 18:36:35,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:36:35,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885853044] [2022-11-25 18:36:35,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885853044] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:36:35,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1495500232] [2022-11-25 18:36:35,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:36:35,357 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 18:36:35,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 18:36:35,358 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 18:36:35,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-11-25 18:37:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:37:40,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 117 conjunts are in the unsatisfiable core [2022-11-25 18:37:40,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:37:40,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 18:37:40,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:37:40,629 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:37:40,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 18:37:40,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:37:40,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:37:40,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 18:37:40,808 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-25 18:37:40,919 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7618 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7618))) (exists ((v_ArrVal_7617 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7617)))) is different from true [2022-11-25 18:37:40,946 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7619 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7619) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7620 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7620)))) is different from true [2022-11-25 18:37:40,974 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7621 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7621))) (exists ((v_ArrVal_7622 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7622) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:37:41,001 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7623))) (exists ((v_ArrVal_7624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7624)))) is different from true [2022-11-25 18:37:41,028 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7625 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7625))) (exists ((v_ArrVal_7626 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7626)))) is different from true [2022-11-25 18:37:41,053 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7628 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7628))) (exists ((v_ArrVal_7627 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7627)))) is different from true [2022-11-25 18:37:41,078 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7629 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7629) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7630 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7630)))) is different from true [2022-11-25 18:37:41,102 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7632 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7632))) (exists ((v_ArrVal_7631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7631) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:37:41,128 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7633 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7633))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7634)))) is different from true [2022-11-25 18:37:41,154 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7636 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7636))) (exists ((v_ArrVal_7635 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7635)))) is different from true [2022-11-25 18:37:41,181 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7638 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7638))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7637 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7637)))) is different from true [2022-11-25 18:37:41,208 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7639 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7639))) (exists ((v_ArrVal_7640 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7640)))) is different from true [2022-11-25 18:37:41,235 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7642 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7642))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7641 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7641)))) is different from true [2022-11-25 18:37:41,262 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7644 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7644) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7643 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7643) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:37:41,288 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7645 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7645) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7646 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7646)))) is different from true [2022-11-25 18:37:41,315 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7648 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7648))) (exists ((v_ArrVal_7647 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7647) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:37:41,407 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7652 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7652))) (exists ((v_ArrVal_7651 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7651)))) is different from true [2022-11-25 18:37:41,434 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7653 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7653) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7654 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7654)))) is different from true [2022-11-25 18:37:41,460 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7656 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7656))) (exists ((v_ArrVal_7655 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7655)))) is different from true [2022-11-25 18:37:41,486 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7657 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7657) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7658 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7658) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:37:41,513 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7660 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7660) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7659 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7659) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:37:41,539 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7661 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7661))) (exists ((v_ArrVal_7662 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7662) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:37:41,565 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7664 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7664))) (exists ((v_ArrVal_7663 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7663)))) is different from true [2022-11-25 18:37:41,590 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7666 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7666))) (exists ((v_ArrVal_7665 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7665)))) is different from true [2022-11-25 18:37:41,618 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7668 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7668))) (exists ((v_ArrVal_7667 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7667)))) is different from true [2022-11-25 18:37:41,644 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7670 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7670))) (exists ((v_ArrVal_7669 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7669) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:37:41,671 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7672 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7672))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7671 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7671)))) is different from true [2022-11-25 18:37:41,698 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7674))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7673 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7673)))) is different from true [2022-11-25 18:37:41,729 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7676 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7676) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7675 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7675) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:37:41,756 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7677))) (exists ((v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7678) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:37:41,784 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7680 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7680) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7679 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7679) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:37:41,811 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7681 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7681) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7682 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7682)))) is different from true [2022-11-25 18:37:41,838 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7683 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7683))) (exists ((v_ArrVal_7684 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7684)))) is different from true [2022-11-25 18:37:41,865 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7686 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7686))) (exists ((v_ArrVal_7685 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7685)))) is different from true [2022-11-25 18:37:41,892 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7687 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7687) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7688 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7688) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:37:41,919 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7690 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7690))) (exists ((v_ArrVal_7689 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7689) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:37:41,946 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7691 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7691) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7692 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7692)))) is different from true [2022-11-25 18:37:41,972 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7693 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7693))) (exists ((v_ArrVal_7694 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7694)))) is different from true [2022-11-25 18:37:41,999 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7695 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7695) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7696 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7696)))) is different from true [2022-11-25 18:37:42,026 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7698 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7698))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7697 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7697) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:37:42,052 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7699 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7699))) (exists ((v_ArrVal_7700 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7700)))) is different from true [2022-11-25 18:37:42,084 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7702 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7702))) (exists ((v_ArrVal_7701 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7701) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:37:42,111 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7703 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7703))) (exists ((v_ArrVal_7704 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7704)))) is different from true [2022-11-25 18:37:42,215 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:37:42,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 18:37:42,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 18:37:42,386 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:37:42,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 18:37:42,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 18:37:42,523 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:37:42,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 18:37:42,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 18:37:42,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 18:37:42,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 18:37:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 989 not checked. [2022-11-25 18:37:42,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:37:42,738 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7707 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7708) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7707) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7708 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7708) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd (_ bv12 32) .cse1)))))) is different from false [2022-11-25 18:37:42,800 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7707 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7708) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7707) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7708 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7708) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2022-11-25 18:37:42,897 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7706 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7705 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7705))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7706) .cse0 v_ArrVal_7708) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7707) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7706 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7705 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7706) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7705) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7708) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2022-11-25 18:37:42,971 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7706 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7705 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7705))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7706) .cse1 v_ArrVal_7708) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7707) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7706 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7705 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7706) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7705) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7708) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2022-11-25 18:37:44,439 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7706 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7705 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7800 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7799))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7800) .cse1 v_ArrVal_7706) (select (select (store .cse2 .cse1 v_ArrVal_7705) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7708))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7706 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7705 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7800 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7799))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7705))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7800) .cse4 v_ArrVal_7706) .cse5 v_ArrVal_7708) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7707) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2022-11-25 18:37:44,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1495500232] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:37:44,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:37:44,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 53] total 88 [2022-11-25 18:37:44,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919001930] [2022-11-25 18:37:44,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:37:44,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-11-25 18:37:44,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:37:44,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-11-25 18:37:44,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=220, Unknown=102, NotChecked=9570, Total=10100 [2022-11-25 18:37:44,462 INFO L87 Difference]: Start difference. First operand 1257 states and 1444 transitions. Second operand has 89 states, 87 states have (on average 1.9080459770114941) internal successors, (166), 89 states have internal predecessors, (166), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:37:48,390 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7037 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7037))) (exists ((v_ArrVal_7038 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7038))) (exists ((v_ArrVal_7618 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7618))) (exists ((v_ArrVal_7617 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7617))) (exists ((v_ArrVal_7039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7039))) (exists ((v_ArrVal_7040 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7040) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:37:48,400 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7052 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7052) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7079 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7079))) (exists ((v_arrayElimCell_88 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_88))) (exists ((v_ArrVal_7080 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7080))) (exists ((v_ArrVal_7068 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7068))) (exists ((v_ArrVal_7059 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7059) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7051 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7051))) (exists ((v_ArrVal_7060 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7060) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7619 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7619) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7039))) (exists ((v_ArrVal_7652 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7652))) (exists ((v_ArrVal_7067 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7067) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7122 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7122))) (exists ((v_ArrVal_7040 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7040) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7620 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7620))) (exists ((v_ArrVal_7041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7041) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7121))) (exists ((v_ArrVal_7042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7042) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7651 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7651)))) is different from true [2022-11-25 18:38:16,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:38:16,765 INFO L93 Difference]: Finished difference Result 1642 states and 1946 transitions. [2022-11-25 18:38:16,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:38:16,767 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 87 states have (on average 1.9080459770114941) internal successors, (166), 89 states have internal predecessors, (166), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 123 [2022-11-25 18:38:16,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:38:16,769 INFO L225 Difference]: With dead ends: 1642 [2022-11-25 18:38:16,769 INFO L226 Difference]: Without dead ends: 1642 [2022-11-25 18:38:16,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 153 SyntacticMatches, 14 SemanticMatches, 109 ConstructedPredicates, 89 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=265, Invalid=439, Unknown=114, NotChecked=11392, Total=12210 [2022-11-25 18:38:16,773 INFO L413 NwaCegarLoop]: 671 mSDtfsCounter, 717 mSDsluCounter, 3209 mSDsCounter, 0 mSdLazyCounter, 5718 mSolverCounterSat, 11 mSolverCounterUnsat, 426 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 3880 SdHoareTripleChecker+Invalid, 88348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 5718 IncrementalHoareTripleChecker+Invalid, 426 IncrementalHoareTripleChecker+Unknown, 82193 IncrementalHoareTripleChecker+Unchecked, 28.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:38:16,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 3880 Invalid, 88348 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 5718 Invalid, 426 Unknown, 82193 Unchecked, 28.3s Time] [2022-11-25 18:38:16,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2022-11-25 18:38:16,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1256. [2022-11-25 18:38:16,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 821 states have (on average 1.7369062119366625) internal successors, (1426), 1249 states have internal predecessors, (1426), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-25 18:38:16,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1443 transitions. [2022-11-25 18:38:16,789 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1443 transitions. Word has length 123 [2022-11-25 18:38:16,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:38:16,789 INFO L495 AbstractCegarLoop]: Abstraction has 1256 states and 1443 transitions. [2022-11-25 18:38:16,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 87 states have (on average 1.9080459770114941) internal successors, (166), 89 states have internal predecessors, (166), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:38:16,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1443 transitions. [2022-11-25 18:38:16,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-11-25 18:38:16,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:38:16,791 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:38:16,818 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-11-25 18:38:17,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2022-11-25 18:38:17,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt [2022-11-25 18:38:17,207 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:38:17,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:38:17,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1404728641, now seen corresponding path program 1 times [2022-11-25 18:38:17,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:38:17,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925323986] [2022-11-25 18:38:17,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:38:17,208 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:38:17,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:38:17,209 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:38:17,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 18:38:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:18,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-25 18:38:18,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:38:18,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 18:38:18,909 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 18:38:18,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 18:38:18,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:38:19,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-25 18:38:19,462 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_112 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_112) (_ bv1 1))) (not (= v_arrayElimCell_112 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)))) (exists ((v_ArrVal_8211 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8211)))) is different from true [2022-11-25 18:38:20,281 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_112 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_112) (_ bv1 1))) (not (= v_arrayElimCell_112 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)))) (exists ((v_ArrVal_8223 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8223) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:38:20,501 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_112 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_112) (_ bv1 1))) (not (= v_arrayElimCell_112 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)))) (exists ((v_ArrVal_8227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8227)))) is different from true [2022-11-25 18:38:21,305 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_112 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_112) (_ bv1 1))) (not (= v_arrayElimCell_112 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)))) (exists ((v_ArrVal_8239 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8239)))) is different from true [2022-11-25 18:38:22,332 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:38:22,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 18:38:22,588 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:38:22,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 18:38:22,800 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:38:22,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 18:38:23,016 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:38:23,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 18:38:23,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-25 18:38:23,166 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 780 trivial. 170 not checked. [2022-11-25 18:38:23,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:38:23,319 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8256 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8256) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-25 18:38:23,344 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8256 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8256) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-25 18:38:23,386 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8255 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8255))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8256)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 18:38:23,423 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8255 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8255))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8256)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-25 18:38:23,478 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8255 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8254))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8255)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8256)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 18:38:23,521 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8255 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8254))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8255)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8256)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-25 18:38:24,132 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8302 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8255 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8302))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8254)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8255)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8256)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-25 18:38:24,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:38:24,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925323986] [2022-11-25 18:38:24,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925323986] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:38:24,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [453027253] [2022-11-25 18:38:24,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:38:24,140 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 18:38:24,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 18:38:24,141 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 18:38:24,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2022-11-25 18:39:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:39:33,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-25 18:39:33,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:39:33,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 18:39:34,071 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 18:39:34,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 18:39:34,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:39:34,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-25 18:39:36,811 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_112 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_112) (_ bv1 1))) (not (= v_arrayElimCell_112 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)))) (exists ((v_ArrVal_8748 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8748) |c_#memory_$Pointer$.base|))) is different from true [2022-11-25 18:39:37,523 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:39:37,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 18:39:37,664 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:39:37,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 18:39:37,788 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:39:37,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 18:39:37,915 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:39:37,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 18:39:37,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-25 18:39:37,986 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-11-25 18:39:37,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:39:40,165 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8759 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8759) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-25 18:39:40,201 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8758))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8759)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-25 18:39:40,228 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8758 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8758))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8759)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-25 18:39:40,272 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8758 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8757))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8758)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8759)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2022-11-25 18:39:40,305 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8758 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8757))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8758)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8759)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-25 18:39:40,907 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8758 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8757 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8805))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8757)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8758)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8759)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 18:39:40,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [453027253] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:39:40,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:39:40,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 16 [2022-11-25 18:39:40,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144037374] [2022-11-25 18:39:40,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:39:40,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 18:39:40,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:39:40,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 18:39:40,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=172, Unknown=30, NotChecked=774, Total=1056 [2022-11-25 18:39:40,918 INFO L87 Difference]: Start difference. First operand 1256 states and 1443 transitions. Second operand has 17 states, 15 states have (on average 6.133333333333334) internal successors, (92), 17 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:39:42,996 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_8210 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8210))) (exists ((v_arrayElimCell_112 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_112) (_ bv1 1))) (not (= v_arrayElimCell_112 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_13|)))) (exists ((v_ArrVal_8748 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8748) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8223 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8223) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_8227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8227))) (exists ((v_ArrVal_8239 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8239))) (exists ((v_ArrVal_8211 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_8211)))) is different from true [2022-11-25 18:40:05,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:40:05,316 INFO L93 Difference]: Finished difference Result 1641 states and 1945 transitions. [2022-11-25 18:40:05,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:40:05,318 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.133333333333334) internal successors, (92), 17 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 126 [2022-11-25 18:40:05,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:40:05,320 INFO L225 Difference]: With dead ends: 1641 [2022-11-25 18:40:05,321 INFO L226 Difference]: Without dead ends: 1641 [2022-11-25 18:40:05,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 160 SyntacticMatches, 85 SemanticMatches, 35 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=101, Invalid=247, Unknown=34, NotChecked=950, Total=1332 [2022-11-25 18:40:05,322 INFO L413 NwaCegarLoop]: 670 mSDtfsCounter, 703 mSDsluCounter, 3502 mSDsCounter, 0 mSdLazyCounter, 3657 mSolverCounterSat, 9 mSolverCounterUnsat, 909 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 4172 SdHoareTripleChecker+Invalid, 11423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 3657 IncrementalHoareTripleChecker+Invalid, 909 IncrementalHoareTripleChecker+Unknown, 6848 IncrementalHoareTripleChecker+Unchecked, 23.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:40:05,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 4172 Invalid, 11423 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9 Valid, 3657 Invalid, 909 Unknown, 6848 Unchecked, 23.9s Time] [2022-11-25 18:40:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2022-11-25 18:40:05,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1255. [2022-11-25 18:40:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 821 states have (on average 1.7356881851400732) internal successors, (1425), 1248 states have internal predecessors, (1425), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-25 18:40:05,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1442 transitions. [2022-11-25 18:40:05,337 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1442 transitions. Word has length 126 [2022-11-25 18:40:05,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:40:05,338 INFO L495 AbstractCegarLoop]: Abstraction has 1255 states and 1442 transitions. [2022-11-25 18:40:05,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.133333333333334) internal successors, (92), 17 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:40:05,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1442 transitions. [2022-11-25 18:40:05,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-11-25 18:40:05,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:40:05,340 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:40:05,361 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 18:40:05,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2022-11-25 18:40:05,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt [2022-11-25 18:40:05,761 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 636 more)] === [2022-11-25 18:40:05,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:40:05,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1404728640, now seen corresponding path program 1 times [2022-11-25 18:40:05,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:40:05,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431669711] [2022-11-25 18:40:05,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:40:05,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:40:05,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:40:05,763 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:40:05,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 18:40:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:40:07,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 118 conjunts are in the unsatisfiable core [2022-11-25 18:40:07,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:40:07,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 18:40:07,468 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 18:40:07,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 18:40:07,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:40:07,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:40:07,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:40:07,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 18:40:07,809 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-25 18:40:08,190 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9223 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9223))) (exists ((v_ArrVal_9224 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9224))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2022-11-25 18:40:08,217 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9225 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9225))) (exists ((v_ArrVal_9226 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9226))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2022-11-25 18:40:08,382 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9232) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9231 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9231)))) is different from true [2022-11-25 18:40:08,619 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9239))) (exists ((v_ArrVal_9240 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9240))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2022-11-25 18:40:08,720 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9243 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9243) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9244 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9244) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-25 18:40:08,947 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9252) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9251))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2022-11-25 18:40:09,175 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9259 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9259) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_9260 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9260))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2022-11-25 18:40:09,336 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9266 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9266))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9265 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9265)))) is different from true [2022-11-25 18:40:09,363 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9268 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9268))) (exists ((v_ArrVal_9267 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9267))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2022-11-25 18:40:09,398 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9270 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9270))) (exists ((v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9269))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2022-11-25 18:40:09,428 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9271 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9271) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9272) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2022-11-25 18:40:09,455 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9273) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9274) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2022-11-25 18:40:09,684 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9281) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9282))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2022-11-25 18:40:09,859 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9288 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9288) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9287))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2022-11-25 18:40:09,955 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9291 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9291) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_9292 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9292))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2022-11-25 18:40:10,050 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9295 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9295))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9296 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9296)))) is different from true [2022-11-25 18:40:10,079 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9298 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9298))) (exists ((v_ArrVal_9297 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9297) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2022-11-25 18:40:10,107 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9300 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9300))) (exists ((v_ArrVal_9299 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9299))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32)))) is different from true [2022-11-25 18:40:10,135 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_9301 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9301))) (exists ((v_arrayElimCell_128 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_128) (_ bv44 32))) (exists ((v_ArrVal_9302 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_9302)))) is different from true [2022-11-25 18:40:10,303 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:40:10,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 18:40:10,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 18:40:10,565 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:40:10,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 18:40:10,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 18:40:10,806 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:40:10,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 18:40:10,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 18:40:11,054 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:40:11,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 18:40:11,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 18:40:11,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 18:40:11,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 18:40:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 300 trivial. 665 not checked. [2022-11-25 18:40:11,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:40:11,589 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9309) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9309) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-25 18:40:11,644 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9309) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9309) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2022-11-25 18:40:11,747 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9307))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9308) .cse0 v_ArrVal_9309) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9308) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9307) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9309) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2022-11-25 18:40:13,143 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9305 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9305))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9307))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9306) .cse0 v_ArrVal_9308) .cse1 v_ArrVal_9309) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9305 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9305))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9306) .cse6 v_ArrVal_9308) (select (select (store .cse7 .cse6 v_ArrVal_9307) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9309))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2022-11-25 18:40:14,794 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9305 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9305))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9306) .cse2 v_ArrVal_9308) (select (select (store .cse3 .cse2 v_ArrVal_9307) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9309))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9305 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9305))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_9307))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9306) .cse5 v_ArrVal_9308) .cse6 v_ArrVal_9309) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2022-11-25 18:40:18,583 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9305 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9402 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9401 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9401))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9305))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9402) .cse1 v_ArrVal_9306) .cse2 v_ArrVal_9308) (select (select (store .cse3 .cse2 v_ArrVal_9307) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9309))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9305 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9402 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9401 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9401))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9305))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9307))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9402) .cse6 v_ArrVal_9306) .cse7 v_ArrVal_9308) .cse8 v_ArrVal_9309) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2022-11-25 18:40:18,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:40:18,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431669711] [2022-11-25 18:40:18,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431669711] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:40:18,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1682975231] [2022-11-25 18:40:18,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:40:18,619 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 18:40:18,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 18:40:18,620 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 18:40:18,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6944b59d-5d2b-4162-8013-09a6fbd546fb/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process