./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8 --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 43c551c05c986c34609f999e25a13e0dbb4f692e7b1d3b7f2939ec615c71d0d0 --- 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-e04fb08 [2022-11-16 11:42:34,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:42:34,528 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:42:34,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:42:34,577 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:42:34,583 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:42:34,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:42:34,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:42:34,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:42:34,603 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:42:34,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:42:34,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:42:34,610 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:42:34,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:42:34,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:42:34,619 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:42:34,622 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:42:34,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:42:34,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:42:34,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:42:34,637 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:42:34,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:42:34,644 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:42:34,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:42:34,657 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:42:34,657 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:42:34,658 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:42:34,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:42:34,661 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:42:34,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:42:34,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:42:34,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:42:34,669 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:42:34,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:42:34,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:42:34,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:42:34,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:42:34,676 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:42:34,676 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:42:34,677 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:42:34,678 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:42:34,679 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 11:42:34,733 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:42:34,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:42:34,735 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:42:34,735 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:42:34,736 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:42:34,737 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:42:34,738 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:42:34,738 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:42:34,738 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:42:34,739 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:42:34,740 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:42:34,741 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:42:34,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:42:34,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:42:34,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:42:34,742 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:42:34,742 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:42:34,742 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:42:34,743 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:42:34,743 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:42:34,743 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:42:34,743 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:42:34,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:42:34,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:42:34,744 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:42:34,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:42:34,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:42:34,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:42:34,747 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:42:34,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:42:34,748 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/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_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8 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 -> 43c551c05c986c34609f999e25a13e0dbb4f692e7b1d3b7f2939ec615c71d0d0 [2022-11-16 11:42:35,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:42:35,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:42:35,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:42:35,129 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:42:35,130 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:42:35,132 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i [2022-11-16 11:42:35,214 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/data/52c439dc0/4aff57e5a81a42b6b6462e8c9901858d/FLAG2a5c4b7d9 [2022-11-16 11:42:36,073 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:42:36,076 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i [2022-11-16 11:42:36,102 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/data/52c439dc0/4aff57e5a81a42b6b6462e8c9901858d/FLAG2a5c4b7d9 [2022-11-16 11:42:36,170 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/data/52c439dc0/4aff57e5a81a42b6b6462e8c9901858d [2022-11-16 11:42:36,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:42:36,178 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:42:36,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:42:36,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:42:36,188 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:42:36,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:42:36" (1/1) ... [2022-11-16 11:42:36,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@786289f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:36, skipping insertion in model container [2022-11-16 11:42:36,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:42:36" (1/1) ... [2022-11-16 11:42:36,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:42:36,302 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:42:36,985 WARN L229 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_97fef671-6ffe-4387-9eea-c4df482c6a23/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i[33022,33035] [2022-11-16 11:42:37,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:42:37,343 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-16 11:42:37,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@361d8d45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:37, skipping insertion in model container [2022-11-16 11:42:37,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:42:37,345 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-16 11:42:37,348 INFO L158 Benchmark]: Toolchain (without parser) took 1168.59ms. Allocated memory was 92.3MB in the beginning and 115.3MB in the end (delta: 23.1MB). Free memory was 51.2MB in the beginning and 72.9MB in the end (delta: -21.7MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2022-11-16 11:42:37,349 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 92.3MB. Free memory is still 71.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:42:37,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1162.17ms. Allocated memory was 92.3MB in the beginning and 115.3MB in the end (delta: 23.1MB). Free memory was 51.0MB in the beginning and 72.9MB in the end (delta: -21.9MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2022-11-16 11:42:37,352 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.34ms. Allocated memory is still 92.3MB. Free memory is still 71.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1162.17ms. Allocated memory was 92.3MB in the beginning and 115.3MB in the end (delta: 23.1MB). Free memory was 51.0MB in the beginning and 72.9MB in the end (delta: -21.9MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 734]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8 --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 43c551c05c986c34609f999e25a13e0dbb4f692e7b1d3b7f2939ec615c71d0d0 --- 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-e04fb08 [2022-11-16 11:42:40,070 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:42:40,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:42:40,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:42:40,123 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:42:40,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:42:40,132 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:42:40,139 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:42:40,143 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:42:40,149 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:42:40,152 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:42:40,153 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:42:40,155 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:42:40,158 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:42:40,160 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:42:40,166 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:42:40,167 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:42:40,169 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:42:40,173 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:42:40,179 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:42:40,184 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:42:40,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:42:40,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:42:40,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:42:40,199 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:42:40,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:42:40,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:42:40,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:42:40,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:42:40,210 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:42:40,211 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:42:40,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:42:40,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:42:40,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:42:40,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:42:40,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:42:40,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:42:40,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:42:40,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:42:40,222 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:42:40,223 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:42:40,230 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-16 11:42:40,283 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:42:40,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:42:40,285 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:42:40,286 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:42:40,287 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:42:40,287 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:42:40,289 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:42:40,290 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:42:40,290 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:42:40,290 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:42:40,292 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:42:40,292 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:42:40,292 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:42:40,293 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:42:40,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:42:40,293 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:42:40,294 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:42:40,294 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:42:40,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:42:40,294 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:42:40,295 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 11:42:40,295 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 11:42:40,295 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:42:40,296 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:42:40,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:42:40,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:42:40,297 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:42:40,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:42:40,298 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:42:40,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:42:40,298 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 11:42:40,298 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 11:42:40,299 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 11:42:40,299 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/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_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8 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 -> 43c551c05c986c34609f999e25a13e0dbb4f692e7b1d3b7f2939ec615c71d0d0 [2022-11-16 11:42:40,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:42:40,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:42:40,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:42:40,832 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:42:40,835 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:42:40,838 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i [2022-11-16 11:42:40,931 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/data/0d6d09f16/dd57bc24d1684564b224eb93880f67bb/FLAG7b084a665 [2022-11-16 11:42:41,764 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:42:41,764 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i [2022-11-16 11:42:41,783 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/data/0d6d09f16/dd57bc24d1684564b224eb93880f67bb/FLAG7b084a665 [2022-11-16 11:42:41,920 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/data/0d6d09f16/dd57bc24d1684564b224eb93880f67bb [2022-11-16 11:42:41,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:42:41,925 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:42:41,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:42:41,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:42:41,932 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:42:41,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:42:41" (1/1) ... [2022-11-16 11:42:41,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e0391a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:41, skipping insertion in model container [2022-11-16 11:42:41,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:42:41" (1/1) ... [2022-11-16 11:42:41,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:42:42,048 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:42:42,714 WARN L229 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_97fef671-6ffe-4387-9eea-c4df482c6a23/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i[33022,33035] [2022-11-16 11:42:43,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:42:43,016 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-16 11:42:43,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:42:43,084 WARN L229 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_97fef671-6ffe-4387-9eea-c4df482c6a23/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i[33022,33035] [2022-11-16 11:42:43,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:42:43,318 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:42:43,375 WARN L229 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_97fef671-6ffe-4387-9eea-c4df482c6a23/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i[33022,33035] [2022-11-16 11:42:43,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:42:43,591 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:42:43,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:43 WrapperNode [2022-11-16 11:42:43,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:42:43,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:42:43,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:42:43,595 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:42:43,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:43" (1/1) ... [2022-11-16 11:42:43,680 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:43" (1/1) ... [2022-11-16 11:42:43,834 INFO L138 Inliner]: procedures = 180, calls = 524, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2176 [2022-11-16 11:42:43,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:42:43,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:42:43,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:42:43,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:42:43,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:43" (1/1) ... [2022-11-16 11:42:43,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:43" (1/1) ... [2022-11-16 11:42:43,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:43" (1/1) ... [2022-11-16 11:42:43,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:43" (1/1) ... [2022-11-16 11:42:44,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:43" (1/1) ... [2022-11-16 11:42:44,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:43" (1/1) ... [2022-11-16 11:42:44,079 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:43" (1/1) ... [2022-11-16 11:42:44,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:43" (1/1) ... [2022-11-16 11:42:44,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:42:44,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:42:44,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:42:44,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:42:44,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:43" (1/1) ... [2022-11-16 11:42:44,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:42:44,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:42:44,167 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:42:44,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:42:44,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-16 11:42:44,221 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2022-11-16 11:42:44,222 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2022-11-16 11:42:44,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-16 11:42:44,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-16 11:42:44,225 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-16 11:42:44,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-16 11:42:44,225 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-16 11:42:44,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:42:44,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:42:44,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 11:42:44,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:42:44,226 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-16 11:42:44,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 11:42:44,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:42:44,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 11:42:44,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 11:42:44,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:42:44,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:42:44,683 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:42:44,689 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:42:44,696 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-16 11:42:57,132 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:42:57,160 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:42:57,160 INFO L300 CfgBuilder]: Removed 151 assume(true) statements. [2022-11-16 11:42:57,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:42:57 BoogieIcfgContainer [2022-11-16 11:42:57,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:42:57,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:42:57,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:42:57,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:42:57,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:42:41" (1/3) ... [2022-11-16 11:42:57,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124d5121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:42:57, skipping insertion in model container [2022-11-16 11:42:57,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:43" (2/3) ... [2022-11-16 11:42:57,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124d5121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:42:57, skipping insertion in model container [2022-11-16 11:42:57,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:42:57" (3/3) ... [2022-11-16 11:42:57,179 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test10-1.i [2022-11-16 11:42:57,204 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:42:57,204 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 990 error locations. [2022-11-16 11:42:57,320 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:42:57,331 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@158fb5e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:42:57,331 INFO L358 AbstractCegarLoop]: Starting to check reachability of 990 error locations. [2022-11-16 11:42:57,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 2058 states, 1056 states have (on average 2.2045454545454546) internal successors, (2328), 2044 states have internal predecessors, (2328), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-16 11:42:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 11:42:57,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:57,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 11:42:57,355 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:42:57,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:57,362 INFO L85 PathProgramCache]: Analyzing trace with hash 66598, now seen corresponding path program 1 times [2022-11-16 11:42:57,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:42:57,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133331383] [2022-11-16 11:42:57,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:57,380 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-16 11:42:57,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:42:57,391 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:42:57,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:42:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:57,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:42:57,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:42:57,834 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-16 11:42:57,870 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-16 11:42:57,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:42:57,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:42:57,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133331383] [2022-11-16 11:42:57,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133331383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:57,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:57,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:42:57,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094239646] [2022-11-16 11:42:57,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:57,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:57,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:42:57,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:57,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:57,981 INFO L87 Difference]: Start difference. First operand has 2058 states, 1056 states have (on average 2.2045454545454546) internal successors, (2328), 2044 states have internal predecessors, (2328), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:04,024 INFO L93 Difference]: Finished difference Result 2555 states and 2718 transitions. [2022-11-16 11:43:04,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:43:04,027 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-16 11:43:04,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:04,065 INFO L225 Difference]: With dead ends: 2555 [2022-11-16 11:43:04,065 INFO L226 Difference]: Without dead ends: 2553 [2022-11-16 11:43:04,067 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-16 11:43:04,072 INFO L413 NwaCegarLoop]: 1269 mSDtfsCounter, 1947 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1957 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:04,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1957 Valid, 1640 Invalid, 1298 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-11-16 11:43:04,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2553 states. [2022-11-16 11:43:04,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 2200. [2022-11-16 11:43:04,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2200 states, 1222 states have (on average 2.037643207855974) internal successors, (2490), 2184 states have internal predecessors, (2490), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-16 11:43:04,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 2522 transitions. [2022-11-16 11:43:04,264 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 2522 transitions. Word has length 3 [2022-11-16 11:43:04,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:04,264 INFO L495 AbstractCegarLoop]: Abstraction has 2200 states and 2522 transitions. [2022-11-16 11:43:04,265 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-16 11:43:04,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 2522 transitions. [2022-11-16 11:43:04,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 11:43:04,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:04,266 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 11:43:04,282 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:04,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:04,476 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:43:04,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:04,477 INFO L85 PathProgramCache]: Analyzing trace with hash 66599, now seen corresponding path program 1 times [2022-11-16 11:43:04,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:43:04,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136242632] [2022-11-16 11:43:04,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:04,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:43:04,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:43:04,480 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:04,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:04,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:43:04,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:04,770 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-16 11:43:04,790 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-16 11:43:04,790 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:43:04,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:43:04,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136242632] [2022-11-16 11:43:04,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136242632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:04,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:04,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:43:04,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055310286] [2022-11-16 11:43:04,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:04,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:43:04,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:43:04,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:43:04,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:43:04,795 INFO L87 Difference]: Start difference. First operand 2200 states and 2522 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-16 11:43:13,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:13,336 INFO L93 Difference]: Finished difference Result 2971 states and 3374 transitions. [2022-11-16 11:43:13,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:43:13,340 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-16 11:43:13,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:13,353 INFO L225 Difference]: With dead ends: 2971 [2022-11-16 11:43:13,353 INFO L226 Difference]: Without dead ends: 2971 [2022-11-16 11:43:13,354 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-16 11:43:13,355 INFO L413 NwaCegarLoop]: 1833 mSDtfsCounter, 844 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 3009 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:13,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 3009 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2022-11-16 11:43:13,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2022-11-16 11:43:13,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 2649. [2022-11-16 11:43:13,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2649 states, 1669 states have (on average 1.9970041941282204) internal successors, (3333), 2630 states have internal predecessors, (3333), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-16 11:43:13,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2649 states and 3371 transitions. [2022-11-16 11:43:13,433 INFO L78 Accepts]: Start accepts. Automaton has 2649 states and 3371 transitions. Word has length 3 [2022-11-16 11:43:13,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:13,434 INFO L495 AbstractCegarLoop]: Abstraction has 2649 states and 3371 transitions. [2022-11-16 11:43:13,434 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-16 11:43:13,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 3371 transitions. [2022-11-16 11:43:13,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 11:43:13,437 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:13,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:13,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:13,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:13,653 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:43:13,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:13,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1375609072, now seen corresponding path program 1 times [2022-11-16 11:43:13,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:43:13,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345228422] [2022-11-16 11:43:13,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:13,655 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-16 11:43:13,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:43:13,657 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:13,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:13,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 11:43:13,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:13,957 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-16 11:43:13,966 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-16 11:43:14,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:43:14,063 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-16 11:43:14,080 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:43:14,080 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-16 11:43:14,108 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-16 11:43:14,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:43:14,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:43:14,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345228422] [2022-11-16 11:43:14,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345228422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:14,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:14,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:43:14,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751048203] [2022-11-16 11:43:14,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:14,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:43:14,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:43:14,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:43:14,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:43:14,111 INFO L87 Difference]: Start difference. First operand 2649 states and 3371 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-16 11:43:28,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:28,342 INFO L93 Difference]: Finished difference Result 4902 states and 5774 transitions. [2022-11-16 11:43:28,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:43:28,344 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-16 11:43:28,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:28,362 INFO L225 Difference]: With dead ends: 4902 [2022-11-16 11:43:28,363 INFO L226 Difference]: Without dead ends: 4902 [2022-11-16 11:43:28,363 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-16 11:43:28,364 INFO L413 NwaCegarLoop]: 772 mSDtfsCounter, 4301 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 2713 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4311 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 2756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:28,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4311 Valid, 2059 Invalid, 2756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2713 Invalid, 0 Unknown, 0 Unchecked, 14.0s Time] [2022-11-16 11:43:28,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4902 states. [2022-11-16 11:43:28,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4902 to 3366. [2022-11-16 11:43:28,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3366 states, 2386 states have (on average 2.0352053646269908) internal successors, (4856), 3341 states have internal predecessors, (4856), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-16 11:43:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3366 states to 3366 states and 4906 transitions. [2022-11-16 11:43:28,470 INFO L78 Accepts]: Start accepts. Automaton has 3366 states and 4906 transitions. Word has length 7 [2022-11-16 11:43:28,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:28,470 INFO L495 AbstractCegarLoop]: Abstraction has 3366 states and 4906 transitions. [2022-11-16 11:43:28,471 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-16 11:43:28,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3366 states and 4906 transitions. [2022-11-16 11:43:28,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 11:43:28,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:28,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:28,493 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:43:28,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:28,687 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:43:28,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:28,691 INFO L85 PathProgramCache]: Analyzing trace with hash -305791726, now seen corresponding path program 1 times [2022-11-16 11:43:28,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:43:28,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42966618] [2022-11-16 11:43:28,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:28,694 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-16 11:43:28,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:43:28,696 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:28,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:28,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:43:28,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:28,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:43:28,978 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-16 11:43:28,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:43:28,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:43:28,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42966618] [2022-11-16 11:43:28,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42966618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:28,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:28,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:43:28,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437606594] [2022-11-16 11:43:28,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:28,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:43:28,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:43:28,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:43:28,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:43:28,983 INFO L87 Difference]: Start difference. First operand 3366 states and 4906 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-16 11:43:34,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:34,740 INFO L93 Difference]: Finished difference Result 4570 states and 6423 transitions. [2022-11-16 11:43:34,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:43:34,740 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-16 11:43:34,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:34,762 INFO L225 Difference]: With dead ends: 4570 [2022-11-16 11:43:34,763 INFO L226 Difference]: Without dead ends: 4570 [2022-11-16 11:43:34,763 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-16 11:43:34,764 INFO L413 NwaCegarLoop]: 1962 mSDtfsCounter, 1994 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2004 SdHoareTripleChecker+Valid, 2617 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:34,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2004 Valid, 2617 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-11-16 11:43:34,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4570 states. [2022-11-16 11:43:34,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4570 to 3275. [2022-11-16 11:43:34,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3275 states, 2386 states have (on average 1.9459346186085498) internal successors, (4643), 3250 states have internal predecessors, (4643), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-16 11:43:34,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 4693 transitions. [2022-11-16 11:43:34,884 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 4693 transitions. Word has length 8 [2022-11-16 11:43:34,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:34,893 INFO L495 AbstractCegarLoop]: Abstraction has 3275 states and 4693 transitions. [2022-11-16 11:43:34,894 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-16 11:43:34,894 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 4693 transitions. [2022-11-16 11:43:34,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 11:43:34,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:34,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:34,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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)] Ended with exit code 0 [2022-11-16 11:43:35,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:35,110 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:43:35,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:35,111 INFO L85 PathProgramCache]: Analyzing trace with hash -305791725, now seen corresponding path program 1 times [2022-11-16 11:43:35,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:43:35,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368621742] [2022-11-16 11:43:35,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:35,112 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-16 11:43:35,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:43:35,113 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:35,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:35,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:43:35,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:35,377 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-16 11:43:35,419 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-16 11:43:35,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:43:35,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:43:35,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368621742] [2022-11-16 11:43:35,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368621742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:35,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:35,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:43:35,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21502582] [2022-11-16 11:43:35,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:35,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:43:35,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:43:35,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:43:35,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:43:35,422 INFO L87 Difference]: Start difference. First operand 3275 states and 4693 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-16 11:43:44,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:44,501 INFO L93 Difference]: Finished difference Result 4992 states and 7052 transitions. [2022-11-16 11:43:44,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:43:44,502 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-16 11:43:44,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:44,523 INFO L225 Difference]: With dead ends: 4992 [2022-11-16 11:43:44,524 INFO L226 Difference]: Without dead ends: 4992 [2022-11-16 11:43:44,524 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-16 11:43:44,525 INFO L413 NwaCegarLoop]: 2343 mSDtfsCounter, 1371 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1375 SdHoareTripleChecker+Valid, 3327 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:44,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1375 Valid, 3327 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2022-11-16 11:43:44,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4992 states. [2022-11-16 11:43:44,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4992 to 3597. [2022-11-16 11:43:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3597 states, 2718 states have (on average 1.9334069168506254) internal successors, (5255), 3572 states have internal predecessors, (5255), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-16 11:43:44,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 5305 transitions. [2022-11-16 11:43:44,660 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 5305 transitions. Word has length 8 [2022-11-16 11:43:44,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:44,661 INFO L495 AbstractCegarLoop]: Abstraction has 3597 states and 5305 transitions. [2022-11-16 11:43:44,661 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-16 11:43:44,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 5305 transitions. [2022-11-16 11:43:44,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:43:44,662 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:44,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:44,686 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:44,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:44,863 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr658REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:43:44,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:44,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1045354379, now seen corresponding path program 1 times [2022-11-16 11:43:44,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:43:44,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125224762] [2022-11-16 11:43:44,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:44,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:43:44,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:43:44,867 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:44,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:45,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:43:45,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:45,155 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-16 11:43:45,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:43:45,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:43:45,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125224762] [2022-11-16 11:43:45,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125224762] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:45,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:45,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:43:45,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344185117] [2022-11-16 11:43:45,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:45,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:43:45,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:43:45,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:43:45,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:43:45,158 INFO L87 Difference]: Start difference. First operand 3597 states and 5305 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-16 11:43:45,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:45,219 INFO L93 Difference]: Finished difference Result 3537 states and 5219 transitions. [2022-11-16 11:43:45,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:43:45,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-16 11:43:45,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:45,235 INFO L225 Difference]: With dead ends: 3537 [2022-11-16 11:43:45,236 INFO L226 Difference]: Without dead ends: 3537 [2022-11-16 11:43:45,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:43:45,237 INFO L413 NwaCegarLoop]: 2007 mSDtfsCounter, 801 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 3219 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-16 11:43:45,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 3219 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:43:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3537 states. [2022-11-16 11:43:45,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3537 to 3537. [2022-11-16 11:43:45,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3537 states, 2682 states have (on average 1.9272930648769575) internal successors, (5169), 3512 states have internal predecessors, (5169), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-16 11:43:45,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3537 states to 3537 states and 5219 transitions. [2022-11-16 11:43:45,320 INFO L78 Accepts]: Start accepts. Automaton has 3537 states and 5219 transitions. Word has length 11 [2022-11-16 11:43:45,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:45,321 INFO L495 AbstractCegarLoop]: Abstraction has 3537 states and 5219 transitions. [2022-11-16 11:43:45,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-16 11:43:45,321 INFO L276 IsEmpty]: Start isEmpty. Operand 3537 states and 5219 transitions. [2022-11-16 11:43:45,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:43:45,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:45,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:45,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:43:45,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:45,537 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr682REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:43:45,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:45,538 INFO L85 PathProgramCache]: Analyzing trace with hash 436842575, now seen corresponding path program 1 times [2022-11-16 11:43:45,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:43:45,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912924491] [2022-11-16 11:43:45,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:45,539 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-16 11:43:45,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:43:45,541 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:45,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:45,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:43:45,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:45,796 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-16 11:43:45,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:43:45,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:43:45,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912924491] [2022-11-16 11:43:45,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912924491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:45,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:45,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:43:45,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965509373] [2022-11-16 11:43:45,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:45,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:43:45,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:43:45,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:43:45,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:43:45,799 INFO L87 Difference]: Start difference. First operand 3537 states and 5219 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-16 11:43:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:45,935 INFO L93 Difference]: Finished difference Result 3509 states and 5163 transitions. [2022-11-16 11:43:45,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:43:45,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-16 11:43:45,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:45,950 INFO L225 Difference]: With dead ends: 3509 [2022-11-16 11:43:45,951 INFO L226 Difference]: Without dead ends: 3509 [2022-11-16 11:43:45,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-16 11:43:45,952 INFO L413 NwaCegarLoop]: 1962 mSDtfsCounter, 782 mSDsluCounter, 3167 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 5129 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-16 11:43:45,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 5129 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:43:45,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3509 states. [2022-11-16 11:43:46,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3509 to 3507. [2022-11-16 11:43:46,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3507 states, 2666 states have (on average 1.9171042760690173) internal successors, (5111), 3482 states have internal predecessors, (5111), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-16 11:43:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3507 states to 3507 states and 5161 transitions. [2022-11-16 11:43:46,082 INFO L78 Accepts]: Start accepts. Automaton has 3507 states and 5161 transitions. Word has length 13 [2022-11-16 11:43:46,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:46,083 INFO L495 AbstractCegarLoop]: Abstraction has 3507 states and 5161 transitions. [2022-11-16 11:43:46,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-16 11:43:46,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3507 states and 5161 transitions. [2022-11-16 11:43:46,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 11:43:46,085 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:46,085 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-16 11:43:46,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:46,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:46,300 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:43:46,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:46,301 INFO L85 PathProgramCache]: Analyzing trace with hash 445820063, now seen corresponding path program 1 times [2022-11-16 11:43:46,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:43:46,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443990013] [2022-11-16 11:43:46,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:46,302 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-16 11:43:46,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:43:46,304 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:46,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:46,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:43:46,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:46,652 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-16 11:43:46,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:43:46,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:43:46,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443990013] [2022-11-16 11:43:46,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443990013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:46,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:46,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:43:46,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439531914] [2022-11-16 11:43:46,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:46,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:43:46,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:43:46,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:43:46,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:43:46,656 INFO L87 Difference]: Start difference. First operand 3507 states and 5161 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-16 11:43:46,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:46,736 INFO L93 Difference]: Finished difference Result 4755 states and 6516 transitions. [2022-11-16 11:43:46,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:43:46,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-16 11:43:46,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:46,768 INFO L225 Difference]: With dead ends: 4755 [2022-11-16 11:43:46,768 INFO L226 Difference]: Without dead ends: 4755 [2022-11-16 11:43:46,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-16 11:43:46,770 INFO L413 NwaCegarLoop]: 3293 mSDtfsCounter, 1888 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1898 SdHoareTripleChecker+Valid, 4697 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-16 11:43:46,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1898 Valid, 4697 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:43:46,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4755 states. [2022-11-16 11:43:46,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4755 to 3447. [2022-11-16 11:43:46,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3447 states, 2630 states have (on average 1.9106463878326996) internal successors, (5025), 3422 states have internal predecessors, (5025), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-16 11:43:46,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 3447 states and 5075 transitions. [2022-11-16 11:43:46,888 INFO L78 Accepts]: Start accepts. Automaton has 3447 states and 5075 transitions. Word has length 20 [2022-11-16 11:43:46,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:46,890 INFO L495 AbstractCegarLoop]: Abstraction has 3447 states and 5075 transitions. [2022-11-16 11:43:46,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-16 11:43:46,891 INFO L276 IsEmpty]: Start isEmpty. Operand 3447 states and 5075 transitions. [2022-11-16 11:43:46,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 11:43:46,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:46,892 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-16 11:43:46,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:47,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:47,110 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr334REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:43:47,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:47,110 INFO L85 PathProgramCache]: Analyzing trace with hash 413623007, now seen corresponding path program 1 times [2022-11-16 11:43:47,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:43:47,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258864012] [2022-11-16 11:43:47,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:47,111 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-16 11:43:47,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:43:47,114 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:47,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:47,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:43:47,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:47,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-16 11:43:47,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:43:47,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:43:47,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258864012] [2022-11-16 11:43:47,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258864012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:47,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:47,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:43:47,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34786477] [2022-11-16 11:43:47,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:47,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:43:47,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:43:47,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:43:47,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:43:47,444 INFO L87 Difference]: Start difference. First operand 3447 states and 5075 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-16 11:43:47,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:47,520 INFO L93 Difference]: Finished difference Result 4588 states and 6225 transitions. [2022-11-16 11:43:47,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:43:47,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-16 11:43:47,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:47,534 INFO L225 Difference]: With dead ends: 4588 [2022-11-16 11:43:47,535 INFO L226 Difference]: Without dead ends: 4588 [2022-11-16 11:43:47,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-16 11:43:47,536 INFO L413 NwaCegarLoop]: 3202 mSDtfsCounter, 1845 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1855 SdHoareTripleChecker+Valid, 4558 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-16 11:43:47,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1855 Valid, 4558 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:43:47,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4588 states. [2022-11-16 11:43:47,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4588 to 3315. [2022-11-16 11:43:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3315 states, 2522 states have (on average 1.8901665344964313) internal successors, (4767), 3290 states have internal predecessors, (4767), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-16 11:43:47,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3315 states to 3315 states and 4817 transitions. [2022-11-16 11:43:47,611 INFO L78 Accepts]: Start accepts. Automaton has 3315 states and 4817 transitions. Word has length 20 [2022-11-16 11:43:47,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:47,612 INFO L495 AbstractCegarLoop]: Abstraction has 3315 states and 4817 transitions. [2022-11-16 11:43:47,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-16 11:43:47,612 INFO L276 IsEmpty]: Start isEmpty. Operand 3315 states and 4817 transitions. [2022-11-16 11:43:47,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 11:43:47,613 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:47,613 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] [2022-11-16 11:43:47,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-16 11:43:47,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:47,828 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:43:47,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:47,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1063651591, now seen corresponding path program 1 times [2022-11-16 11:43:47,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:43:47,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164795114] [2022-11-16 11:43:47,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:47,830 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-16 11:43:47,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:43:47,832 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:47,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:48,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:43:48,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:48,214 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-16 11:43:48,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:43:48,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:43:48,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164795114] [2022-11-16 11:43:48,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164795114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:48,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:48,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:43:48,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580402750] [2022-11-16 11:43:48,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:48,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:43:48,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:43:48,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:43:48,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:43:48,218 INFO L87 Difference]: Start difference. First operand 3315 states and 4817 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-16 11:43:48,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:48,407 INFO L93 Difference]: Finished difference Result 4553 states and 6159 transitions. [2022-11-16 11:43:48,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:43:48,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2022-11-16 11:43:48,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:48,419 INFO L225 Difference]: With dead ends: 4553 [2022-11-16 11:43:48,419 INFO L226 Difference]: Without dead ends: 4553 [2022-11-16 11:43:48,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-16 11:43:48,420 INFO L413 NwaCegarLoop]: 3162 mSDtfsCounter, 1826 mSDsluCounter, 4516 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1836 SdHoareTripleChecker+Valid, 7678 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-16 11:43:48,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1836 Valid, 7678 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:43:48,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4553 states. [2022-11-16 11:43:48,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4553 to 3285. [2022-11-16 11:43:48,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3285 states, 2506 states have (on average 1.8790901835594573) internal successors, (4709), 3260 states have internal predecessors, (4709), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-16 11:43:48,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3285 states to 3285 states and 4759 transitions. [2022-11-16 11:43:48,502 INFO L78 Accepts]: Start accepts. Automaton has 3285 states and 4759 transitions. Word has length 22 [2022-11-16 11:43:48,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:48,502 INFO L495 AbstractCegarLoop]: Abstraction has 3285 states and 4759 transitions. [2022-11-16 11:43:48,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-16 11:43:48,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3285 states and 4759 transitions. [2022-11-16 11:43:48,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 11:43:48,508 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:48,509 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] [2022-11-16 11:43:48,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-16 11:43:48,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:48,725 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr358REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:43:48,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:48,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1940223495, now seen corresponding path program 1 times [2022-11-16 11:43:48,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:43:48,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151101170] [2022-11-16 11:43:48,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:48,727 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-16 11:43:48,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:43:48,729 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:48,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:49,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:43:49,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:49,101 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-16 11:43:49,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:43:49,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:43:49,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151101170] [2022-11-16 11:43:49,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151101170] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:49,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:49,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:43:49,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005610589] [2022-11-16 11:43:49,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:49,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:43:49,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:43:49,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:43:49,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:43:49,105 INFO L87 Difference]: Start difference. First operand 3285 states and 4759 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-16 11:43:49,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:49,261 INFO L93 Difference]: Finished difference Result 4480 states and 5970 transitions. [2022-11-16 11:43:49,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:43:49,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2022-11-16 11:43:49,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:49,274 INFO L225 Difference]: With dead ends: 4480 [2022-11-16 11:43:49,274 INFO L226 Difference]: Without dead ends: 4480 [2022-11-16 11:43:49,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-16 11:43:49,275 INFO L413 NwaCegarLoop]: 3087 mSDtfsCounter, 1791 mSDsluCounter, 4401 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1801 SdHoareTripleChecker+Valid, 7488 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-16 11:43:49,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1801 Valid, 7488 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:43:49,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4480 states. [2022-11-16 11:43:49,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4480 to 3223. [2022-11-16 11:43:49,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3223 states, 2458 states have (on average 1.8449959316517495) internal successors, (4535), 3198 states have internal predecessors, (4535), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-16 11:43:49,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 3223 states and 4585 transitions. [2022-11-16 11:43:49,365 INFO L78 Accepts]: Start accepts. Automaton has 3223 states and 4585 transitions. Word has length 22 [2022-11-16 11:43:49,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:49,366 INFO L495 AbstractCegarLoop]: Abstraction has 3223 states and 4585 transitions. [2022-11-16 11:43:49,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-16 11:43:49,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3223 states and 4585 transitions. [2022-11-16 11:43:49,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 11:43:49,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:49,367 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] [2022-11-16 11:43:49,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:49,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:49,583 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr696REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:43:49,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:49,584 INFO L85 PathProgramCache]: Analyzing trace with hash 558613821, now seen corresponding path program 1 times [2022-11-16 11:43:49,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:43:49,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676219251] [2022-11-16 11:43:49,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:49,585 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-16 11:43:49,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:43:49,586 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:49,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:49,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:43:49,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:49,887 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-16 11:43:50,004 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-16 11:43:50,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:43:50,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:43:50,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676219251] [2022-11-16 11:43:50,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [676219251] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:50,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:50,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:43:50,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401058283] [2022-11-16 11:43:50,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:50,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:43:50,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:43:50,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:43:50,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:43:50,007 INFO L87 Difference]: Start difference. First operand 3223 states and 4585 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-16 11:43:55,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:55,553 INFO L93 Difference]: Finished difference Result 3497 states and 4756 transitions. [2022-11-16 11:43:55,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:43:55,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2022-11-16 11:43:55,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:55,563 INFO L225 Difference]: With dead ends: 3497 [2022-11-16 11:43:55,563 INFO L226 Difference]: Without dead ends: 3497 [2022-11-16 11:43:55,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-16 11:43:55,564 INFO L413 NwaCegarLoop]: 1119 mSDtfsCounter, 2359 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2365 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:55,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2365 Valid, 2007 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-11-16 11:43:55,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3497 states. [2022-11-16 11:43:55,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3497 to 3219. [2022-11-16 11:43:55,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 2458 states have (on average 1.8417412530512611) internal successors, (4527), 3194 states have internal predecessors, (4527), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-16 11:43:55,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 4577 transitions. [2022-11-16 11:43:55,645 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 4577 transitions. Word has length 27 [2022-11-16 11:43:55,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:55,645 INFO L495 AbstractCegarLoop]: Abstraction has 3219 states and 4577 transitions. [2022-11-16 11:43:55,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-16 11:43:55,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 4577 transitions. [2022-11-16 11:43:55,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 11:43:55,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:55,648 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] [2022-11-16 11:43:55,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:55,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:55,868 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr697REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:43:55,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:55,869 INFO L85 PathProgramCache]: Analyzing trace with hash 558613822, now seen corresponding path program 1 times [2022-11-16 11:43:55,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:43:55,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833223288] [2022-11-16 11:43:55,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:55,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:43:55,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:43:55,872 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:55,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:43:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:56,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:43:56,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:56,150 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-16 11:43:56,383 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-16 11:43:56,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:43:56,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:43:56,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833223288] [2022-11-16 11:43:56,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833223288] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:56,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:56,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:43:56,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483406894] [2022-11-16 11:43:56,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:56,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:43:56,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:43:56,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:43:56,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:43:56,385 INFO L87 Difference]: Start difference. First operand 3219 states and 4577 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-16 11:44:05,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:44:05,215 INFO L93 Difference]: Finished difference Result 3921 states and 5351 transitions. [2022-11-16 11:44:05,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:44:05,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2022-11-16 11:44:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:44:05,226 INFO L225 Difference]: With dead ends: 3921 [2022-11-16 11:44:05,226 INFO L226 Difference]: Without dead ends: 3921 [2022-11-16 11:44:05,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-16 11:44:05,227 INFO L413 NwaCegarLoop]: 1536 mSDtfsCounter, 1488 mSDsluCounter, 1927 mSDsCounter, 0 mSdLazyCounter, 2011 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 3463 SdHoareTripleChecker+Invalid, 2022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:44:05,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 3463 Invalid, 2022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2011 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2022-11-16 11:44:05,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3921 states. [2022-11-16 11:44:05,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3921 to 3255. [2022-11-16 11:44:05,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3255 states, 2494 states have (on average 1.8315958299919808) internal successors, (4568), 3230 states have internal predecessors, (4568), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-16 11:44:05,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4618 transitions. [2022-11-16 11:44:05,294 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4618 transitions. Word has length 27 [2022-11-16 11:44:05,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:44:05,294 INFO L495 AbstractCegarLoop]: Abstraction has 3255 states and 4618 transitions. [2022-11-16 11:44:05,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-16 11:44:05,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4618 transitions. [2022-11-16 11:44:05,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 11:44:05,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:44:05,296 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] [2022-11-16 11:44:05,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:05,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:05,517 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:44:05,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:44:05,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128551, now seen corresponding path program 1 times [2022-11-16 11:44:05,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:44:05,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854465274] [2022-11-16 11:44:05,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:44:05,519 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-16 11:44:05,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:44:05,521 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:05,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:05,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:44:05,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:44:05,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:44:06,006 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-16 11:44:06,006 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:44:06,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:44:06,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854465274] [2022-11-16 11:44:06,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854465274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:44:06,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:44:06,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:44:06,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268430183] [2022-11-16 11:44:06,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:44:06,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:44:06,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:44:06,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:44:06,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:44:06,008 INFO L87 Difference]: Start difference. First operand 3255 states and 4618 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-16 11:44:14,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:44:14,377 INFO L93 Difference]: Finished difference Result 6298 states and 8778 transitions. [2022-11-16 11:44:14,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:44:14,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-11-16 11:44:14,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:44:14,399 INFO L225 Difference]: With dead ends: 6298 [2022-11-16 11:44:14,399 INFO L226 Difference]: Without dead ends: 6298 [2022-11-16 11:44:14,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-16 11:44:14,400 INFO L413 NwaCegarLoop]: 2131 mSDtfsCounter, 3914 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3921 SdHoareTripleChecker+Valid, 3965 SdHoareTripleChecker+Invalid, 2420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:44:14,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3921 Valid, 3965 Invalid, 2420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2022-11-16 11:44:14,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6298 states. [2022-11-16 11:44:14,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6298 to 3251. [2022-11-16 11:44:14,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3251 states, 2494 states have (on average 1.8283881315156376) internal successors, (4560), 3226 states have internal predecessors, (4560), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-16 11:44:14,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3251 states to 3251 states and 4610 transitions. [2022-11-16 11:44:14,477 INFO L78 Accepts]: Start accepts. Automaton has 3251 states and 4610 transitions. Word has length 36 [2022-11-16 11:44:14,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:44:14,477 INFO L495 AbstractCegarLoop]: Abstraction has 3251 states and 4610 transitions. [2022-11-16 11:44:14,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-16 11:44:14,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3251 states and 4610 transitions. [2022-11-16 11:44:14,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 11:44:14,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:44:14,480 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] [2022-11-16 11:44:14,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:14,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:14,696 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:44:14,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:44:14,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128552, now seen corresponding path program 1 times [2022-11-16 11:44:14,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:44:14,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954454790] [2022-11-16 11:44:14,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:44:14,698 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-16 11:44:14,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:44:14,699 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:14,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:15,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:44:15,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:44:15,079 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-16 11:44:15,364 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-16 11:44:15,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:44:15,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:44:15,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954454790] [2022-11-16 11:44:15,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954454790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:44:15,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:44:15,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:44:15,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113944318] [2022-11-16 11:44:15,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:44:15,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:44:15,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:44:15,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:44:15,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:44:15,367 INFO L87 Difference]: Start difference. First operand 3251 states and 4610 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-16 11:44:27,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:44:27,776 INFO L93 Difference]: Finished difference Result 5969 states and 8158 transitions. [2022-11-16 11:44:27,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:44:27,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-11-16 11:44:27,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:44:27,791 INFO L225 Difference]: With dead ends: 5969 [2022-11-16 11:44:27,792 INFO L226 Difference]: Without dead ends: 5969 [2022-11-16 11:44:27,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-16 11:44:27,793 INFO L413 NwaCegarLoop]: 2587 mSDtfsCounter, 2437 mSDsluCounter, 2285 mSDsCounter, 0 mSdLazyCounter, 2709 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2441 SdHoareTripleChecker+Valid, 4872 SdHoareTripleChecker+Invalid, 2721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:44:27,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2441 Valid, 4872 Invalid, 2721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2709 Invalid, 0 Unknown, 0 Unchecked, 12.2s Time] [2022-11-16 11:44:27,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2022-11-16 11:44:27,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 3247. [2022-11-16 11:44:27,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3247 states, 2494 states have (on average 1.8251804330392942) internal successors, (4552), 3222 states have internal predecessors, (4552), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-16 11:44:27,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3247 states to 3247 states and 4602 transitions. [2022-11-16 11:44:27,869 INFO L78 Accepts]: Start accepts. Automaton has 3247 states and 4602 transitions. Word has length 36 [2022-11-16 11:44:27,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:44:27,869 INFO L495 AbstractCegarLoop]: Abstraction has 3247 states and 4602 transitions. [2022-11-16 11:44:27,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-16 11:44:27,870 INFO L276 IsEmpty]: Start isEmpty. Operand 3247 states and 4602 transitions. [2022-11-16 11:44:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 11:44:27,871 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:44:27,871 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] [2022-11-16 11:44:27,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:28,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:28,087 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr372REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:44:28,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:44:28,087 INFO L85 PathProgramCache]: Analyzing trace with hash -775407193, now seen corresponding path program 1 times [2022-11-16 11:44:28,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:44:28,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273225753] [2022-11-16 11:44:28,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:44:28,088 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-16 11:44:28,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:44:28,090 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:28,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:28,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:44:28,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:44:28,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:44:28,623 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-16 11:44:28,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:44:28,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:44:28,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273225753] [2022-11-16 11:44:28,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273225753] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:44:28,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:44:28,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:44:28,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004393813] [2022-11-16 11:44:28,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:44:28,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:44:28,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:44:28,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:44:28,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:44:28,626 INFO L87 Difference]: Start difference. First operand 3247 states and 4602 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-16 11:44:38,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:44:38,191 INFO L93 Difference]: Finished difference Result 6741 states and 9288 transitions. [2022-11-16 11:44:38,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:44:38,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-11-16 11:44:38,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:44:38,209 INFO L225 Difference]: With dead ends: 6741 [2022-11-16 11:44:38,225 INFO L226 Difference]: Without dead ends: 6741 [2022-11-16 11:44:38,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-16 11:44:38,227 INFO L413 NwaCegarLoop]: 1959 mSDtfsCounter, 4484 mSDsluCounter, 2021 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4494 SdHoareTripleChecker+Valid, 3980 SdHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:44:38,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4494 Valid, 3980 Invalid, 2605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2022-11-16 11:44:38,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6741 states. [2022-11-16 11:44:38,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6741 to 3244. [2022-11-16 11:44:38,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3244 states, 2494 states have (on average 1.8163592622293505) internal successors, (4530), 3219 states have internal predecessors, (4530), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-16 11:44:38,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 4580 transitions. [2022-11-16 11:44:38,339 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 4580 transitions. Word has length 36 [2022-11-16 11:44:38,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:44:38,339 INFO L495 AbstractCegarLoop]: Abstraction has 3244 states and 4580 transitions. [2022-11-16 11:44:38,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-16 11:44:38,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 4580 transitions. [2022-11-16 11:44:38,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 11:44:38,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:44:38,341 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] [2022-11-16 11:44:38,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-16 11:44:38,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:38,558 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr373REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:44:38,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:44:38,558 INFO L85 PathProgramCache]: Analyzing trace with hash -775407192, now seen corresponding path program 1 times [2022-11-16 11:44:38,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:44:38,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079553717] [2022-11-16 11:44:38,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:44:38,559 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-16 11:44:38,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:44:38,561 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:38,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:38,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:44:38,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:44:38,952 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-16 11:44:39,234 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-16 11:44:39,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:44:39,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:44:39,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079553717] [2022-11-16 11:44:39,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079553717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:44:39,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:44:39,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:44:39,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486581245] [2022-11-16 11:44:39,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:44:39,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:44:39,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:44:39,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:44:39,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:44:39,237 INFO L87 Difference]: Start difference. First operand 3244 states and 4580 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-16 11:44:49,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:44:49,604 INFO L93 Difference]: Finished difference Result 4803 states and 6543 transitions. [2022-11-16 11:44:49,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:44:49,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-11-16 11:44:49,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:44:49,613 INFO L225 Difference]: With dead ends: 4803 [2022-11-16 11:44:49,613 INFO L226 Difference]: Without dead ends: 4803 [2022-11-16 11:44:49,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-16 11:44:49,614 INFO L413 NwaCegarLoop]: 2234 mSDtfsCounter, 2208 mSDsluCounter, 1857 mSDsCounter, 0 mSdLazyCounter, 2217 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2208 SdHoareTripleChecker+Valid, 4091 SdHoareTripleChecker+Invalid, 2229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:44:49,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2208 Valid, 4091 Invalid, 2229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2217 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2022-11-16 11:44:49,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4803 states. [2022-11-16 11:44:49,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4803 to 3244. [2022-11-16 11:44:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3244 states, 2494 states have (on average 1.8131515637530071) internal successors, (4522), 3219 states have internal predecessors, (4522), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-16 11:44:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 4572 transitions. [2022-11-16 11:44:49,681 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 4572 transitions. Word has length 36 [2022-11-16 11:44:49,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:44:49,682 INFO L495 AbstractCegarLoop]: Abstraction has 3244 states and 4572 transitions. [2022-11-16 11:44:49,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-16 11:44:49,682 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 4572 transitions. [2022-11-16 11:44:49,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-16 11:44:49,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:44:49,683 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] [2022-11-16 11:44:49,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:49,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:49,899 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:44:49,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:44:49,900 INFO L85 PathProgramCache]: Analyzing trace with hash -715750141, now seen corresponding path program 1 times [2022-11-16 11:44:49,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:44:49,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95161486] [2022-11-16 11:44:49,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:44:49,901 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-16 11:44:49,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:44:49,903 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:49,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:50,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:44:50,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:44:50,293 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-16 11:44:50,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:44:50,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:44:50,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95161486] [2022-11-16 11:44:50,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95161486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:44:50,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:44:50,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:44:50,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128157681] [2022-11-16 11:44:50,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:44:50,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:44:50,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:44:50,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:44:50,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:44:50,296 INFO L87 Difference]: Start difference. First operand 3244 states and 4572 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-16 11:44:50,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:44:50,403 INFO L93 Difference]: Finished difference Result 3232 states and 4548 transitions. [2022-11-16 11:44:50,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:44:50,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2022-11-16 11:44:50,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:44:50,412 INFO L225 Difference]: With dead ends: 3232 [2022-11-16 11:44:50,412 INFO L226 Difference]: Without dead ends: 3232 [2022-11-16 11:44:50,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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-16 11:44:50,414 INFO L413 NwaCegarLoop]: 1793 mSDtfsCounter, 759 mSDsluCounter, 2817 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 4610 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.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:44:50,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 4610 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:44:50,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2022-11-16 11:44:50,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 3232. [2022-11-16 11:44:50,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3232 states, 2482 states have (on average 1.8122481869460112) internal successors, (4498), 3207 states have internal predecessors, (4498), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-16 11:44:50,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3232 states to 3232 states and 4548 transitions. [2022-11-16 11:44:50,471 INFO L78 Accepts]: Start accepts. Automaton has 3232 states and 4548 transitions. Word has length 40 [2022-11-16 11:44:50,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:44:50,472 INFO L495 AbstractCegarLoop]: Abstraction has 3232 states and 4548 transitions. [2022-11-16 11:44:50,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-16 11:44:50,472 INFO L276 IsEmpty]: Start isEmpty. Operand 3232 states and 4548 transitions. [2022-11-16 11:44:50,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-16 11:44:50,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:44:50,473 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] [2022-11-16 11:44:50,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:50,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:50,699 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:44:50,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:44:50,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1005839671, now seen corresponding path program 1 times [2022-11-16 11:44:50,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:44:50,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720320352] [2022-11-16 11:44:50,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:44:50,701 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-16 11:44:50,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:44:50,702 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:50,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:51,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:44:51,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:44:51,403 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-16 11:44:51,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:44:51,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:44:51,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720320352] [2022-11-16 11:44:51,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1720320352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:44:51,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:44:51,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:44:51,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481679090] [2022-11-16 11:44:51,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:44:51,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:44:51,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:44:51,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:44:51,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:44:51,406 INFO L87 Difference]: Start difference. First operand 3232 states and 4548 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-16 11:44:51,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:44:51,698 INFO L93 Difference]: Finished difference Result 4679 states and 6365 transitions. [2022-11-16 11:44:51,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:44:51,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2022-11-16 11:44:51,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:44:51,708 INFO L225 Difference]: With dead ends: 4679 [2022-11-16 11:44:51,708 INFO L226 Difference]: Without dead ends: 4679 [2022-11-16 11:44:51,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-16 11:44:51,709 INFO L413 NwaCegarLoop]: 1813 mSDtfsCounter, 1178 mSDsluCounter, 1678 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 3491 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:44:51,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 3491 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:44:51,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4679 states. [2022-11-16 11:44:51,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4679 to 4015. [2022-11-16 11:44:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4015 states, 3261 states have (on average 1.7985280588776449) internal successors, (5865), 3983 states have internal predecessors, (5865), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-11-16 11:44:51,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4015 states to 4015 states and 5929 transitions. [2022-11-16 11:44:51,788 INFO L78 Accepts]: Start accepts. Automaton has 4015 states and 5929 transitions. Word has length 48 [2022-11-16 11:44:51,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:44:51,788 INFO L495 AbstractCegarLoop]: Abstraction has 4015 states and 5929 transitions. [2022-11-16 11:44:51,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-16 11:44:51,789 INFO L276 IsEmpty]: Start isEmpty. Operand 4015 states and 5929 transitions. [2022-11-16 11:44:51,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 11:44:51,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:44:51,790 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] [2022-11-16 11:44:51,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:52,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:52,014 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:44:52,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:44:52,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1815084135, now seen corresponding path program 1 times [2022-11-16 11:44:52,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:44:52,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782166740] [2022-11-16 11:44:52,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:44:52,015 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-16 11:44:52,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:44:52,017 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:52,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:52,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:44:52,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:44:52,512 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-16 11:44:52,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:44:52,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:44:52,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782166740] [2022-11-16 11:44:52,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782166740] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:44:52,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:44:52,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:44:52,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169275421] [2022-11-16 11:44:52,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:44:52,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:44:52,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:44:52,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:44:52,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:44:52,516 INFO L87 Difference]: Start difference. First operand 4015 states and 5929 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-16 11:44:52,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:44:52,665 INFO L93 Difference]: Finished difference Result 4953 states and 6910 transitions. [2022-11-16 11:44:52,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:44:52,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 51 [2022-11-16 11:44:52,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:44:52,676 INFO L225 Difference]: With dead ends: 4953 [2022-11-16 11:44:52,676 INFO L226 Difference]: Without dead ends: 4953 [2022-11-16 11:44:52,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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-16 11:44:52,678 INFO L413 NwaCegarLoop]: 2861 mSDtfsCounter, 1754 mSDsluCounter, 3951 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1764 SdHoareTripleChecker+Valid, 6812 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.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:44:52,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1764 Valid, 6812 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:44:52,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4953 states. [2022-11-16 11:44:52,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4953 to 3973. [2022-11-16 11:44:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3973 states, 3219 states have (on average 1.8002485243864554) internal successors, (5795), 3941 states have internal predecessors, (5795), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-11-16 11:44:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 5859 transitions. [2022-11-16 11:44:52,765 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 5859 transitions. Word has length 51 [2022-11-16 11:44:52,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:44:52,765 INFO L495 AbstractCegarLoop]: Abstraction has 3973 states and 5859 transitions. [2022-11-16 11:44:52,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-16 11:44:52,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 5859 transitions. [2022-11-16 11:44:52,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-16 11:44:52,767 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:44:52,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:44:52,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:52,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:52,980 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:44:52,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:44:52,981 INFO L85 PathProgramCache]: Analyzing trace with hash -273786554, now seen corresponding path program 1 times [2022-11-16 11:44:52,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:44:52,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832548553] [2022-11-16 11:44:52,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:44:52,982 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-16 11:44:52,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:44:52,984 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:53,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:53,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:44:53,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:44:53,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:44:53,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:44:53,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:44:53,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832548553] [2022-11-16 11:44:53,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832548553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:44:53,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:44:53,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:44:53,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088473284] [2022-11-16 11:44:53,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:44:53,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:44:53,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:44:53,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:44:53,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:44:53,533 INFO L87 Difference]: Start difference. First operand 3973 states and 5859 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-16 11:44:53,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:44:53,683 INFO L93 Difference]: Finished difference Result 4690 states and 6398 transitions. [2022-11-16 11:44:53,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:44:53,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 54 [2022-11-16 11:44:53,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:44:53,692 INFO L225 Difference]: With dead ends: 4690 [2022-11-16 11:44:53,692 INFO L226 Difference]: Without dead ends: 4690 [2022-11-16 11:44:53,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:44:53,695 INFO L413 NwaCegarLoop]: 2901 mSDtfsCounter, 1745 mSDsluCounter, 4040 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1755 SdHoareTripleChecker+Valid, 6941 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.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:44:53,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1755 Valid, 6941 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:44:53,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4690 states. [2022-11-16 11:44:53,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4690 to 3955. [2022-11-16 11:44:53,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3955 states, 3201 states have (on average 1.8009996875976257) internal successors, (5765), 3923 states have internal predecessors, (5765), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-11-16 11:44:53,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3955 states to 3955 states and 5829 transitions. [2022-11-16 11:44:53,770 INFO L78 Accepts]: Start accepts. Automaton has 3955 states and 5829 transitions. Word has length 54 [2022-11-16 11:44:53,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:44:53,770 INFO L495 AbstractCegarLoop]: Abstraction has 3955 states and 5829 transitions. [2022-11-16 11:44:53,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-16 11:44:53,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3955 states and 5829 transitions. [2022-11-16 11:44:53,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-16 11:44:53,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:44:53,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:44:53,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:53,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:53,992 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:44:53,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:44:53,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1488707999, now seen corresponding path program 1 times [2022-11-16 11:44:53,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:44:53,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851912979] [2022-11-16 11:44:53,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:44:53,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:44:53,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:44:53,995 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:54,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:54,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:44:54,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:44:54,486 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:44:54,487 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:44:54,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 38 [2022-11-16 11:44:54,568 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:44:54,569 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 62 treesize of output 22 [2022-11-16 11:44:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:44:54,618 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:44:54,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:44:54,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851912979] [2022-11-16 11:44:54,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [851912979] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:44:54,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:44:54,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:44:54,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892174990] [2022-11-16 11:44:54,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:44:54,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:44:54,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:44:54,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:44:54,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:44:54,621 INFO L87 Difference]: Start difference. First operand 3955 states and 5829 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:44:57,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:44:57,313 INFO L93 Difference]: Finished difference Result 3921 states and 5794 transitions. [2022-11-16 11:44:57,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:44:57,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-11-16 11:44:57,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:44:57,319 INFO L225 Difference]: With dead ends: 3921 [2022-11-16 11:44:57,319 INFO L226 Difference]: Without dead ends: 3921 [2022-11-16 11:44:57,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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-16 11:44:57,320 INFO L413 NwaCegarLoop]: 1691 mSDtfsCounter, 759 mSDsluCounter, 2556 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 4247 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:44:57,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 4247 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 277 Invalid, 0 Unknown, 112 Unchecked, 2.6s Time] [2022-11-16 11:44:57,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3921 states. [2022-11-16 11:44:57,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3921 to 3921. [2022-11-16 11:44:57,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3921 states, 3167 states have (on average 1.8092832333438584) internal successors, (5730), 3889 states have internal predecessors, (5730), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-11-16 11:44:57,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 5794 transitions. [2022-11-16 11:44:57,388 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 5794 transitions. Word has length 57 [2022-11-16 11:44:57,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:44:57,389 INFO L495 AbstractCegarLoop]: Abstraction has 3921 states and 5794 transitions. [2022-11-16 11:44:57,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:44:57,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 5794 transitions. [2022-11-16 11:44:57,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 11:44:57,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:44:57,390 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] [2022-11-16 11:44:57,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-11-16 11:44:57,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:57,607 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:44:57,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:44:57,607 INFO L85 PathProgramCache]: Analyzing trace with hash 2076762779, now seen corresponding path program 1 times [2022-11-16 11:44:57,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:44:57,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304157503] [2022-11-16 11:44:57,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:44:57,608 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-16 11:44:57,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:44:57,610 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:57,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:58,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:44:58,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:44:58,499 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-16 11:44:58,500 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:44:58,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:44:58,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1304157503] [2022-11-16 11:44:58,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1304157503] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:44:58,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:44:58,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:44:58,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423022390] [2022-11-16 11:44:58,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:44:58,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:44:58,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:44:58,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:44:58,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:44:58,502 INFO L87 Difference]: Start difference. First operand 3921 states and 5794 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-16 11:44:58,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:44:58,783 INFO L93 Difference]: Finished difference Result 5180 states and 7386 transitions. [2022-11-16 11:44:58,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:44:58,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 59 [2022-11-16 11:44:58,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:44:58,793 INFO L225 Difference]: With dead ends: 5180 [2022-11-16 11:44:58,793 INFO L226 Difference]: Without dead ends: 5180 [2022-11-16 11:44:58,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 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-16 11:44:58,799 INFO L413 NwaCegarLoop]: 1937 mSDtfsCounter, 867 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 3605 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:44:58,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 3605 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:44:58,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5180 states. [2022-11-16 11:44:58,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5180 to 4837. [2022-11-16 11:44:58,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4837 states, 4077 states have (on average 1.7888153053715967) internal successors, (7293), 4796 states have internal predecessors, (7293), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-11-16 11:44:58,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4837 states to 4837 states and 7375 transitions. [2022-11-16 11:44:58,940 INFO L78 Accepts]: Start accepts. Automaton has 4837 states and 7375 transitions. Word has length 59 [2022-11-16 11:44:58,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:44:58,941 INFO L495 AbstractCegarLoop]: Abstraction has 4837 states and 7375 transitions. [2022-11-16 11:44:58,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-16 11:44:58,941 INFO L276 IsEmpty]: Start isEmpty. Operand 4837 states and 7375 transitions. [2022-11-16 11:44:58,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-16 11:44:58,942 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:44:58,942 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:44:58,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:59,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:59,143 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:44:59,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:44:59,144 INFO L85 PathProgramCache]: Analyzing trace with hash -45497454, now seen corresponding path program 1 times [2022-11-16 11:44:59,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:44:59,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97742391] [2022-11-16 11:44:59,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:44:59,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:44:59,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:44:59,146 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:44:59,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-16 11:44:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:59,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 11:44:59,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:44:59,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:44:59,812 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-16 11:45:00,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:45:00,534 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-16 11:45:00,557 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:45:00,557 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-16 11:45:00,578 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-16 11:45:00,578 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:45:00,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:45:00,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97742391] [2022-11-16 11:45:00,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97742391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:45:00,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:45:00,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:45:00,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461327855] [2022-11-16 11:45:00,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:45:00,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:45:00,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:45:00,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:45:00,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:45:00,581 INFO L87 Difference]: Start difference. First operand 4837 states and 7375 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-16 11:45:08,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:08,557 INFO L93 Difference]: Finished difference Result 6868 states and 10388 transitions. [2022-11-16 11:45:08,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:45:08,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2022-11-16 11:45:08,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:08,566 INFO L225 Difference]: With dead ends: 6868 [2022-11-16 11:45:08,567 INFO L226 Difference]: Without dead ends: 6868 [2022-11-16 11:45:08,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 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-16 11:45:08,568 INFO L413 NwaCegarLoop]: 638 mSDtfsCounter, 2477 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2491 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:08,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2491 Valid, 1071 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-11-16 11:45:08,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6868 states. [2022-11-16 11:45:08,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6868 to 4597. [2022-11-16 11:45:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4597 states, 3921 states have (on average 1.7118082121907676) internal successors, (6712), 4556 states have internal predecessors, (6712), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-11-16 11:45:08,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4597 states to 4597 states and 6794 transitions. [2022-11-16 11:45:08,659 INFO L78 Accepts]: Start accepts. Automaton has 4597 states and 6794 transitions. Word has length 62 [2022-11-16 11:45:08,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:08,660 INFO L495 AbstractCegarLoop]: Abstraction has 4597 states and 6794 transitions. [2022-11-16 11:45:08,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-16 11:45:08,661 INFO L276 IsEmpty]: Start isEmpty. Operand 4597 states and 6794 transitions. [2022-11-16 11:45:08,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-16 11:45:08,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:08,662 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] [2022-11-16 11:45:08,686 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-16 11:45:08,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:45:08,875 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:45:08,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:08,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391416, now seen corresponding path program 1 times [2022-11-16 11:45:08,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:45:08,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980694006] [2022-11-16 11:45:08,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:08,877 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-16 11:45:08,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:45:08,880 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:45:08,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:45:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:09,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:45:09,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:45:09,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:45:09,494 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-16 11:45:09,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 23 treesize of output 11 [2022-11-16 11:45:09,563 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-16 11:45:09,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:45:09,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:45:09,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980694006] [2022-11-16 11:45:09,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980694006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:45:09,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:45:09,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:45:09,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109684267] [2022-11-16 11:45:09,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:45:09,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:45:09,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:45:09,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:45:09,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:45:09,566 INFO L87 Difference]: Start difference. First operand 4597 states and 6794 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-16 11:45:16,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:16,581 INFO L93 Difference]: Finished difference Result 4596 states and 6791 transitions. [2022-11-16 11:45:16,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:45:16,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2022-11-16 11:45:16,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:16,588 INFO L225 Difference]: With dead ends: 4596 [2022-11-16 11:45:16,588 INFO L226 Difference]: Without dead ends: 4596 [2022-11-16 11:45:16,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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-16 11:45:16,589 INFO L413 NwaCegarLoop]: 1712 mSDtfsCounter, 4 mSDsluCounter, 2861 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4573 SdHoareTripleChecker+Invalid, 2281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:16,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4573 Invalid, 2281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-11-16 11:45:16,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4596 states. [2022-11-16 11:45:16,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4596 to 4596. [2022-11-16 11:45:16,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4596 states, 3921 states have (on average 1.7110431012496812) internal successors, (6709), 4555 states have internal predecessors, (6709), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-11-16 11:45:16,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4596 states to 4596 states and 6791 transitions. [2022-11-16 11:45:16,684 INFO L78 Accepts]: Start accepts. Automaton has 4596 states and 6791 transitions. Word has length 67 [2022-11-16 11:45:16,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:16,684 INFO L495 AbstractCegarLoop]: Abstraction has 4596 states and 6791 transitions. [2022-11-16 11:45:16,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-16 11:45:16,685 INFO L276 IsEmpty]: Start isEmpty. Operand 4596 states and 6791 transitions. [2022-11-16 11:45:16,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-16 11:45:16,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:16,691 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] [2022-11-16 11:45:16,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:45:16,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:45:16,911 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:45:16,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:16,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391415, now seen corresponding path program 1 times [2022-11-16 11:45:16,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:45:16,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609066826] [2022-11-16 11:45:16,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45: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-16 11:45:16,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:45:16,915 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:45:16,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-11-16 11:45:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:17,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 11:45:17,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:45:17,453 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-16 11:45:17,479 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-16 11:45:17,498 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-16 11:45:17,576 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-16 11:45:17,586 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-16 11:45:17,611 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-16 11:45:17,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:45:17,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:45:17,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609066826] [2022-11-16 11:45:17,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609066826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:45:17,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:45:17,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:45:17,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159279896] [2022-11-16 11:45:17,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:45:17,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:45:17,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:45:17,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:45:17,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:45:17,614 INFO L87 Difference]: Start difference. First operand 4596 states and 6791 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-16 11:45:27,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:27,153 INFO L93 Difference]: Finished difference Result 4595 states and 6788 transitions. [2022-11-16 11:45:27,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:45:27,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2022-11-16 11:45:27,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:27,161 INFO L225 Difference]: With dead ends: 4595 [2022-11-16 11:45:27,161 INFO L226 Difference]: Without dead ends: 4595 [2022-11-16 11:45:27,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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-16 11:45:27,162 INFO L413 NwaCegarLoop]: 1712 mSDtfsCounter, 2 mSDsluCounter, 2834 mSDsCounter, 0 mSdLazyCounter, 2305 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4546 SdHoareTripleChecker+Invalid, 2306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:27,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4546 Invalid, 2306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2305 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2022-11-16 11:45:27,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4595 states. [2022-11-16 11:45:27,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4595 to 4595. [2022-11-16 11:45:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4595 states, 3918 states have (on average 1.7115875446656457) internal successors, (6706), 4554 states have internal predecessors, (6706), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-11-16 11:45:27,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4595 states to 4595 states and 6788 transitions. [2022-11-16 11:45:27,243 INFO L78 Accepts]: Start accepts. Automaton has 4595 states and 6788 transitions. Word has length 67 [2022-11-16 11:45:27,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:27,243 INFO L495 AbstractCegarLoop]: Abstraction has 4595 states and 6788 transitions. [2022-11-16 11:45:27,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-16 11:45:27,244 INFO L276 IsEmpty]: Start isEmpty. Operand 4595 states and 6788 transitions. [2022-11-16 11:45:27,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-16 11:45:27,245 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:27,245 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] [2022-11-16 11:45:27,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-11-16 11:45:27,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:45:27,459 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr396REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:45:27,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:27,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1491017746, now seen corresponding path program 1 times [2022-11-16 11:45:27,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:45:27,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082331992] [2022-11-16 11:45:27,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:27,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:45:27,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:45:27,462 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:45:27,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:45:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:27,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:45:27,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:45:27,981 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-16 11:45:27,997 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-16 11:45:28,037 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-16 11:45:28,054 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-16 11:45:28,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:45:28,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:45:28,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082331992] [2022-11-16 11:45:28,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082331992] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:45:28,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:45:28,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:45:28,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475626093] [2022-11-16 11:45:28,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:45:28,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:45:28,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:45:28,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:45:28,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:45:28,057 INFO L87 Difference]: Start difference. First operand 4595 states and 6788 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-16 11:45:34,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:34,970 INFO L93 Difference]: Finished difference Result 4594 states and 6784 transitions. [2022-11-16 11:45:34,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:45:34,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2022-11-16 11:45:34,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:34,978 INFO L225 Difference]: With dead ends: 4594 [2022-11-16 11:45:34,979 INFO L226 Difference]: Without dead ends: 4594 [2022-11-16 11:45:34,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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-16 11:45:34,980 INFO L413 NwaCegarLoop]: 1710 mSDtfsCounter, 4 mSDsluCounter, 2858 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4568 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:34,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4568 Invalid, 2278 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-11-16 11:45:34,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4594 states. [2022-11-16 11:45:35,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4594 to 4594. [2022-11-16 11:45:35,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4594 states, 3918 states have (on average 1.7105666156202144) internal successors, (6702), 4553 states have internal predecessors, (6702), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-11-16 11:45:35,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4594 states to 4594 states and 6784 transitions. [2022-11-16 11:45:35,075 INFO L78 Accepts]: Start accepts. Automaton has 4594 states and 6784 transitions. Word has length 67 [2022-11-16 11:45:35,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:35,075 INFO L495 AbstractCegarLoop]: Abstraction has 4594 states and 6784 transitions. [2022-11-16 11:45:35,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-16 11:45:35,076 INFO L276 IsEmpty]: Start isEmpty. Operand 4594 states and 6784 transitions. [2022-11-16 11:45:35,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-16 11:45:35,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:35,077 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] [2022-11-16 11:45:35,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:45:35,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:45:35,289 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr397REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:45:35,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:35,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1491017745, now seen corresponding path program 1 times [2022-11-16 11:45:35,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:45:35,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034064098] [2022-11-16 11:45:35,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:35,291 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-16 11:45:35,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:45:35,293 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:45:35,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-11-16 11:45:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:35,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 11:45:35,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:45:35,794 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-16 11:45:35,829 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-16 11:45:35,843 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-16 11:45:35,922 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-16 11:45:35,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-16 11:45:35,954 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-16 11:45:35,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:45:35,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:45:35,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034064098] [2022-11-16 11:45:35,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034064098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:45:35,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:45:35,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:45:35,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754935806] [2022-11-16 11:45:35,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:45:35,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:45:35,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:45:35,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:45:35,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:45:35,957 INFO L87 Difference]: Start difference. First operand 4594 states and 6784 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-16 11:45:45,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:45,600 INFO L93 Difference]: Finished difference Result 4593 states and 6780 transitions. [2022-11-16 11:45:45,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:45:45,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2022-11-16 11:45:45,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:45,607 INFO L225 Difference]: With dead ends: 4593 [2022-11-16 11:45:45,608 INFO L226 Difference]: Without dead ends: 4593 [2022-11-16 11:45:45,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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-16 11:45:45,608 INFO L413 NwaCegarLoop]: 1710 mSDtfsCounter, 2 mSDsluCounter, 2831 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4541 SdHoareTripleChecker+Invalid, 2303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:45,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4541 Invalid, 2303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2022-11-16 11:45:45,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2022-11-16 11:45:45,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 4593. [2022-11-16 11:45:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4593 states, 3914 states have (on average 1.7112927950945325) internal successors, (6698), 4552 states have internal predecessors, (6698), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-11-16 11:45:45,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4593 states to 4593 states and 6780 transitions. [2022-11-16 11:45:45,671 INFO L78 Accepts]: Start accepts. Automaton has 4593 states and 6780 transitions. Word has length 67 [2022-11-16 11:45:45,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:45,671 INFO L495 AbstractCegarLoop]: Abstraction has 4593 states and 6780 transitions. [2022-11-16 11:45:45,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-16 11:45:45,672 INFO L276 IsEmpty]: Start isEmpty. Operand 4593 states and 6780 transitions. [2022-11-16 11:45:45,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-16 11:45:45,673 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:45,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:45:45,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-11-16 11:45:45,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:45:45,887 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:45:45,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:45,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2018345425, now seen corresponding path program 1 times [2022-11-16 11:45:45,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:45:45,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474996758] [2022-11-16 11:45:45,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:45,889 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-16 11:45:45,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:45:45,890 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:45:45,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:45:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:46,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:45:46,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:45:46,532 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-16 11:45:46,532 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:45:46,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:45:46,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474996758] [2022-11-16 11:45:46,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474996758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:45:46,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:45:46,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:45:46,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634200609] [2022-11-16 11:45:46,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:45:46,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:45:46,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:45:46,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:45:46,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:45:46,536 INFO L87 Difference]: Start difference. First operand 4593 states and 6780 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-16 11:45:46,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:46,748 INFO L93 Difference]: Finished difference Result 4596 states and 6789 transitions. [2022-11-16 11:45:46,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:45:46,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 75 [2022-11-16 11:45:46,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:46,803 INFO L225 Difference]: With dead ends: 4596 [2022-11-16 11:45:46,803 INFO L226 Difference]: Without dead ends: 4596 [2022-11-16 11:45:46,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 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-16 11:45:46,805 INFO L413 NwaCegarLoop]: 1709 mSDtfsCounter, 2 mSDsluCounter, 3410 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5119 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:46,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5119 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:45:46,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4596 states. [2022-11-16 11:45:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4596 to 4596. [2022-11-16 11:45:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4596 states, 3916 states have (on average 1.7111848825331972) internal successors, (6701), 4555 states have internal predecessors, (6701), 41 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2022-11-16 11:45:46,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4596 states to 4596 states and 6789 transitions. [2022-11-16 11:45:47,007 INFO L78 Accepts]: Start accepts. Automaton has 4596 states and 6789 transitions. Word has length 75 [2022-11-16 11:45:47,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:47,008 INFO L495 AbstractCegarLoop]: Abstraction has 4596 states and 6789 transitions. [2022-11-16 11:45:47,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-16 11:45:47,008 INFO L276 IsEmpty]: Start isEmpty. Operand 4596 states and 6789 transitions. [2022-11-16 11:45:47,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-16 11:45:47,009 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:47,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:45:47,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:45:47,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:45:47,211 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:45:47,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:47,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1265252366, now seen corresponding path program 1 times [2022-11-16 11:45:47,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:45:47,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286518754] [2022-11-16 11:45:47,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:47,212 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-16 11:45:47,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:45:47,214 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:45:47,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-11-16 11:45:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:47,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:45:47,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:45:47,816 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-16 11:45:47,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:45:47,964 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-16 11:45:47,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:45:47,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286518754] [2022-11-16 11:45:47,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286518754] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:45:47,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:45:47,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-11-16 11:45:47,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700196885] [2022-11-16 11:45:47,965 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:45:47,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:45:47,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:45:47,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:45:47,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:45:47,967 INFO L87 Difference]: Start difference. First operand 4596 states and 6789 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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-16 11:45:48,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:48,378 INFO L93 Difference]: Finished difference Result 4608 states and 6811 transitions. [2022-11-16 11:45:48,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:45:48,380 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 76 [2022-11-16 11:45:48,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:48,400 INFO L225 Difference]: With dead ends: 4608 [2022-11-16 11:45:48,400 INFO L226 Difference]: Without dead ends: 4608 [2022-11-16 11:45:48,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:45:48,403 INFO L413 NwaCegarLoop]: 1709 mSDtfsCounter, 20 mSDsluCounter, 5113 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 6822 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:48,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 6822 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:45:48,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4608 states. [2022-11-16 11:45:48,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4608 to 4606. [2022-11-16 11:45:48,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4606 states, 3925 states have (on average 1.7110828025477707) internal successors, (6716), 4564 states have internal predecessors, (6716), 41 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2022-11-16 11:45:48,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4606 states to 4606 states and 6804 transitions. [2022-11-16 11:45:48,489 INFO L78 Accepts]: Start accepts. Automaton has 4606 states and 6804 transitions. Word has length 76 [2022-11-16 11:45:48,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:48,489 INFO L495 AbstractCegarLoop]: Abstraction has 4606 states and 6804 transitions. [2022-11-16 11:45:48,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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-16 11:45:48,490 INFO L276 IsEmpty]: Start isEmpty. Operand 4606 states and 6804 transitions. [2022-11-16 11:45:48,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-16 11:45:48,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:48,492 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:45:48,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-11-16 11:45:48,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:45:48,710 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:45:48,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:48,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1799258641, now seen corresponding path program 2 times [2022-11-16 11:45:48,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:45:48,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017207010] [2022-11-16 11:45:48,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:45:48,712 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-16 11:45:48,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:45:48,713 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:45:48,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:45:49,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:45:49,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:45:49,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:45:49,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:45:49,661 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-16 11:45:49,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:45:50,000 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-16 11:45:50,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:45:50,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017207010] [2022-11-16 11:45:50,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017207010] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:45:50,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:45:50,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-11-16 11:45:50,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627362787] [2022-11-16 11:45:50,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:45:50,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 11:45:50,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:45:50,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 11:45:50,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:45:50,004 INFO L87 Difference]: Start difference. First operand 4606 states and 6804 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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-16 11:45:51,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:51,281 INFO L93 Difference]: Finished difference Result 4627 states and 6852 transitions. [2022-11-16 11:45:51,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 11:45:51,283 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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 79 [2022-11-16 11:45:51,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:51,301 INFO L225 Difference]: With dead ends: 4627 [2022-11-16 11:45:51,301 INFO L226 Difference]: Without dead ends: 4623 [2022-11-16 11:45:51,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-11-16 11:45:51,302 INFO L413 NwaCegarLoop]: 1712 mSDtfsCounter, 52 mSDsluCounter, 10239 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 11951 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:51,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 11951 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 11:45:51,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4623 states. [2022-11-16 11:45:51,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4623 to 4615. [2022-11-16 11:45:51,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4615 states, 3934 states have (on average 1.7102186070157601) internal successors, (6728), 4573 states have internal predecessors, (6728), 41 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2022-11-16 11:45:51,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4615 states to 4615 states and 6816 transitions. [2022-11-16 11:45:51,387 INFO L78 Accepts]: Start accepts. Automaton has 4615 states and 6816 transitions. Word has length 79 [2022-11-16 11:45:51,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:51,387 INFO L495 AbstractCegarLoop]: Abstraction has 4615 states and 6816 transitions. [2022-11-16 11:45:51,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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-16 11:45:51,388 INFO L276 IsEmpty]: Start isEmpty. Operand 4615 states and 6816 transitions. [2022-11-16 11:45:51,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-16 11:45:51,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:51,391 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, 1, 1] [2022-11-16 11:45:51,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:45:51,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:45:51,613 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:45:51,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:51,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1875379825, now seen corresponding path program 3 times [2022-11-16 11:45:51,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:45:51,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439769666] [2022-11-16 11:45:51,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:45:51,614 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-16 11:45:51,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:45:51,615 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:45:51,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-11-16 11:45:52,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-16 11:45:52,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:45:52,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 11:45:52,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:45:52,995 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-16 11:45:52,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:45:54,313 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-16 11:45:54,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:45:54,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439769666] [2022-11-16 11:45:54,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439769666] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:45:54,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:45:54,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-11-16 11:45:54,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125136879] [2022-11-16 11:45:54,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:45:54,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 11:45:54,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:45:54,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 11:45:54,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-11-16 11:45:54,317 INFO L87 Difference]: Start difference. First operand 4615 states and 6816 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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-16 11:46:01,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:01,209 INFO L93 Difference]: Finished difference Result 4657 states and 6953 transitions. [2022-11-16 11:46:01,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-16 11:46:01,210 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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 85 [2022-11-16 11:46:01,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:01,221 INFO L225 Difference]: With dead ends: 4657 [2022-11-16 11:46:01,221 INFO L226 Difference]: Without dead ends: 4651 [2022-11-16 11:46:01,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-11-16 11:46:01,225 INFO L413 NwaCegarLoop]: 1716 mSDtfsCounter, 189 mSDsluCounter, 22215 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 23931 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:01,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 23931 Invalid, 1090 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [96 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-16 11:46:01,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4651 states. [2022-11-16 11:46:01,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4651 to 4633. [2022-11-16 11:46:01,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4633 states, 3952 states have (on average 1.708248987854251) internal successors, (6751), 4591 states have internal predecessors, (6751), 41 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2022-11-16 11:46:01,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4633 states to 4633 states and 6839 transitions. [2022-11-16 11:46:01,310 INFO L78 Accepts]: Start accepts. Automaton has 4633 states and 6839 transitions. Word has length 85 [2022-11-16 11:46:01,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:01,310 INFO L495 AbstractCegarLoop]: Abstraction has 4633 states and 6839 transitions. [2022-11-16 11:46:01,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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-16 11:46:01,311 INFO L276 IsEmpty]: Start isEmpty. Operand 4633 states and 6839 transitions. [2022-11-16 11:46:01,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-16 11:46:01,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:01,312 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, 1, 1] [2022-11-16 11:46:01,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-11-16 11:46:01,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:46:01,535 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:46:01,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:01,535 INFO L85 PathProgramCache]: Analyzing trace with hash -905623345, now seen corresponding path program 4 times [2022-11-16 11:46:01,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:46:01,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670953617] [2022-11-16 11:46:01,536 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:46:01,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:46:01,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:46:01,538 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:46:01,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:46:02,172 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:46:02,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:46:02,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 11:46:02,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:46:02,831 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-16 11:46:02,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:46:06,114 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-16 11:46:06,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:46:06,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670953617] [2022-11-16 11:46:06,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670953617] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:46:06,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:46:06,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-11-16 11:46:06,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567056385] [2022-11-16 11:46:06,116 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:46:06,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-16 11:46:06,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:46:06,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-16 11:46:06,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-11-16 11:46:06,119 INFO L87 Difference]: Start difference. First operand 4633 states and 6839 transitions. Second operand has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 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-16 11:46:25,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:25,189 INFO L93 Difference]: Finished difference Result 4713 states and 7056 transitions. [2022-11-16 11:46:25,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-16 11:46:25,204 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 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 97 [2022-11-16 11:46:25,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:25,217 INFO L225 Difference]: With dead ends: 4713 [2022-11-16 11:46:25,218 INFO L226 Difference]: Without dead ends: 4709 [2022-11-16 11:46:25,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-11-16 11:46:25,222 INFO L413 NwaCegarLoop]: 1729 mSDtfsCounter, 409 mSDsluCounter, 39657 mSDsCounter, 0 mSdLazyCounter, 3018 mSolverCounterSat, 447 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 41386 SdHoareTripleChecker+Invalid, 3465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 447 IncrementalHoareTripleChecker+Valid, 3018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:25,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 41386 Invalid, 3465 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [447 Valid, 3018 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2022-11-16 11:46:25,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4709 states. [2022-11-16 11:46:25,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4709 to 4667. [2022-11-16 11:46:25,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4667 states, 3986 states have (on average 1.705218263923733) internal successors, (6797), 4625 states have internal predecessors, (6797), 41 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2022-11-16 11:46:25,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4667 states to 4667 states and 6885 transitions. [2022-11-16 11:46:25,339 INFO L78 Accepts]: Start accepts. Automaton has 4667 states and 6885 transitions. Word has length 97 [2022-11-16 11:46:25,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:25,339 INFO L495 AbstractCegarLoop]: Abstraction has 4667 states and 6885 transitions. [2022-11-16 11:46:25,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 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-16 11:46:25,340 INFO L276 IsEmpty]: Start isEmpty. Operand 4667 states and 6885 transitions. [2022-11-16 11:46:25,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-16 11:46:25,343 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:25,343 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] [2022-11-16 11:46:25,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:46:25,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:46:25,571 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:46:25,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:25,572 INFO L85 PathProgramCache]: Analyzing trace with hash 616848239, now seen corresponding path program 5 times [2022-11-16 11:46:25,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:46:25,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311606918] [2022-11-16 11:46:25,573 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:46:25,573 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-16 11:46:25,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:46:25,575 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:46:25,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-11-16 11:46:27,629 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-16 11:46:27,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:46:27,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-16 11:46:27,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:46:27,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:46:27,952 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 11:46:27,952 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-16 11:46:28,004 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-16 11:46:28,232 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-16 11:46:28,971 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_19) (_ bv1 1))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2634)))) is different from true [2022-11-16 11:46:29,721 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_19) (_ bv1 1))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_2649 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2649)))) is different from true [2022-11-16 11:46:30,551 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_19) (_ bv1 1))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_2666 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2666)))) is different from true [2022-11-16 11:46:30,646 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:46:30,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-16 11:46:30,699 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-16 11:46:30,748 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-16 11:46:30,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:46:31,227 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2712 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_2712) |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-16 11:46:31,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:46:31,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311606918] [2022-11-16 11:46:31,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311606918] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:46:31,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1512777012] [2022-11-16 11:46:31,230 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:46:31,230 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:46:31,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:46:31,232 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:46:31,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-11-16 11:47:57,792 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-16 11:47:57,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:47:58,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-16 11:47:58,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:47:58,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:47:58,344 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 11:47:58,344 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-16 11:47:58,369 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-16 11:47:58,453 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-16 11:47:59,611 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_19) (_ bv1 1))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_3107 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3107) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:48:00,521 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_19) (_ bv1 1))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_3125 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3125)))) is different from true [2022-11-16 11:48:00,794 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:48:00,794 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-16 11:48:00,874 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-16 11:48:00,888 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-16 11:48:00,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:48:03,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1512777012] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:48:03,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:48:03,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 13 [2022-11-16 11:48:03,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092026953] [2022-11-16 11:48:03,401 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:48:03,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 11:48:03,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:48:03,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 11:48:03,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=99, Unknown=16, NotChecked=150, Total=306 [2022-11-16 11:48:03,403 INFO L87 Difference]: Start difference. First operand 4667 states and 6885 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 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-16 11:48:04,133 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_19) (_ bv1 1))) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_19 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_2666 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2666))) (exists ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2634))) (exists ((v_ArrVal_3107 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3107) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3125 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3125))) (exists ((v_ArrVal_2649 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2649))) (exists ((v_ArrVal_2623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2623)))) is different from true [2022-11-16 11:48:12,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:12,577 INFO L93 Difference]: Finished difference Result 6834 states and 10231 transitions. [2022-11-16 11:48:12,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:48:12,578 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 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 119 [2022-11-16 11:48:12,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:12,595 INFO L225 Difference]: With dead ends: 6834 [2022-11-16 11:48:12,595 INFO L226 Difference]: Without dead ends: 6830 [2022-11-16 11:48:12,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 143 SyntacticMatches, 86 SemanticMatches, 20 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=62, Invalid=156, Unknown=20, NotChecked=224, Total=462 [2022-11-16 11:48:12,596 INFO L413 NwaCegarLoop]: 969 mSDtfsCounter, 1586 mSDsluCounter, 4286 mSDsCounter, 0 mSdLazyCounter, 2626 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1595 SdHoareTripleChecker+Valid, 5255 SdHoareTripleChecker+Invalid, 14528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11891 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:12,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1595 Valid, 5255 Invalid, 14528 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 2626 Invalid, 0 Unknown, 11891 Unchecked, 8.8s Time] [2022-11-16 11:48:12,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6830 states. [2022-11-16 11:48:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6830 to 4715. [2022-11-16 11:48:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4715 states, 4034 states have (on average 1.696331184928111) internal successors, (6843), 4672 states have internal predecessors, (6843), 41 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2022-11-16 11:48:12,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4715 states to 4715 states and 6931 transitions. [2022-11-16 11:48:12,688 INFO L78 Accepts]: Start accepts. Automaton has 4715 states and 6931 transitions. Word has length 119 [2022-11-16 11:48:12,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:12,689 INFO L495 AbstractCegarLoop]: Abstraction has 4715 states and 6931 transitions. [2022-11-16 11:48:12,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 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-16 11:48:12,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4715 states and 6931 transitions. [2022-11-16 11:48:12,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-16 11:48:12,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:12,691 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] [2022-11-16 11:48:12,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2022-11-16 11:48:12,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-11-16 11:48:13,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:48:13,109 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:48:13,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:13,110 INFO L85 PathProgramCache]: Analyzing trace with hash 616848240, now seen corresponding path program 1 times [2022-11-16 11:48:13,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:48:13,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765871313] [2022-11-16 11:48:13,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:13,111 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-16 11:48:13,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:48:13,112 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:48:13,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-11-16 11:48:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:14,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 109 conjunts are in the unsatisfiable core [2022-11-16 11:48:14,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:48:14,336 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-16 11:48:14,538 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:48:14,538 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-16 11:48:14,548 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-16 11:48:14,584 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-16 11:48:14,598 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-16 11:48:14,783 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-16 11:48:14,790 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-16 11:48:15,042 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3558))) (exists ((v_ArrVal_3557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3557)))) is different from true [2022-11-16 11:48:15,112 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3562 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3562) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3561 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3561)))) is different from true [2022-11-16 11:48:15,262 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570))) (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569)))) is different from true [2022-11-16 11:48:15,323 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3573) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3574)))) is different from true [2022-11-16 11:48:15,578 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3586 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3586))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3585) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:48:15,595 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3588 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3588))) (exists ((v_ArrVal_3587 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3587) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:48:15,614 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3590 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3590))) (exists ((v_ArrVal_3589 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3589) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-11-16 11:48:15,631 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3591 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3591))) (exists ((v_ArrVal_3592 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3592)))) is different from true [2022-11-16 11:48:15,727 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3596 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3596) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3595 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3595)))) is different from true [2022-11-16 11:48:15,747 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3597 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3597))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3598 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3598)))) is different from true [2022-11-16 11:48:15,768 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3599 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3599))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3600) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:48:15,789 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3602 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3602) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3601 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3601) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-11-16 11:48:15,809 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3604 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3604))) (exists ((v_ArrVal_3603 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3603)))) is different from true [2022-11-16 11:48:15,880 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3607 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3607))) (exists ((v_ArrVal_3608 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3608) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:48:16,006 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3614 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3614) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3613 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3613) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:48:16,176 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3621 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3621))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3622)))) is different from true [2022-11-16 11:48:16,197 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3624))) (exists ((v_ArrVal_3623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3623)))) is different from true [2022-11-16 11:48:16,269 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3628 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3628) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3627 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3627)))) is different from true [2022-11-16 11:48:16,338 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3631) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3632 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3632)))) is different from true [2022-11-16 11:48:16,560 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:48:16,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-16 11:48:16,575 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-16 11:48:16,653 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-16 11:48:16,666 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-16 11:48:16,714 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-16 11:48:16,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:48:18,254 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3730 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3729 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3730) |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~mem39#1.base| v_ArrVal_3729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-16 11:48:18,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:48:18,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765871313] [2022-11-16 11:48:18,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765871313] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:48:18,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [478204886] [2022-11-16 11:48:18,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:18,268 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:48:18,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:48:18,269 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:48:18,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-11-16 11:50:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:33,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-16 11:50:33,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:33,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:50:34,055 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:50:34,068 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-16 11:50:34,081 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-16 11:50:34,101 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-16 11:50:34,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:50:34,224 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-16 11:50:34,232 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-16 11:50:34,325 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4106 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4106) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4107 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4107) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-11-16 11:50:34,598 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4118 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4118))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4119) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:50:34,617 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4120 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4120))) (exists ((v_ArrVal_4121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4121)))) is different from true [2022-11-16 11:50:34,882 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4132 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4132) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4133 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4133)))) is different from true [2022-11-16 11:50:34,901 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4135))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4134 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4134) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:50:35,111 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4144 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4144))) (exists ((v_ArrVal_4145 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4145)))) is different from true [2022-11-16 11:50:35,173 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4149 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4149))) (exists ((v_ArrVal_4148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4148))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-11-16 11:50:35,240 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152))) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153)))) is different from true [2022-11-16 11:50:35,260 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4155 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4155) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4154) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:50:35,280 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156)))) is different from true [2022-11-16 11:50:35,299 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4158 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4158) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4159 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4159) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:50:35,319 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161)))) is different from true [2022-11-16 11:50:35,531 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171)))) is different from true [2022-11-16 11:50:35,551 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4173))) (exists ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4172)))) is different from true [2022-11-16 11:50:35,654 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:50:35,800 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186)))) is different from true [2022-11-16 11:50:35,821 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:50:35,988 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:50:35,988 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-16 11:50:36,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-16 11:50:36,072 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-16 11:50:36,083 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-16 11:50:36,090 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 351 trivial. 612 not checked. [2022-11-16 11:50:36,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:50:37,340 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4285) |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~mem39#1.base| v_ArrVal_4284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-11-16 11:50:37,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [478204886] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:50:37,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:50:37,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 44 [2022-11-16 11:50:37,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873766671] [2022-11-16 11:50:37,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:50:37,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-16 11:50:37,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:50:37,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-16 11:50:37,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=118, Unknown=45, NotChecked=2090, Total=2352 [2022-11-16 11:50:37,354 INFO L87 Difference]: Start difference. First operand 4715 states and 6931 transitions. Second operand has 45 states, 43 states have (on average 3.046511627906977) internal successors, (131), 45 states have internal predecessors, (131), 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-16 11:50:38,371 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3621 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3621))) (exists ((v_ArrVal_3628 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3628) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3631) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4149 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4149))) (exists ((v_ArrVal_3562 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3562) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3586 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3586))) (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187))) (exists ((v_ArrVal_3552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3552))) (exists ((v_ArrVal_3614 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3614) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4118 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4118))) (exists ((v_ArrVal_4148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4148))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3607 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3607))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570))) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152))) (exists ((v_ArrVal_4132 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4132) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186))) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153))) (exists ((v_ArrVal_3596 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3596) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4119) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4144 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4144))) (exists ((v_ArrVal_4145 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4145))) (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3558))) (exists ((v_ArrVal_3613 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3613) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3595 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3595))) (exists ((v_ArrVal_4133 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4133))) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3632 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3632))) (exists ((v_ArrVal_3627 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3627))) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171))) (exists ((v_ArrVal_3608 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3608) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3573) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3557))) (exists ((v_ArrVal_3585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3585) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569))) (exists ((v_ArrVal_3622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3622))) (exists ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3574))) (exists ((v_ArrVal_3551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3551) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3561 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3561)))) is different from true [2022-11-16 11:50:38,392 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3621 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3621))) (exists ((v_ArrVal_3597 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3597))) (exists ((v_ArrVal_3628 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3628) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188))) (exists ((v_ArrVal_3631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3631) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4149 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4149))) (exists ((v_ArrVal_3562 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3562) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3586 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3586))) (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187))) (exists ((v_ArrVal_3552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3552))) (exists ((v_ArrVal_4135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4135))) (exists ((v_ArrVal_3614 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3614) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4118 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4118))) (exists ((v_ArrVal_4148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4148))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3624))) (exists ((v_ArrVal_3607 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3607))) (exists ((v_ArrVal_4120 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4120))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570))) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152))) (exists ((v_ArrVal_4132 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4132) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186))) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153))) (exists ((v_ArrVal_3596 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3596) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4119) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4144 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4144))) (exists ((v_ArrVal_4145 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4145))) (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3588 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3588))) (exists ((v_ArrVal_3558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3558))) (exists ((v_ArrVal_3613 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3613) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4155 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4155) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3623))) (exists ((v_ArrVal_3598 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3598))) (exists ((v_ArrVal_3595 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3595))) (exists ((v_ArrVal_4133 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4133))) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3632 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3632))) (exists ((v_ArrVal_4173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4173))) (exists ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4172))) (exists ((v_ArrVal_3627 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3627))) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171))) (exists ((v_ArrVal_3608 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3608) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3573) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4134 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4134) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3557))) (exists ((v_ArrVal_3585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3585) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4154) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569))) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3587 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3587) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4121))) (exists ((v_ArrVal_3622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3622))) (exists ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3574))) (exists ((v_ArrVal_3551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3551) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3561 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3561)))) is different from true [2022-11-16 11:50:38,411 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3621 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3621))) (exists ((v_ArrVal_3590 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3590))) (exists ((v_ArrVal_3597 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3597))) (exists ((v_ArrVal_3628 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3628) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188))) (exists ((v_ArrVal_3631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3631) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4149 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4149))) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_ArrVal_3599 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3599))) (exists ((v_ArrVal_3562 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3562) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3586 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3586))) (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187))) (exists ((v_ArrVal_3552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3552))) (exists ((v_ArrVal_4135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4135))) (exists ((v_ArrVal_3614 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3614) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4118 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4118))) (exists ((v_ArrVal_4148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4148))) (exists ((v_ArrVal_3589 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3589) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3624))) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156))) (exists ((v_ArrVal_3607 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3607))) (exists ((v_ArrVal_4120 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4120))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570))) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152))) (exists ((v_ArrVal_4132 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4132) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3600) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186))) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153))) (exists ((v_ArrVal_3596 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3596) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4119) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4144 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4144))) (exists ((v_ArrVal_4145 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4145))) (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3588 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3588))) (exists ((v_ArrVal_3558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3558))) (exists ((v_ArrVal_3613 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3613) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4155 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4155) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3623))) (exists ((v_ArrVal_3598 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3598))) (exists ((v_ArrVal_3595 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3595))) (exists ((v_ArrVal_4133 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4133))) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3632 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3632))) (exists ((v_ArrVal_4173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4173))) (exists ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4172))) (exists ((v_ArrVal_3627 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3627))) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171))) (exists ((v_ArrVal_3608 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3608) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3573) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4134 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4134) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3557))) (exists ((v_ArrVal_3585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3585) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4154) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569))) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3587 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3587) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4121))) (exists ((v_ArrVal_3622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3622))) (exists ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3574))) (exists ((v_ArrVal_3551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3551) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3561 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3561)))) is different from true [2022-11-16 11:50:38,430 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3602 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3602) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3621 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3621))) (exists ((v_ArrVal_3590 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3590))) (exists ((v_ArrVal_3597 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3597))) (exists ((v_ArrVal_3628 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3628) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188))) (exists ((v_ArrVal_3631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3631) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4149 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4149))) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_ArrVal_3599 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3599))) (exists ((v_ArrVal_3562 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3562) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3586 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3586))) (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187))) (exists ((v_ArrVal_3552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3552))) (exists ((v_ArrVal_4135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4135))) (exists ((v_ArrVal_3601 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3601) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3614 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3614) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4118 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4118))) (exists ((v_ArrVal_4148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4148))) (exists ((v_ArrVal_3589 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3589) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3624))) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156))) (exists ((v_ArrVal_3607 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3607))) (exists ((v_ArrVal_4120 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4120))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570))) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152))) (exists ((v_ArrVal_4132 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4132) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3600) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186))) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153))) (exists ((v_ArrVal_3596 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3596) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4119) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4144 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4144))) (exists ((v_ArrVal_4145 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4145))) (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3588 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3588))) (exists ((v_ArrVal_3558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3558))) (exists ((v_ArrVal_3613 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3613) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4155 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4155) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3623))) (exists ((v_ArrVal_3598 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3598))) (exists ((v_ArrVal_3595 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3595))) (exists ((v_ArrVal_4133 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4133))) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3591 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3591))) (exists ((v_ArrVal_3632 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3632))) (exists ((v_ArrVal_4173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4173))) (exists ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4172))) (exists ((v_ArrVal_3627 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3627))) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171))) (exists ((v_ArrVal_3608 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3608) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3573) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4134 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4134) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4158 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4158) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3557))) (exists ((v_ArrVal_4159 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4159) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3585) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4154) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569))) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3592 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3592))) (exists ((v_ArrVal_3587 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3587) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4121))) (exists ((v_ArrVal_3622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3622))) (exists ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3574))) (exists ((v_ArrVal_3551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3551) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3561 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3561)))) is different from true [2022-11-16 11:50:38,453 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3602 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3602) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3621 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3621))) (exists ((v_ArrVal_3590 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3590))) (exists ((v_ArrVal_3597 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3597))) (exists ((v_ArrVal_3628 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3628) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4188 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4188))) (exists ((v_ArrVal_3631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3631) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4149 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4149))) (exists ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4157))) (exists ((v_ArrVal_3599 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3599))) (exists ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4160) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3562 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3562) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3586 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3586))) (exists ((v_ArrVal_4187 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4187))) (exists ((v_ArrVal_3552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3552))) (exists ((v_ArrVal_4135 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4135))) (exists ((v_ArrVal_3601 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3601) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3614 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3614) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4118 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4118))) (exists ((v_ArrVal_4148 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4148))) (exists ((v_ArrVal_3589 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3589) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3624))) (exists ((v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4156))) (exists ((v_ArrVal_3607 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3607))) (exists ((v_ArrVal_4120 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4120))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570))) (exists ((v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4179) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4152 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4152))) (exists ((v_ArrVal_4132 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4132) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3600) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4186))) (exists ((v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4153))) (exists ((v_ArrVal_3596 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3596) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4119 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4119) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_4144 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4144))) (exists ((v_ArrVal_4145 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4145))) (exists ((v_ArrVal_4170 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4170) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3588 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3588))) (exists ((v_ArrVal_4161 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4161))) (exists ((v_ArrVal_3558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3558))) (exists ((v_ArrVal_3613 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3613) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4155 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4155) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3623))) (exists ((v_ArrVal_3598 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3598))) (exists ((v_ArrVal_3595 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3595))) (exists ((v_ArrVal_4133 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4133))) (exists ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4178) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3591 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3591))) (exists ((v_ArrVal_3632 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3632))) (exists ((v_ArrVal_4173 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4173))) (exists ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4172))) (exists ((v_ArrVal_3627 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3627))) (exists ((v_ArrVal_4171 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4171))) (exists ((v_ArrVal_3608 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3608) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3573) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4134 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4134) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4158 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4158) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3557))) (exists ((v_ArrVal_4159 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4159) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3585) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4154 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4154) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569))) (exists ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4189) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3592 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3592))) (exists ((v_ArrVal_3587 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3587) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_4121 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_4121))) (exists ((v_ArrVal_3604 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3604))) (exists ((v_ArrVal_3622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3622))) (exists ((v_ArrVal_3603 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3603))) (exists ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3574))) (exists ((v_ArrVal_3551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3551) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3561 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3561)))) is different from true [2022-11-16 11:50:52,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:50:52,720 INFO L93 Difference]: Finished difference Result 6829 states and 10222 transitions. [2022-11-16 11:50:52,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 11:50:52,722 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 3.046511627906977) internal successors, (131), 45 states have internal predecessors, (131), 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 119 [2022-11-16 11:50:52,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:50:52,743 INFO L225 Difference]: With dead ends: 6829 [2022-11-16 11:50:52,743 INFO L226 Difference]: Without dead ends: 6829 [2022-11-16 11:50:52,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 143 SyntacticMatches, 55 SemanticMatches, 58 ConstructedPredicates, 43 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=147, Invalid=241, Unknown=56, NotChecked=3096, Total=3540 [2022-11-16 11:50:52,745 INFO L413 NwaCegarLoop]: 968 mSDtfsCounter, 1583 mSDsluCounter, 3707 mSDsCounter, 0 mSdLazyCounter, 4335 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1592 SdHoareTripleChecker+Valid, 4675 SdHoareTripleChecker+Invalid, 99239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 4335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94892 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:50:52,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1592 Valid, 4675 Invalid, 99239 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [12 Valid, 4335 Invalid, 0 Unknown, 94892 Unchecked, 14.6s Time] [2022-11-16 11:50:52,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6829 states. [2022-11-16 11:50:52,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6829 to 4714. [2022-11-16 11:50:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4714 states, 4034 states have (on average 1.6955875061973227) internal successors, (6840), 4671 states have internal predecessors, (6840), 41 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2022-11-16 11:50:52,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4714 states to 4714 states and 6928 transitions. [2022-11-16 11:50:52,837 INFO L78 Accepts]: Start accepts. Automaton has 4714 states and 6928 transitions. Word has length 119 [2022-11-16 11:50:52,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:50:52,838 INFO L495 AbstractCegarLoop]: Abstraction has 4714 states and 6928 transitions. [2022-11-16 11:50:52,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 3.046511627906977) internal successors, (131), 45 states have internal predecessors, (131), 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-16 11:50:52,839 INFO L276 IsEmpty]: Start isEmpty. Operand 4714 states and 6928 transitions. [2022-11-16 11:50:52,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-16 11:50:52,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:50:52,841 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] [2022-11-16 11:50:52,868 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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)] Ended with exit code 0 [2022-11-16 11:50:53,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2022-11-16 11:50:53,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt [2022-11-16 11:50:53,256 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr400REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:50:53,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:50:53,256 INFO L85 PathProgramCache]: Analyzing trace with hash -462913067, now seen corresponding path program 1 times [2022-11-16 11:50:53,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:50:53,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305272183] [2022-11-16 11:50:53,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:50:53,258 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-16 11:50:53,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:50:53,261 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:50:53,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-11-16 11:50:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:50:54,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 11:50:54,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:50:54,577 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-16 11:50:54,592 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:50:54,593 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:50:54,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:50:54,601 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-16 11:50:54,723 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:50:54,723 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-16 11:50:54,851 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 45 treesize of output 41 [2022-11-16 11:50:54,982 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 45 treesize of output 41 [2022-11-16 11:50:55,078 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:50:55,079 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-16 11:50:55,105 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2022-11-16 11:50:55,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:50:55,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:50:55,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305272183] [2022-11-16 11:50:55,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305272183] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:50:55,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:50:55,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:50:55,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221871110] [2022-11-16 11:50:55,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:50:55,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:50:55,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:50:55,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:50:55,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:50:55,108 INFO L87 Difference]: Start difference. First operand 4714 states and 6928 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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-16 11:51:08,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:08,492 INFO L93 Difference]: Finished difference Result 4549 states and 6496 transitions. [2022-11-16 11:51:08,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:51:08,493 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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 119 [2022-11-16 11:51:08,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:08,501 INFO L225 Difference]: With dead ends: 4549 [2022-11-16 11:51:08,501 INFO L226 Difference]: Without dead ends: 4549 [2022-11-16 11:51:08,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:51:08,502 INFO L413 NwaCegarLoop]: 1019 mSDtfsCounter, 1628 mSDsluCounter, 4149 mSDsCounter, 0 mSdLazyCounter, 3960 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1638 SdHoareTripleChecker+Valid, 5168 SdHoareTripleChecker+Invalid, 3989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 3960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:08,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1638 Valid, 5168 Invalid, 3989 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 3960 Invalid, 0 Unknown, 0 Unchecked, 13.2s Time] [2022-11-16 11:51:08,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4549 states. [2022-11-16 11:51:08,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4549 to 4314. [2022-11-16 11:51:08,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4314 states, 3635 states have (on average 1.71939477303989) internal successors, (6250), 4274 states have internal predecessors, (6250), 38 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2022-11-16 11:51:08,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4314 states to 4314 states and 6331 transitions. [2022-11-16 11:51:08,563 INFO L78 Accepts]: Start accepts. Automaton has 4314 states and 6331 transitions. Word has length 119 [2022-11-16 11:51:08,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:08,564 INFO L495 AbstractCegarLoop]: Abstraction has 4314 states and 6331 transitions. [2022-11-16 11:51:08,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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-16 11:51:08,564 INFO L276 IsEmpty]: Start isEmpty. Operand 4314 states and 6331 transitions. [2022-11-16 11:51:08,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-16 11:51:08,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:08,566 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] [2022-11-16 11:51:08,590 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Ended with exit code 0 [2022-11-16 11:51:08,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:51:08,787 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:51:08,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:08,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1638848775, now seen corresponding path program 1 times [2022-11-16 11:51:08,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:51:08,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329441619] [2022-11-16 11:51:08,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:08,789 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-16 11:51:08,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:51:08,791 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:51:08,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-11-16 11:51:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:10,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-16 11:51:10,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:10,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:51:10,253 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 11:51:10,253 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-16 11:51:10,294 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-16 11:51:10,444 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-16 11:51:10,648 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5043)))) is different from true [2022-11-16 11:51:10,757 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5046)))) is different from true [2022-11-16 11:51:10,781 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5047)))) is different from true [2022-11-16 11:51:11,206 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5057 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5057)))) is different from true [2022-11-16 11:51:11,229 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5058 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5058) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:51:11,511 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5065)))) is different from true [2022-11-16 11:51:11,875 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5073 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5073)))) is different from true [2022-11-16 11:51:12,028 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5077 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5077)))) is different from true [2022-11-16 11:51:12,495 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:51:12,496 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-16 11:51:12,673 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:51:12,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-16 11:51:12,708 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-16 11:51:12,758 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 630 trivial. 324 not checked. [2022-11-16 11:51:12,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:14,915 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5086 (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_5086) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-16 11:51:15,350 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5086 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5132 (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~mem39#1.base| v_ArrVal_5132))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5086)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-16 11:51:15,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:51:15,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329441619] [2022-11-16 11:51:15,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329441619] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:15,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1754343405] [2022-11-16 11:51:15,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:15,355 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:51:15,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:51:15,357 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:51:15,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-11-16 11:51:20,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:20,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-16 11:51:20,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:20,726 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-16 11:51:20,961 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 11:51:20,961 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-16 11:51:20,988 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-16 11:51:21,086 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-16 11:51:21,338 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (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)))) is different from true [2022-11-16 11:51:21,462 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5518 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5518) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:51:21,797 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5525)))) is different from true [2022-11-16 11:51:21,955 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (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|))) is different from true [2022-11-16 11:51:21,979 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5530 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5530)))) is different from true [2022-11-16 11:51:22,005 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5531)))) is different from true [2022-11-16 11:51:22,302 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5538)))) is different from true [2022-11-16 11:51:22,368 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (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)))) is different from true [2022-11-16 11:51:22,861 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (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)))) is different from true [2022-11-16 11:51:22,965 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5554)))) is different from true [2022-11-16 11:51:23,086 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:51:23,087 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-16 11:51:23,199 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:51:23,199 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-16 11:51:23,234 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-16 11:51:23,247 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 561 trivial. 395 not checked. [2022-11-16 11:51:23,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:23,272 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5556 (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_5556) |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-16 11:51:23,286 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5556 (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_5556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-16 11:51:23,676 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5602 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5556 (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~mem39#1.base| v_ArrVal_5602))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5556)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2022-11-16 11:51:23,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1754343405] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:23,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:51:23,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 27 [2022-11-16 11:51:23,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159562319] [2022-11-16 11:51:23,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:51:23,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-16 11:51:23,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:51:23,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-16 11:51:23,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=134, Unknown=34, NotChecked=1012, Total=1260 [2022-11-16 11:51:23,683 INFO L87 Difference]: Start difference. First operand 4314 states and 6331 transitions. Second operand has 28 states, 26 states have (on average 4.230769230769231) internal successors, (110), 28 states have internal predecessors, (110), 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-16 11:51:24,127 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (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_5065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5065))) (exists ((v_ArrVal_5518 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5518) |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_5046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5046))) (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_5057 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5057))) (exists ((v_ArrVal_5043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5043))) (exists ((v_ArrVal_5077 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5077))) (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_5538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5538))) (exists ((v_ArrVal_5525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5525))) (exists ((v_ArrVal_5073 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5073))) (exists ((v_ArrVal_5042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5042))) (exists ((v_ArrVal_5554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5554)))) is different from true [2022-11-16 11:51:24,135 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5530 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5530))) (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_5065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5065))) (exists ((v_ArrVal_5518 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5518) |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_5046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5046))) (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_5058 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5058) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5057 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5057))) (exists ((v_ArrVal_5043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5043))) (exists ((v_ArrVal_5077 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5077))) (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_5538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5538))) (exists ((v_ArrVal_5525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5525))) (exists ((v_ArrVal_5073 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5073))) (exists ((v_ArrVal_5042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5042))) (exists ((v_ArrVal_5047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5047))) (exists ((v_ArrVal_5554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5554)))) is different from true [2022-11-16 11:51:24,143 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_53 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (not (= v_arrayElimCell_53 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_53) (_ bv1 1))) (= (bvadd (_ bv1 1) (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_5|)) (_ bv0 1)))) (exists ((v_ArrVal_5530 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5530))) (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_5065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5065))) (exists ((v_ArrVal_5518 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5518) |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_5046 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5046))) (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_5058 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5058) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5057 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5057))) (exists ((v_ArrVal_5043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5043))) (exists ((v_ArrVal_5077 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5077))) (exists ((v_ArrVal_5531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5531))) (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_5538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5538))) (exists ((v_ArrVal_5525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5525))) (exists ((v_ArrVal_5073 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5073))) (exists ((v_ArrVal_5042 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5042))) (exists ((v_ArrVal_5047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5047))) (exists ((v_ArrVal_5554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5554)))) is different from true [2022-11-16 11:51:32,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:32,307 INFO L93 Difference]: Finished difference Result 6381 states and 9570 transitions. [2022-11-16 11:51:32,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:51:32,308 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 4.230769230769231) internal successors, (110), 28 states have internal predecessors, (110), 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 122 [2022-11-16 11:51:32,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:32,316 INFO L225 Difference]: With dead ends: 6381 [2022-11-16 11:51:32,316 INFO L226 Difference]: Without dead ends: 6381 [2022-11-16 11:51:32,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 150 SyntacticMatches, 72 SemanticMatches, 40 ConstructedPredicates, 26 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=105, Invalid=199, Unknown=40, NotChecked=1378, Total=1722 [2022-11-16 11:51:32,318 INFO L413 NwaCegarLoop]: 970 mSDtfsCounter, 1587 mSDsluCounter, 4758 mSDsCounter, 0 mSdLazyCounter, 2579 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1596 SdHoareTripleChecker+Valid, 5728 SdHoareTripleChecker+Invalid, 52450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49859 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:32,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1596 Valid, 5728 Invalid, 52450 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [12 Valid, 2579 Invalid, 0 Unknown, 49859 Unchecked, 8.2s Time] [2022-11-16 11:51:32,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6381 states. [2022-11-16 11:51:32,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6381 to 4313. [2022-11-16 11:51:32,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4313 states, 3635 states have (on average 1.718569463548831) internal successors, (6247), 4273 states have internal predecessors, (6247), 38 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2022-11-16 11:51:32,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4313 states to 4313 states and 6328 transitions. [2022-11-16 11:51:32,372 INFO L78 Accepts]: Start accepts. Automaton has 4313 states and 6328 transitions. Word has length 122 [2022-11-16 11:51:32,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:32,373 INFO L495 AbstractCegarLoop]: Abstraction has 4313 states and 6328 transitions. [2022-11-16 11:51:32,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 4.230769230769231) internal successors, (110), 28 states have internal predecessors, (110), 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-16 11:51:32,373 INFO L276 IsEmpty]: Start isEmpty. Operand 4313 states and 6328 transitions. [2022-11-16 11:51:32,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-16 11:51:32,375 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:32,375 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] [2022-11-16 11:51:32,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Ended with exit code 0 [2022-11-16 11:51:32,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2022-11-16 11:51:32,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt [2022-11-16 11:51:32,792 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:51:32,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:32,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1638848774, now seen corresponding path program 1 times [2022-11-16 11:51:32,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:51:32,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662039268] [2022-11-16 11:51:32,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:32,793 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-16 11:51:32,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:51:32,794 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:51:32,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2022-11-16 11:51:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:34,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-16 11:51:34,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:34,235 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-16 11:51:34,416 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-16 11:51:34,433 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:51:34,433 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-16 11:51:34,462 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-16 11:51:34,473 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-16 11:51:34,629 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-16 11:51:34,635 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-16 11:51:34,718 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5985))) (exists ((v_ArrVal_5984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5984) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:51:34,733 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5986))) (exists ((v_ArrVal_5987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5987)))) is different from true [2022-11-16 11:51:34,807 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5990))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5991)))) is different from true [2022-11-16 11:51:34,826 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5992))) (exists ((v_ArrVal_5993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5993) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32)))) is different from true [2022-11-16 11:51:34,845 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5994 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5994))) (exists ((v_ArrVal_5995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5995)))) is different from true [2022-11-16 11:51:34,863 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5996))) (exists ((v_ArrVal_5997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5997)))) is different from true [2022-11-16 11:51:34,882 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5999))) (exists ((v_ArrVal_5998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5998)))) is different from true [2022-11-16 11:51:34,901 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6001))) (exists ((v_ArrVal_6000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6000)))) is different from true [2022-11-16 11:51:34,919 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6002))) (exists ((v_ArrVal_6003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6003) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:51:34,938 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6005) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6004)))) is different from true [2022-11-16 11:51:34,956 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6006))) (exists ((v_ArrVal_6007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6007)))) is different from true [2022-11-16 11:51:34,974 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6008))) (exists ((v_ArrVal_6009 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6009) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32)))) is different from true [2022-11-16 11:51:34,992 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6011))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6010)))) is different from true [2022-11-16 11:51:35,010 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6012 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6012) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6013)))) is different from true [2022-11-16 11:51:35,029 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6015 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6015) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6014)))) is different from true [2022-11-16 11:51:35,046 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6017))) (exists ((v_ArrVal_6016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6016)))) is different from true [2022-11-16 11:51:35,065 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6019))) (exists ((v_ArrVal_6018 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6018) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32)))) is different from true [2022-11-16 11:51:35,083 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6021))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6020 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6020) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:51:35,101 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6023))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6022)))) is different from true [2022-11-16 11:51:35,164 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6026))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6027) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:51:35,182 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6028) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6029 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6029) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:51:35,201 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6031 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6031) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6030 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6030)))) is different from true [2022-11-16 11:51:35,220 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6033) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6032 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6032)))) is different from true [2022-11-16 11:51:35,239 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6035))) (exists ((v_ArrVal_6034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6034)))) is different from true [2022-11-16 11:51:35,257 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6037 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6037))) (exists ((v_ArrVal_6036 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6036) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:51:35,280 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6038) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6039)))) is different from true [2022-11-16 11:51:35,298 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6040 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6040) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6041) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:51:35,315 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6043))) (exists ((v_ArrVal_6042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6042) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:51:35,331 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6045))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6044)))) is different from true [2022-11-16 11:51:35,347 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6047))) (exists ((v_ArrVal_6046 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6046) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:51:35,363 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6049 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6049) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6048)))) is different from true [2022-11-16 11:51:35,379 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6050 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6050) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6051) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:51:35,395 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6053 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6053) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6052 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6052) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:51:35,415 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6055 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6055) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6054)))) is different from true [2022-11-16 11:51:35,434 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6057 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6057))) (exists ((v_ArrVal_6056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6056)))) is different from true [2022-11-16 11:51:35,453 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6059 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6059))) (exists ((v_ArrVal_6058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6058)))) is different from true [2022-11-16 11:51:35,471 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6061 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6061))) (exists ((v_ArrVal_6060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6060)))) is different from true [2022-11-16 11:51:35,490 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6062 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6062))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6063 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6063)))) is different from true [2022-11-16 11:51:35,509 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6065))) (exists ((v_ArrVal_6064 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6064) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32)))) is different from true [2022-11-16 11:51:35,528 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6066 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6066) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6067 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6067)))) is different from true [2022-11-16 11:51:35,547 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6069))) (exists ((v_ArrVal_6068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6068) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:51:35,594 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6070))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6071) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:51:35,660 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:51:35,660 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-16 11:51:35,669 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-16 11:51:35,854 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:51:35,855 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-16 11:51:35,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-16 11:51:35,908 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-16 11:51:35,918 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-16 11:51:35,967 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 987 not checked. [2022-11-16 11:51:35,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:36,209 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-16 11:51:36,272 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2022-11-16 11:51:37,627 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6165 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6164) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6165 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6165))) (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~mem39#1.base| v_ArrVal_6164) .cse2 v_ArrVal_6072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-16 11:51:37,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:51:37,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662039268] [2022-11-16 11:51:37,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662039268] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:37,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1936273765] [2022-11-16 11:51:37,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:37,645 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:51:37,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:51:37,646 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:51:37,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2022-11-16 11:53:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:53:56,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-16 11:53:56,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:53:56,479 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-16 11:53:56,661 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-16 11:53:56,677 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:53:56,677 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-16 11:53:56,694 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-16 11:53:56,708 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-16 11:53:56,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 11:53:56,790 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-16 11:53:56,856 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6547) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6548) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32)))) is different from true [2022-11-16 11:53:56,871 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6550 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6550))) (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-16 11:53:56,889 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6551) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6552)))) is different from true [2022-11-16 11:53:56,906 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6553))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6554)))) is different from true [2022-11-16 11:53:56,924 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6556 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6556))) (exists ((v_ArrVal_6555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6555))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32)))) is different from true [2022-11-16 11:53:56,942 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6557))) (exists ((v_ArrVal_6558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6558) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32)))) is different from true [2022-11-16 11:53:56,960 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6560))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6559) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:53:56,977 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6562))) (exists ((v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6561) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:53:56,995 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6563) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6564))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32)))) is different from true [2022-11-16 11:53:57,012 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6565))) (exists ((v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6566)))) is different from true [2022-11-16 11:53:57,030 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6567) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6568) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:53:57,047 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6570))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6569)))) is different from true [2022-11-16 11:53:57,064 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6572 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6572))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6571)))) is different from true [2022-11-16 11:53:57,082 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6573))) (exists ((v_ArrVal_6574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6574) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:53:57,099 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6576 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6576) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6575 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6575)))) is different from true [2022-11-16 11:53:57,117 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6577))) (exists ((v_ArrVal_6578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6578))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32)))) is different from true [2022-11-16 11:53:57,138 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6579 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6579))) (exists ((v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6580)))) is different from true [2022-11-16 11:53:57,155 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6581))) (exists ((v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6582) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:53:57,172 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6583))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6584)))) is different from true [2022-11-16 11:53:57,189 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6586 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6586))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6585) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:53:57,206 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6587 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6587))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6588 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6588)))) is different from true [2022-11-16 11:53:57,223 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6589 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6589))) (exists ((v_ArrVal_6590 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6590) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:53:57,240 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6591 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6591))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6592 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6592) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:53:57,257 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6594 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6594) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6593 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6593) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:53:57,274 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6596 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6596) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6595 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6595) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:53:57,291 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6598) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6597 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6597) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32)))) is different from true [2022-11-16 11:53:57,309 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6600) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6599 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6599)))) is different from true [2022-11-16 11:53:57,326 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6601 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6601))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6602 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6602) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:53:57,344 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6603 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6603))) (exists ((v_ArrVal_6604 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6604) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32)))) is different from true [2022-11-16 11:53:57,362 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6606 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6606) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6605 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6605) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:53:57,379 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6607 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6607))) (exists ((v_ArrVal_6608 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6608) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:53:57,397 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6610 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6610))) (exists ((v_ArrVal_6609 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6609)))) is different from true [2022-11-16 11:53:57,415 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6612 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6612) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6611 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6611)))) is different from true [2022-11-16 11:53:57,432 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6613 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6613) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6614 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6614) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:53:57,450 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6616) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6615) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:53:57,467 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6618 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6618) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6617) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:53:57,485 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6619 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6619))) (exists ((v_ArrVal_6620 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6620) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:53:57,503 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6622))) (exists ((v_ArrVal_6621 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6621)))) is different from true [2022-11-16 11:53:57,520 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6624))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6623)))) is different from true [2022-11-16 11:53:57,537 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6625 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6625))) (exists ((v_ArrVal_6626 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6626)))) is different from true [2022-11-16 11:53:57,555 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6627 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6627))) (exists ((v_ArrVal_6628 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6628)))) is different from true [2022-11-16 11:53:57,572 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6629 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6629))) (exists ((v_ArrVal_6630 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6630) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:53:57,594 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6631) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6632 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6632) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:53:57,611 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6633))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6634 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6634) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:53:57,675 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:53:57,676 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-16 11:53:57,720 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-16 11:53:57,871 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:53:57,871 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-16 11:53:57,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-16 11:53:57,921 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-16 11:53:57,931 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-16 11:53:57,938 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 990 not checked. [2022-11-16 11:53:57,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:53:58,043 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-11-16 11:53:58,085 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2022-11-16 11:53:59,240 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6728))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6727) .cse0 v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6727) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2022-11-16 11:53:59,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1936273765] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:53:59,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:53:59,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 52] total 95 [2022-11-16 11:53:59,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815678961] [2022-11-16 11:53:59,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:53:59,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-11-16 11:53:59,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:53:59,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-11-16 11:53:59,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=190, Unknown=99, NotChecked=10212, Total=10712 [2022-11-16 11:53:59,258 INFO L87 Difference]: Start difference. First operand 4313 states and 6328 transitions. Second operand has 96 states, 94 states have (on average 1.7659574468085106) internal successors, (166), 96 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-16 11:54:00,202 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6547) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6548) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5985))) (exists ((v_ArrVal_5984 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5984) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:54:00,206 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6550 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6550))) (exists ((v_ArrVal_5986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5986))) (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))) (exists ((v_ArrVal_5987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5987)))) is different from true [2022-11-16 11:54:00,211 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5988))) (exists ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5989) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6551) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6552)))) is different from true [2022-11-16 11:54:00,216 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6026))) (exists ((v_ArrVal_6553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6553))) (exists ((v_ArrVal_5990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5990))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6554 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6554))) (exists ((v_ArrVal_5991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5991))) (exists ((v_ArrVal_6027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6027) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:54:00,221 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6556 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6556))) (exists ((v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5992))) (exists ((v_ArrVal_5993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5993) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6555))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6028) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6029 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6029) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:54:00,226 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6557))) (exists ((v_ArrVal_6031 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6031) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6558 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6558) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5994 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5994))) (exists ((v_ArrVal_5995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5995))) (exists ((v_ArrVal_6030 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6030)))) is different from true [2022-11-16 11:54:00,231 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6560))) (exists ((v_ArrVal_6033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6033) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5996))) (exists ((v_ArrVal_5997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5997))) (exists ((v_ArrVal_6559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6559) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6032 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6032)))) is different from true [2022-11-16 11:54:00,235 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5999))) (exists ((v_ArrVal_6562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6562))) (exists ((v_ArrVal_6035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6035))) (exists ((v_ArrVal_5998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5998))) (exists ((v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6561) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6034)))) is different from true [2022-11-16 11:54:00,240 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6563) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6564))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6037 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6037))) (exists ((v_ArrVal_6001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6001))) (exists ((v_ArrVal_6036 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6036) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6000)))) is different from true [2022-11-16 11:54:00,245 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6038) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6002))) (exists ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6565))) (exists ((v_ArrVal_6039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6039))) (exists ((v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6566))) (exists ((v_ArrVal_6003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6003) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:54:00,250 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6005) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6040 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6040) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6567) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6568) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6041) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6004)))) is different from true [2022-11-16 11:54:00,255 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6570))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6043))) (exists ((v_ArrVal_6569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6569))) (exists ((v_ArrVal_6006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6006))) (exists ((v_ArrVal_6007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6007))) (exists ((v_ArrVal_6042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6042) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:54:00,260 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6572 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6572))) (exists ((v_ArrVal_6008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6008))) (exists ((v_ArrVal_6009 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6009) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6045))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6044))) (exists ((v_ArrVal_6571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6571)))) is different from true [2022-11-16 11:54:00,264 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6011))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6047))) (exists ((v_ArrVal_6573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6573))) (exists ((v_ArrVal_6046 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6046) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6574) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6010)))) is different from true [2022-11-16 11:54:00,269 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6012 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6012) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6049 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6049) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6576 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6576) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6575 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6575))) (exists ((v_ArrVal_6013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6013))) (exists ((v_ArrVal_6048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6048)))) is different from true [2022-11-16 11:54:00,274 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6577))) (exists ((v_ArrVal_6578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6578))) (exists ((v_ArrVal_6050 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6050) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6015 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6015) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6014))) (exists ((v_ArrVal_6051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6051) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:54:00,279 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6053 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6053) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6052 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6052) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6579 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6579))) (exists ((v_ArrVal_6017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6017))) (exists ((v_ArrVal_6016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6016))) (exists ((v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6580)))) is different from true [2022-11-16 11:54:00,283 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6019))) (exists ((v_ArrVal_6018 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6018) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6055 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6055) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6054))) (exists ((v_ArrVal_6581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6581))) (exists ((v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6582) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:54:00,288 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6021))) (exists ((v_ArrVal_6583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6583))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6584))) (exists ((v_ArrVal_6057 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6057))) (exists ((v_ArrVal_6020 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6020) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6056)))) is different from true [2022-11-16 11:54:00,293 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6023))) (exists ((v_ArrVal_6586 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6586))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6059 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6059))) (exists ((v_ArrVal_6058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6058))) (exists ((v_ArrVal_6585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6585) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6022)))) is different from true [2022-11-16 11:54:00,321 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6587 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6587))) (exists ((v_ArrVal_5988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5988))) (exists ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5989) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6588 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6588))) (exists ((v_ArrVal_6061 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6061))) (exists ((v_ArrVal_6060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6060)))) is different from true [2022-11-16 11:54:00,325 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6026))) (exists ((v_ArrVal_5990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5990))) (exists ((v_ArrVal_6062 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6062))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6063 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6063))) (exists ((v_ArrVal_6589 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6589))) (exists ((v_ArrVal_5991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5991))) (exists ((v_ArrVal_6590 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6590) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6027) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:54:00,331 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6065))) (exists ((v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5992))) (exists ((v_ArrVal_6591 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6591))) (exists ((v_ArrVal_5993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5993) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6064 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6064) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6028) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6592 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6592) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6029 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6029) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:54:00,336 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6594 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6594) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6031 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6031) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5994 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5994))) (exists ((v_ArrVal_5995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5995))) (exists ((v_ArrVal_6066 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6066) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6030 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6030))) (exists ((v_ArrVal_6593 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6593) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6067 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6067)))) is different from true [2022-11-16 11:54:00,341 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6033) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6596 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6596) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5996))) (exists ((v_ArrVal_6595 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6595) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5997))) (exists ((v_ArrVal_6069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6069))) (exists ((v_ArrVal_6068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6032 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6032)))) is different from true [2022-11-16 11:54:00,346 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6598) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6597 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6597) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6070))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5999))) (exists ((v_ArrVal_6071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6035))) (exists ((v_ArrVal_5998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5998))) (exists ((v_ArrVal_6034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6034)))) is different from true [2022-11-16 11:54:00,369 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6600) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6037 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6037))) (exists ((v_ArrVal_6001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6001))) (exists ((v_ArrVal_6599 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6599))) (exists ((v_ArrVal_6036 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6036) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6000)))) is different from true [2022-11-16 11:54:00,374 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6601 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6601))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6602 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6602) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6038) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6002))) (exists ((v_ArrVal_6039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6039))) (exists ((v_ArrVal_6003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6003) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:54:00,379 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6603 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6603))) (exists ((v_ArrVal_6604 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6604) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6005) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6040 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6040) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6041) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6004)))) is different from true [2022-11-16 11:54:00,383 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6043))) (exists ((v_ArrVal_6606 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6606) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6006))) (exists ((v_ArrVal_6605 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6605) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6007))) (exists ((v_ArrVal_6042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6042) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:54:00,388 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6008))) (exists ((v_ArrVal_6009 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6009) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6045))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6607 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6607))) (exists ((v_ArrVal_6044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6044))) (exists ((v_ArrVal_6608 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6608) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:54:00,393 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6011))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6047))) (exists ((v_ArrVal_6610 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6610))) (exists ((v_ArrVal_6609 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6609))) (exists ((v_ArrVal_6046 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6046) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6010)))) is different from true [2022-11-16 11:54:00,398 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6612 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6612) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6012 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6012) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6049 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6049) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6611 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6611))) (exists ((v_ArrVal_6013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6013))) (exists ((v_ArrVal_6048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6048)))) is different from true [2022-11-16 11:54:00,405 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6050 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6050) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6015 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6015) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6014 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6014))) (exists ((v_ArrVal_6613 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6613) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6051 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6051) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6614 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6614) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:54:00,410 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6616) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6053 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6053) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6615) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6052 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6052) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6017))) (exists ((v_ArrVal_6016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6016)))) is different from true [2022-11-16 11:54:00,415 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6019))) (exists ((v_ArrVal_6018 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6018) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6618 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6618) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6055 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6055) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6617) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6054 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6054)))) is different from true [2022-11-16 11:54:00,420 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6021 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6021))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6619 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6619))) (exists ((v_ArrVal_6057 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6057))) (exists ((v_ArrVal_6620 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6620) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6020 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6020) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6056 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6056)))) is different from true [2022-11-16 11:54:00,425 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6023 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6023))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6059 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6059))) (exists ((v_ArrVal_6058 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6058))) (exists ((v_ArrVal_6622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6622))) (exists ((v_ArrVal_6621 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6621))) (exists ((v_ArrVal_6022 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6022)))) is different from true [2022-11-16 11:54:00,430 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6624))) (exists ((v_ArrVal_5988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5988))) (exists ((v_ArrVal_5989 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5989) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6061 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6061))) (exists ((v_ArrVal_6060 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6060))) (exists ((v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6623)))) is different from true [2022-11-16 11:54:00,435 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6026))) (exists ((v_ArrVal_5990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5990))) (exists ((v_ArrVal_6062 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6062))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6063 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6063))) (exists ((v_ArrVal_5991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5991))) (exists ((v_ArrVal_6625 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6625))) (exists ((v_ArrVal_6027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6027) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6626 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6626)))) is different from true [2022-11-16 11:54:00,440 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6065 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6065))) (exists ((v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5992))) (exists ((v_ArrVal_5993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5993) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6064 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6064) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6627 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6627))) (exists ((v_ArrVal_6028 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6028) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6628 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6628))) (exists ((v_ArrVal_6029 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6029) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:54:00,446 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6031 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6031) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5994 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5994))) (exists ((v_ArrVal_6629 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6629))) (exists ((v_ArrVal_5995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5995))) (exists ((v_ArrVal_6630 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6630) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6066 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6066) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6030 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6030))) (exists ((v_ArrVal_6067 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6067)))) is different from true [2022-11-16 11:54:00,456 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6631) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6033) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6632 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6632) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5996))) (exists ((v_ArrVal_5997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5997))) (exists ((v_ArrVal_6069 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6069))) (exists ((v_ArrVal_6068 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6068) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6032 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6032)))) is different from true [2022-11-16 11:54:00,462 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6633))) (exists ((v_ArrVal_6070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6070))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_5999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5999))) (exists ((v_ArrVal_6071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6035 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6035))) (exists ((v_ArrVal_5998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5998))) (exists ((v_ArrVal_6034 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6034))) (exists ((v_ArrVal_6634 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6634) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:54:00,467 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6037 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6037))) (exists ((v_ArrVal_6001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6001))) (exists ((v_ArrVal_6036 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6036) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6000)))) is different from true [2022-11-16 11:54:00,473 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6633))) (exists ((v_ArrVal_6070 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6070))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6071 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6071) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6634 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6634) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:54:00,478 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6038) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6002 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6002))) (exists ((v_ArrVal_6039 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6039))) (exists ((v_ArrVal_6003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6003) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:54:00,484 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6005 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6005) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6040 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6040) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6041) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6004)))) is different from true [2022-11-16 11:54:00,490 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6043 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6043))) (exists ((v_ArrVal_6006 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6006))) (exists ((v_ArrVal_6007 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6007))) (exists ((v_ArrVal_6042 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6042) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:54:00,500 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6008))) (exists ((v_ArrVal_6009 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6009) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6045 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6045))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6044 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6044)))) is different from true [2022-11-16 11:54:00,576 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6011))) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6047))) (exists ((v_ArrVal_6046 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6046) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6010)))) is different from true [2022-11-16 11:54:00,613 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6012 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6012) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6049 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6049) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6013))) (exists ((v_ArrVal_6048 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6048)))) is different from true [2022-11-16 11:54:00,743 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6026 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6026))) (exists ((v_ArrVal_5990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5990))) (exists ((v_ArrVal_6053 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6053) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_65 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_65) (_ bv44 32))) (exists ((v_ArrVal_6052 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6052) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_5991))) (exists ((v_ArrVal_6017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6017))) (exists ((v_ArrVal_6027 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6027) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_6016)))) is different from true [2022-11-16 11:54:20,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:20,357 INFO L93 Difference]: Finished difference Result 6414 states and 9614 transitions. [2022-11-16 11:54:20,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-16 11:54:20,358 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 94 states have (on average 1.7659574468085106) internal successors, (166), 96 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 122 [2022-11-16 11:54:20,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:20,366 INFO L225 Difference]: With dead ends: 6414 [2022-11-16 11:54:20,367 INFO L226 Difference]: Without dead ends: 6414 [2022-11-16 11:54:20,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 150 SyntacticMatches, 6 SemanticMatches, 162 ConstructedPredicates, 145 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=362, Invalid=401, Unknown=159, NotChecked=25810, Total=26732 [2022-11-16 11:54:20,372 INFO L413 NwaCegarLoop]: 981 mSDtfsCounter, 1589 mSDsluCounter, 4284 mSDsCounter, 0 mSdLazyCounter, 6549 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1598 SdHoareTripleChecker+Valid, 5265 SdHoareTripleChecker+Invalid, 158629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 6549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152066 IncrementalHoareTripleChecker+Unchecked, 19.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:20,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1598 Valid, 5265 Invalid, 158629 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [14 Valid, 6549 Invalid, 0 Unknown, 152066 Unchecked, 19.7s Time] [2022-11-16 11:54:20,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6414 states. [2022-11-16 11:54:20,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6414 to 4334. [2022-11-16 11:54:20,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4334 states, 3655 states have (on average 1.7149110807113543) internal successors, (6268), 4291 states have internal predecessors, (6268), 38 states have call successors, (38), 5 states have call predecessors, (38), 7 states have return successors, (46), 38 states have call predecessors, (46), 38 states have call successors, (46) [2022-11-16 11:54:20,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4334 states to 4334 states and 6352 transitions. [2022-11-16 11:54:20,462 INFO L78 Accepts]: Start accepts. Automaton has 4334 states and 6352 transitions. Word has length 122 [2022-11-16 11:54:20,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:20,463 INFO L495 AbstractCegarLoop]: Abstraction has 4334 states and 6352 transitions. [2022-11-16 11:54:20,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 94 states have (on average 1.7659574468085106) internal successors, (166), 96 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-16 11:54:20,463 INFO L276 IsEmpty]: Start isEmpty. Operand 4334 states and 6352 transitions. [2022-11-16 11:54:20,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-11-16 11:54:20,465 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:20,465 INFO L195 NwaCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:54:20,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2022-11-16 11:54:20,722 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (43)] Ended with exit code 0 [2022-11-16 11:54:20,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt [2022-11-16 11:54:20,881 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:54:20,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:20,882 INFO L85 PathProgramCache]: Analyzing trace with hash -130592965, now seen corresponding path program 2 times [2022-11-16 11:54:20,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:54:20,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026780176] [2022-11-16 11:54:20,883 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:54:20,884 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-16 11:54:20,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:54:20,886 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:54:20,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-11-16 11:54:22,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:54:22,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:54:22,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 11:54:22,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:54:24,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:24,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:54:35,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 45 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:35,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:54:35,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026780176] [2022-11-16 11:54:35,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026780176] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:54:35,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:54:35,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 94 [2022-11-16 11:54:35,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566924623] [2022-11-16 11:54:35,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:54:35,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2022-11-16 11:54:35,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:54:35,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2022-11-16 11:54:35,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1311, Invalid=7431, Unknown=0, NotChecked=0, Total=8742 [2022-11-16 11:54:35,943 INFO L87 Difference]: Start difference. First operand 4334 states and 6352 transitions. Second operand has 94 states, 94 states have (on average 1.797872340425532) internal successors, (169), 94 states have internal predecessors, (169), 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-16 11:55:08,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:08,617 INFO L93 Difference]: Finished difference Result 4470 states and 6672 transitions. [2022-11-16 11:55:08,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2022-11-16 11:55:08,618 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 1.797872340425532) internal successors, (169), 94 states have internal predecessors, (169), 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-16 11:55:08,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:08,623 INFO L225 Difference]: With dead ends: 4470 [2022-11-16 11:55:08,623 INFO L226 Difference]: Without dead ends: 4464 [2022-11-16 11:55:08,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=5761, Invalid=27545, Unknown=0, NotChecked=0, Total=33306 [2022-11-16 11:55:08,628 INFO L413 NwaCegarLoop]: 1748 mSDtfsCounter, 3294 mSDsluCounter, 81831 mSDsCounter, 0 mSdLazyCounter, 10883 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3294 SdHoareTripleChecker+Valid, 83579 SdHoareTripleChecker+Invalid, 11195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 10883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:08,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3294 Valid, 83579 Invalid, 11195 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [312 Valid, 10883 Invalid, 0 Unknown, 0 Unchecked, 26.4s Time] [2022-11-16 11:55:08,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4464 states. [2022-11-16 11:55:08,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4464 to 4380. [2022-11-16 11:55:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4380 states, 3703 states have (on average 1.7096948420199838) internal successors, (6331), 4339 states have internal predecessors, (6331), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2022-11-16 11:55:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4380 states to 4380 states and 6412 transitions. [2022-11-16 11:55:08,745 INFO L78 Accepts]: Start accepts. Automaton has 4380 states and 6412 transitions. Word has length 123 [2022-11-16 11:55:08,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:08,745 INFO L495 AbstractCegarLoop]: Abstraction has 4380 states and 6412 transitions. [2022-11-16 11:55:08,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 1.797872340425532) internal successors, (169), 94 states have internal predecessors, (169), 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-16 11:55:08,746 INFO L276 IsEmpty]: Start isEmpty. Operand 4380 states and 6412 transitions. [2022-11-16 11:55:08,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-11-16 11:55:08,747 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:08,747 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] [2022-11-16 11:55:08,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Forceful destruction successful, exit code 0 [2022-11-16 11:55:08,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:55:08,963 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-11-16 11:55:08,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:08,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2050272681, now seen corresponding path program 1 times [2022-11-16 11:55:08,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:55:08,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662963400] [2022-11-16 11:55:08,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:08,966 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-16 11:55:08,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:55:08,967 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:55:08,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2022-11-16 11:55:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:10,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-16 11:55:10,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:55:10,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:55:10,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:55:10,667 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:55:10,667 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-16 11:55:10,694 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-16 11:55:10,706 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-16 11:55:10,876 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-16 11:55:10,885 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-16 11:55:10,971 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7506 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7506))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7507)))) is different from true [2022-11-16 11:55:10,988 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7509) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7508)))) is different from true [2022-11-16 11:55:11,006 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7510))) (exists ((v_ArrVal_7511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7511))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32)))) is different from true [2022-11-16 11:55:11,086 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7512) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7513)))) is different from true [2022-11-16 11:55:11,112 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7515))) (exists ((v_ArrVal_7514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7514)))) is different from true [2022-11-16 11:55:11,151 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7516))) (exists ((v_ArrVal_7517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7517) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32)))) is different from true [2022-11-16 11:55:11,285 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7522 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7522))) (exists ((v_ArrVal_7523 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7523)))) is different from true [2022-11-16 11:55:11,302 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7525 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7525) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7524 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7524) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:55:11,319 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7527))) (exists ((v_ArrVal_7526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7526) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:55:11,337 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7528 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7528))) (exists ((v_ArrVal_7529 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7529)))) is different from true [2022-11-16 11:55:11,356 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7530 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7530))) (exists ((v_ArrVal_7531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7531)))) is different from true [2022-11-16 11:55:11,485 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7536))) (exists ((v_ArrVal_7537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7537)))) is different from true [2022-11-16 11:55:11,624 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7545 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7545))) (exists ((v_ArrVal_7544 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7544)))) is different from true [2022-11-16 11:55:11,639 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7546))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7547)))) is different from true [2022-11-16 11:55:11,655 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7549 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7549))) (exists ((v_ArrVal_7548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7548)))) is different from true [2022-11-16 11:55:11,710 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7553) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7552)))) is different from true [2022-11-16 11:55:11,726 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7555 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7555) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7554) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:55:11,741 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7557))) (exists ((v_ArrVal_7556 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7556)))) is different from true [2022-11-16 11:55:11,756 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7558))) (exists ((v_ArrVal_7559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7559)))) is different from true [2022-11-16 11:55:11,771 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7561) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7560) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:55:11,786 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7563 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7563))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7562)))) is different from true [2022-11-16 11:55:11,807 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7565 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7565) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_7564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7564)))) is different from true [2022-11-16 11:55:11,822 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7567) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7566)))) is different from true [2022-11-16 11:55:11,837 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7569 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7569) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7568 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7568)))) is different from true [2022-11-16 11:55:11,852 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7571))) (exists ((v_ArrVal_7570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7570)))) is different from true [2022-11-16 11:55:11,867 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7573 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7573) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7572 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7572)))) is different from true [2022-11-16 11:55:11,881 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7575 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7575))) (exists ((v_ArrVal_7574 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7574)))) is different from true [2022-11-16 11:55:11,896 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7576 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7576))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7577 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7577)))) is different from true [2022-11-16 11:55:11,915 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7578))) (exists ((v_ArrVal_7579 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7579)))) is different from true [2022-11-16 11:55:11,933 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7581))) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7580 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7580) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 11:55:11,950 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7582 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7582))) (exists ((v_ArrVal_7583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7583)))) is different from true [2022-11-16 11:55:11,967 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7584 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7584) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7585)))) is different from true [2022-11-16 11:55:11,985 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7586 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7586) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7587 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7587)))) is different from true [2022-11-16 11:55:12,002 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7589 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7589) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7588 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7588) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32)))) is different from true [2022-11-16 11:55:12,023 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7591 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7591) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7590 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7590)))) is different from true [2022-11-16 11:55:12,040 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_85 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_85) (_ bv44 32))) (exists ((v_ArrVal_7592 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7592) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_7593 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_7593)))) is different from true [2022-11-16 11:55:12,103 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:55:12,103 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-16 11:55:12,111 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-16 11:55:12,292 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:55:12,292 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-16 11:55:12,312 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-16 11:55:12,448 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:55:12,449 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-16 11:55:12,458 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-16 11:55:12,497 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-16 11:55:12,506 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-16 11:55:12,549 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 954 not checked. [2022-11-16 11:55:12,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:55:12,795 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7596 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7597 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7596) |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~mem42#1.base| v_ArrVal_7597) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7596 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_7596) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2022-11-16 11:55:12,836 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7596 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7597 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7596) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7597) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7596 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7596) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2022-11-16 11:55:13,170 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7594 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7595 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7596 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7594) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7595) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7596) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7594 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7595 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7596 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7597 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7595))) (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~mem41#1.base| v_ArrVal_7594) .cse2 v_ArrVal_7596) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7597) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2022-11-16 11:55:13,511 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7594 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7595 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7596 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7597 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7595))) (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_7594) .cse1 v_ArrVal_7596) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7597) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7594 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7595 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7596 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7594) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7595) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7596) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2022-11-16 11:55:16,719 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7594 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7689 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7688 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7595 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7596 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7597 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7688))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7595))) (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~mem39#1.base| v_ArrVal_7689) .cse0 v_ArrVal_7594) .cse1 v_ArrVal_7596) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7597) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7594 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7689 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7688 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7595 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7596 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7688))) (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~mem39#1.base| v_ArrVal_7689) .cse6 v_ArrVal_7594) (select (select (store .cse7 .cse6 v_ArrVal_7595) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7596))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2022-11-16 11:55:16,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:55:16,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662963400] [2022-11-16 11:55:16,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662963400] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:55:16,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1107248529] [2022-11-16 11:55:16,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:16,739 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:55:16,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:55:16,741 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:55:16,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97fef671-6ffe-4387-9eea-c4df482c6a23/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (46)] Waiting until timeout for monitored process