./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/busybox-1.22.0/hostid.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b 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_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/hostid.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP --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 64bit --witnessprinter.graph.data.programhash de0fc62ae58e6d221c3194714bc6cea21909b72dd1b37b4566b87d84683f34c8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:09:49,643 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:09:49,726 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2023-11-06 22:09:49,732 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:09:49,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:09:49,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:09:49,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:09:49,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:09:49,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:09:49,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:09:49,769 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:09:49,770 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:09:49,770 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:09:49,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:09:49,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:09:49,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:09:49,773 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:09:49,774 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:09:49,774 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:09:49,775 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:09:49,776 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:09:49,777 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:09:49,777 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:09:49,778 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:09:49,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:09:49,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:09:49,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:09:49,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:09:49,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:09:49,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:09:49,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:09:49,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:09:49,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:09:49,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:09:49,785 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:09:49,786 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/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_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de0fc62ae58e6d221c3194714bc6cea21909b72dd1b37b4566b87d84683f34c8 [2023-11-06 22:09:50,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:09:50,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:09:50,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:09:50,095 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:09:50,095 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:09:50,097 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/busybox-1.22.0/hostid.i [2023-11-06 22:09:53,330 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:09:53,782 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:09:53,782 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/sv-benchmarks/c/busybox-1.22.0/hostid.i [2023-11-06 22:09:53,811 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/data/070dc3f13/044c1f7ca3b0439fae2fd1b04bfeb541/FLAGdd13c45a2 [2023-11-06 22:09:53,827 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/data/070dc3f13/044c1f7ca3b0439fae2fd1b04bfeb541 [2023-11-06 22:09:53,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:09:53,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:09:53,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:09:53,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:09:53,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:09:53,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:09:53" (1/1) ... [2023-11-06 22:09:53,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@717fe8c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:53, skipping insertion in model container [2023-11-06 22:09:53,848 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:09:53" (1/1) ... [2023-11-06 22:09:53,946 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:09:55,112 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:09:55,131 ERROR L324 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) [2023-11-06 22:09:55,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6c0e99d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:09:55, skipping insertion in model container [2023-11-06 22:09:55,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:09:55,133 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-06 22:09:55,135 INFO L158 Benchmark]: Toolchain (without parser) took 1302.56ms. Allocated memory is still 125.8MB. Free memory was 78.2MB in the beginning and 93.0MB in the end (delta: -14.8MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2023-11-06 22:09:55,136 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 94.4MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:09:55,137 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1299.29ms. Allocated memory is still 125.8MB. Free memory was 78.0MB in the beginning and 93.0MB in the end (delta: -15.1MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2023-11-06 22:09:55,139 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 94.4MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1299.29ms. Allocated memory is still 125.8MB. Free memory was 78.0MB in the beginning and 93.0MB in the end (delta: -15.1MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1774]: 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_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/hostid.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP --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 64bit --witnessprinter.graph.data.programhash de0fc62ae58e6d221c3194714bc6cea21909b72dd1b37b4566b87d84683f34c8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:09:57,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:09:58,055 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2023-11-06 22:09:58,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:09:58,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:09:58,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:09:58,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:09:58,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:09:58,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:09:58,150 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:09:58,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:09:58,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:09:58,152 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:09:58,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:09:58,155 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:09:58,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:09:58,156 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:09:58,157 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:09:58,157 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:09:58,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:09:58,159 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:09:58,160 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:09:58,161 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:09:58,161 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:09:58,162 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:09:58,163 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:09:58,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:09:58,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:09:58,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:09:58,165 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:09:58,167 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:09:58,168 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:09:58,168 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:09:58,169 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:09:58,169 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:09:58,169 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:09:58,170 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:09:58,170 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:09:58,170 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/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_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de0fc62ae58e6d221c3194714bc6cea21909b72dd1b37b4566b87d84683f34c8 [2023-11-06 22:09:58,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:09:58,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:09:58,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:09:58,699 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:09:58,700 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:09:58,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/busybox-1.22.0/hostid.i [2023-11-06 22:10:01,968 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:10:02,431 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:10:02,432 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/sv-benchmarks/c/busybox-1.22.0/hostid.i [2023-11-06 22:10:02,467 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/data/8de8fb405/4ab498837b384b2ab5a9d3034bc6a08d/FLAG8763c89ed [2023-11-06 22:10:02,482 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/data/8de8fb405/4ab498837b384b2ab5a9d3034bc6a08d [2023-11-06 22:10:02,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:10:02,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:10:02,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:10:02,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:10:02,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:10:02,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:10:02" (1/1) ... [2023-11-06 22:10:02,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c8c0ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:02, skipping insertion in model container [2023-11-06 22:10:02,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:10:02" (1/1) ... [2023-11-06 22:10:02,602 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:10:03,577 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:10:03,595 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-06 22:10:03,636 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:10:03,702 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:10:03,709 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:10:03,815 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:10:03,982 WARN L672 CHandler]: The function fflush is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:10:03,990 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:10:03,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:03 WrapperNode [2023-11-06 22:10:03,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:10:03,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:10:03,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:10:03,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:10:04,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:03" (1/1) ... [2023-11-06 22:10:04,064 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:03" (1/1) ... [2023-11-06 22:10:04,109 INFO L138 Inliner]: procedures = 529, calls = 61, calls flagged for inlining = 7, calls inlined = 6, statements flattened = 138 [2023-11-06 22:10:04,110 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:10:04,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:10:04,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:10:04,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:10:04,120 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:03" (1/1) ... [2023-11-06 22:10:04,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:03" (1/1) ... [2023-11-06 22:10:04,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:03" (1/1) ... [2023-11-06 22:10:04,135 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:03" (1/1) ... [2023-11-06 22:10:04,153 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:03" (1/1) ... [2023-11-06 22:10:04,157 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:03" (1/1) ... [2023-11-06 22:10:04,164 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:03" (1/1) ... [2023-11-06 22:10:04,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:03" (1/1) ... [2023-11-06 22:10:04,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:10:04,177 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:10:04,177 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:10:04,177 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:10:04,178 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:03" (1/1) ... [2023-11-06 22:10:04,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:10:04,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:04,250 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:10:04,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:10:04,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:10:04,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:10:04,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:10:04,294 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2023-11-06 22:10:04,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:10:04,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:10:04,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:10:04,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:10:04,295 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:10:04,295 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:10:04,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:10:04,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 22:10:04,721 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:10:04,723 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:10:05,569 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:10:05,577 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:10:05,578 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 22:10:05,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:10:05 BoogieIcfgContainer [2023-11-06 22:10:05,580 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:10:05,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:10:05,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:10:05,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:10:05,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:10:02" (1/3) ... [2023-11-06 22:10:05,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5a438a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:10:05, skipping insertion in model container [2023-11-06 22:10:05,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:03" (2/3) ... [2023-11-06 22:10:05,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5a438a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:10:05, skipping insertion in model container [2023-11-06 22:10:05,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:10:05" (3/3) ... [2023-11-06 22:10:05,590 INFO L112 eAbstractionObserver]: Analyzing ICFG hostid.i [2023-11-06 22:10:05,611 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:10:05,611 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2023-11-06 22:10:05,662 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:10:05,669 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@68f15b07, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:10:05,669 INFO L358 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2023-11-06 22:10:05,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 58 states have (on average 1.8103448275862069) internal successors, (105), 95 states have internal predecessors, (105), 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) [2023-11-06 22:10:05,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-06 22:10:05,678 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:05,679 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-06 22:10:05,679 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-06 22:10:05,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:05,685 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-11-06 22:10:05,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:05,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346761437] [2023-11-06 22:10:05,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:05,702 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 [2023-11-06 22:10:05,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:05,708 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 22:10:05,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:05,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:10:05,937 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:06,026 INFO L351 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 [2023-11-06 22:10:06,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:06,041 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:06,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:06,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346761437] [2023-11-06 22:10:06,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346761437] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:06,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:06,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:10:06,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104760566] [2023-11-06 22:10:06,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:06,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:10:06,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:06,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:10:06,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:10:06,094 INFO L87 Difference]: Start difference. First operand has 98 states, 58 states have (on average 1.8103448275862069) internal successors, (105), 95 states have internal predecessors, (105), 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) 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) [2023-11-06 22:10:06,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:06,417 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2023-11-06 22:10:06,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:10:06,420 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 [2023-11-06 22:10:06,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:06,429 INFO L225 Difference]: With dead ends: 113 [2023-11-06 22:10:06,430 INFO L226 Difference]: Without dead ends: 111 [2023-11-06 22:10:06,431 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 [2023-11-06 22:10:06,435 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 73 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:06,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 92 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:10:06,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-06 22:10:06,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 94. [2023-11-06 22:10:06,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 91 states have internal predecessors, (96), 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) [2023-11-06 22:10:06,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2023-11-06 22:10:06,483 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 3 [2023-11-06 22:10:06,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:06,483 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2023-11-06 22:10:06,484 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) [2023-11-06 22:10:06,484 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2023-11-06 22:10:06,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-06 22:10:06,484 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:06,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-06 22:10:06,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:10:06,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:06,699 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-06 22:10:06,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:06,700 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-11-06 22:10:06,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:06,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711354627] [2023-11-06 22:10:06,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:06,702 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 [2023-11-06 22:10:06,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:06,703 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 22:10:06,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:06,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:10:06,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:06,858 INFO L351 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 [2023-11-06 22:10:06,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:06,872 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:06,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:06,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711354627] [2023-11-06 22:10:06,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711354627] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:06,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:06,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:10:06,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712368381] [2023-11-06 22:10:06,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:06,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:10:06,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:06,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:10:06,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:10:06,876 INFO L87 Difference]: Start difference. First operand 94 states and 98 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) [2023-11-06 22:10:07,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:07,353 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2023-11-06 22:10:07,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:10:07,354 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 [2023-11-06 22:10:07,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:07,356 INFO L225 Difference]: With dead ends: 93 [2023-11-06 22:10:07,356 INFO L226 Difference]: Without dead ends: 93 [2023-11-06 22:10:07,356 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 [2023-11-06 22:10:07,358 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:07,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 148 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:10:07,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-06 22:10:07,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-11-06 22:10:07,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 90 states have internal predecessors, (95), 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) [2023-11-06 22:10:07,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2023-11-06 22:10:07,369 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 3 [2023-11-06 22:10:07,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:07,370 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2023-11-06 22:10:07,370 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) [2023-11-06 22:10:07,370 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2023-11-06 22:10:07,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 22:10:07,371 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:07,371 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:10:07,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:07,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:07,586 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-06 22:10:07,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:07,587 INFO L85 PathProgramCache]: Analyzing trace with hash 889446313, now seen corresponding path program 1 times [2023-11-06 22:10:07,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:07,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636292417] [2023-11-06 22:10:07,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:07,589 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 [2023-11-06 22:10:07,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:07,590 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 22:10:07,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:07,747 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:10:07,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:07,767 INFO L351 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 [2023-11-06 22:10:07,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:07,872 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:07,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:07,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636292417] [2023-11-06 22:10:07,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636292417] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:07,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:07,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:10:07,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250420753] [2023-11-06 22:10:07,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:07,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:10:07,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:07,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:10:07,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:10:07,884 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) [2023-11-06 22:10:08,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:08,469 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2023-11-06 22:10:08,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:10:08,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2023-11-06 22:10:08,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:08,471 INFO L225 Difference]: With dead ends: 97 [2023-11-06 22:10:08,471 INFO L226 Difference]: Without dead ends: 97 [2023-11-06 22:10:08,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:10:08,473 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:08,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 203 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:10:08,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-06 22:10:08,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2023-11-06 22:10:08,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 59 states have (on average 1.6440677966101696) internal successors, (97), 92 states have internal predecessors, (97), 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) [2023-11-06 22:10:08,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2023-11-06 22:10:08,484 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 6 [2023-11-06 22:10:08,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:08,484 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2023-11-06 22:10:08,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) [2023-11-06 22:10:08,485 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2023-11-06 22:10:08,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 22:10:08,485 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:08,485 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:08,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:08,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:08,704 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-06 22:10:08,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:08,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1261842348, now seen corresponding path program 1 times [2023-11-06 22:10:08,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:08,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776846814] [2023-11-06 22:10:08,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:08,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:08,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:08,709 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 22:10:08,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:08,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:10:08,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:08,899 INFO L351 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 [2023-11-06 22:10:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:09,041 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:10:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:09,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:09,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776846814] [2023-11-06 22:10:09,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776846814] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:10:09,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:10:09,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-11-06 22:10:09,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015539084] [2023-11-06 22:10:09,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:10:09,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:10:09,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:09,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:10:09,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:10:09,949 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:11,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:11,889 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2023-11-06 22:10:11,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:10:11,891 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-06 22:10:11,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:11,893 INFO L225 Difference]: With dead ends: 101 [2023-11-06 22:10:11,893 INFO L226 Difference]: Without dead ends: 101 [2023-11-06 22:10:11,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:10:11,894 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 25 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:11,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 260 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-06 22:10:11,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-06 22:10:11,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-11-06 22:10:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 66 states have (on average 1.5606060606060606) internal successors, (103), 98 states have internal predecessors, (103), 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) [2023-11-06 22:10:11,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2023-11-06 22:10:11,904 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 10 [2023-11-06 22:10:11,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:11,905 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2023-11-06 22:10:11,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:11,905 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2023-11-06 22:10:11,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 22:10:11,906 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:11,906 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:11,926 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:12,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:12,121 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-06 22:10:12,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:12,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1448573334, now seen corresponding path program 1 times [2023-11-06 22:10:12,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:12,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543368608] [2023-11-06 22:10:12,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:12,123 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 [2023-11-06 22:10:12,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:12,125 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 22:10:12,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:12,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:10:12,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:12,410 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:12,410 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:10:12,539 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:12,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:12,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543368608] [2023-11-06 22:10:12,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [543368608] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:10:12,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:10:12,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-06 22:10:12,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410078897] [2023-11-06 22:10:12,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:10:12,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:10:12,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:12,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:10:12,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:10:12,542 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:10:12,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:12,897 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2023-11-06 22:10:12,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:10:12,903 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-11-06 22:10:12,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:12,904 INFO L225 Difference]: With dead ends: 121 [2023-11-06 22:10:12,904 INFO L226 Difference]: Without dead ends: 121 [2023-11-06 22:10:12,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:10:12,906 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 15 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:12,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 639 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:10:12,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-06 22:10:12,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-11-06 22:10:12,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 86 states have (on average 1.430232558139535) internal successors, (123), 118 states have internal predecessors, (123), 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) [2023-11-06 22:10:12,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2023-11-06 22:10:12,916 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 25 [2023-11-06 22:10:12,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:12,916 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2023-11-06 22:10:12,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:10:12,917 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2023-11-06 22:10:12,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-06 22:10:12,918 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:12,918 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:12,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-06 22:10:13,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:13,133 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-06 22:10:13,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:13,133 INFO L85 PathProgramCache]: Analyzing trace with hash -660691717, now seen corresponding path program 2 times [2023-11-06 22:10:13,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:13,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988576489] [2023-11-06 22:10:13,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:10:13,135 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:13,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:13,136 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 22:10:13,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:13,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:10:13,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:10:13,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:10:13,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:13,376 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:10:13,377 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-06 22:10:13,418 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-06 22:10:13,418 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:13,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:13,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988576489] [2023-11-06 22:10:13,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988576489] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:13,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:13,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:10:13,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974286282] [2023-11-06 22:10:13,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:13,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:10:13,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:13,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:10:13,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:10:13,424 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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) [2023-11-06 22:10:13,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:13,939 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2023-11-06 22:10:13,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:10:13,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 45 [2023-11-06 22:10:13,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:13,941 INFO L225 Difference]: With dead ends: 133 [2023-11-06 22:10:13,941 INFO L226 Difference]: Without dead ends: 133 [2023-11-06 22:10:13,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:10:13,943 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 58 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:13,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 95 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:10:13,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-06 22:10:13,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 116. [2023-11-06 22:10:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 86 states have (on average 1.372093023255814) internal successors, (118), 113 states have internal predecessors, (118), 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) [2023-11-06 22:10:13,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2023-11-06 22:10:13,956 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 45 [2023-11-06 22:10:13,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:13,956 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2023-11-06 22:10:13,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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) [2023-11-06 22:10:13,957 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2023-11-06 22:10:13,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-06 22:10:13,958 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:13,958 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:13,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:14,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:14,168 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-06 22:10:14,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:14,169 INFO L85 PathProgramCache]: Analyzing trace with hash -660691716, now seen corresponding path program 1 times [2023-11-06 22:10:14,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:14,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397136208] [2023-11-06 22:10:14,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:14,170 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 [2023-11-06 22:10:14,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:14,171 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 22:10:14,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:14,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 22:10:14,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:14,628 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:14,628 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:10:15,005 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:15,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:15,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397136208] [2023-11-06 22:10:15,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1397136208] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:10:15,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:10:15,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-11-06 22:10:15,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441143527] [2023-11-06 22:10:15,006 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:10:15,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-06 22:10:15,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:15,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-06 22:10:15,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-11-06 22:10:15,008 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:10:15,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:15,685 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2023-11-06 22:10:15,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:10:15,688 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2023-11-06 22:10:15,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:15,690 INFO L225 Difference]: With dead ends: 124 [2023-11-06 22:10:15,690 INFO L226 Difference]: Without dead ends: 124 [2023-11-06 22:10:15,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-11-06 22:10:15,694 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 9 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:15,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1082 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:10:15,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-06 22:10:15,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-11-06 22:10:15,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 121 states have internal predecessors, (126), 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) [2023-11-06 22:10:15,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2023-11-06 22:10:15,725 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 45 [2023-11-06 22:10:15,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:15,726 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2023-11-06 22:10:15,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:10:15,726 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2023-11-06 22:10:15,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-06 22:10:15,734 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:15,735 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:15,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:15,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:15,936 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-06 22:10:15,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:15,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1460474806, now seen corresponding path program 2 times [2023-11-06 22:10:15,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:15,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085123966] [2023-11-06 22:10:15,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:10:15,937 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 [2023-11-06 22:10:15,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:15,938 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 22:10:15,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:16,158 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:10:16,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:10:16,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:10:16,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:16,265 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:10:16,265 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2023-11-06 22:10:16,367 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 22:10:16,368 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:16,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:16,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085123966] [2023-11-06 22:10:16,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085123966] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:16,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:16,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:10:16,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507991424] [2023-11-06 22:10:16,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:16,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:10:16,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:16,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:10:16,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:10:16,370 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2023-11-06 22:10:17,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:17,317 INFO L93 Difference]: Finished difference Result 165 states and 171 transitions. [2023-11-06 22:10:17,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:10:17,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 53 [2023-11-06 22:10:17,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:17,319 INFO L225 Difference]: With dead ends: 165 [2023-11-06 22:10:17,319 INFO L226 Difference]: Without dead ends: 165 [2023-11-06 22:10:17,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:10:17,320 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 120 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:17,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 272 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:10:17,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-11-06 22:10:17,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 143. [2023-11-06 22:10:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 140 states have internal predecessors, (158), 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) [2023-11-06 22:10:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 160 transitions. [2023-11-06 22:10:17,328 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 160 transitions. Word has length 53 [2023-11-06 22:10:17,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:17,329 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 160 transitions. [2023-11-06 22:10:17,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2023-11-06 22:10:17,329 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 160 transitions. [2023-11-06 22:10:17,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-06 22:10:17,331 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:17,331 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:17,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:17,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:17,532 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-06 22:10:17,532 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:17,532 INFO L85 PathProgramCache]: Analyzing trace with hash 986207533, now seen corresponding path program 1 times [2023-11-06 22:10:17,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:17,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955639335] [2023-11-06 22:10:17,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:17,534 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 [2023-11-06 22:10:17,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:17,535 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 22:10:17,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:18,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-06 22:10:18,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:18,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:10:18,101 INFO L351 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 16 treesize of output 10 [2023-11-06 22:10:18,129 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 22:10:18,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:10:18,561 INFO L351 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 19 treesize of output 14 [2023-11-06 22:10:18,575 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 22:10:18,575 INFO L351 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 [2023-11-06 22:10:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 22:10:18,699 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:18,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:18,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955639335] [2023-11-06 22:10:18,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1955639335] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:18,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:18,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:10:18,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77387273] [2023-11-06 22:10:18,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:18,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:10:18,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:18,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:10:18,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:10:18,701 INFO L87 Difference]: Start difference. First operand 143 states and 160 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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) [2023-11-06 22:10:20,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:20,584 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2023-11-06 22:10:20,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:10:20,585 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 56 [2023-11-06 22:10:20,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:20,586 INFO L225 Difference]: With dead ends: 162 [2023-11-06 22:10:20,586 INFO L226 Difference]: Without dead ends: 162 [2023-11-06 22:10:20,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:10:20,588 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 273 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:20,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 211 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-06 22:10:20,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-06 22:10:20,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 137. [2023-11-06 22:10:20,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 134 states have internal predecessors, (146), 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) [2023-11-06 22:10:20,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2023-11-06 22:10:20,594 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 56 [2023-11-06 22:10:20,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:20,595 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2023-11-06 22:10:20,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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) [2023-11-06 22:10:20,595 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2023-11-06 22:10:20,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 22:10:20,596 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:20,597 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:20,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:20,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:20,820 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-06 22:10:20,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:20,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1762674172, now seen corresponding path program 1 times [2023-11-06 22:10:20,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:20,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134126153] [2023-11-06 22:10:20,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:20,821 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 [2023-11-06 22:10:20,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:20,822 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 22:10:20,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:21,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-06 22:10:21,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:21,359 INFO L351 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 16 treesize of output 10 [2023-11-06 22:10:21,388 INFO L351 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 11 treesize of output 7 [2023-11-06 22:10:21,402 INFO L351 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 11 treesize of output 10 [2023-11-06 22:10:21,428 INFO L351 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 [2023-11-06 22:10:21,799 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:10:21,799 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 22:10:21,860 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 22:10:21,860 INFO L351 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 [2023-11-06 22:10:22,239 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 22:10:22,239 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:22,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:22,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134126153] [2023-11-06 22:10:22,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134126153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:22,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:22,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:10:22,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9428811] [2023-11-06 22:10:22,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:22,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:10:22,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:22,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:10:22,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:10:22,242 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) [2023-11-06 22:10:25,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:25,284 INFO L93 Difference]: Finished difference Result 156 states and 162 transitions. [2023-11-06 22:10:25,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:10:25,285 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 59 [2023-11-06 22:10:25,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:25,286 INFO L225 Difference]: With dead ends: 156 [2023-11-06 22:10:25,287 INFO L226 Difference]: Without dead ends: 156 [2023-11-06 22:10:25,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:10:25,288 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 185 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:25,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 303 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-06 22:10:25,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-06 22:10:25,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 142. [2023-11-06 22:10:25,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 115 states have (on average 1.3217391304347825) internal successors, (152), 139 states have internal predecessors, (152), 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) [2023-11-06 22:10:25,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 154 transitions. [2023-11-06 22:10:25,292 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 154 transitions. Word has length 59 [2023-11-06 22:10:25,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:25,292 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 154 transitions. [2023-11-06 22:10:25,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) [2023-11-06 22:10:25,292 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 154 transitions. [2023-11-06 22:10:25,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-06 22:10:25,293 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:25,294 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:25,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:25,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:25,513 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-06 22:10:25,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:25,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1556108045, now seen corresponding path program 1 times [2023-11-06 22:10:25,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:25,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562346098] [2023-11-06 22:10:25,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:25,514 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 [2023-11-06 22:10:25,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:25,515 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 22:10:25,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:26,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:10:26,013 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:26,057 INFO L351 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 [2023-11-06 22:10:26,103 INFO L351 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 21 treesize of output 1 [2023-11-06 22:10:26,295 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:10:26,295 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2023-11-06 22:10:26,419 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:10:26,419 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 14 [2023-11-06 22:10:26,449 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 22:10:26,449 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:26,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:26,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1562346098] [2023-11-06 22:10:26,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1562346098] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:26,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:26,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:10:26,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149967349] [2023-11-06 22:10:26,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:26,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:10:26,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:26,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:10:26,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:10:26,452 INFO L87 Difference]: Start difference. First operand 142 states and 154 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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) [2023-11-06 22:10:27,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:27,762 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2023-11-06 22:10:27,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:10:27,763 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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 62 [2023-11-06 22:10:27,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:27,764 INFO L225 Difference]: With dead ends: 140 [2023-11-06 22:10:27,765 INFO L226 Difference]: Without dead ends: 140 [2023-11-06 22:10:27,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:10:27,766 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 76 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:27,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 248 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 22:10:27,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-06 22:10:27,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2023-11-06 22:10:27,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 115 states have (on average 1.2956521739130435) internal successors, (149), 137 states have internal predecessors, (149), 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) [2023-11-06 22:10:27,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions. [2023-11-06 22:10:27,773 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 62 [2023-11-06 22:10:27,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:27,773 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 151 transitions. [2023-11-06 22:10:27,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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) [2023-11-06 22:10:27,774 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2023-11-06 22:10:27,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-06 22:10:27,775 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:27,775 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:27,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:27,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:27,988 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-06 22:10:27,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:27,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1556108044, now seen corresponding path program 1 times [2023-11-06 22:10:27,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:27,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477737621] [2023-11-06 22:10:27,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:27,990 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 [2023-11-06 22:10:27,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:27,991 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 22:10:28,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:28,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 22:10:28,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:28,458 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 22:10:28,487 INFO L351 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 [2023-11-06 22:10:28,538 INFO L351 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 25 treesize of output 1 [2023-11-06 22:10:28,561 INFO L351 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 16 treesize of output 12 [2023-11-06 22:10:28,692 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2023-11-06 22:10:28,715 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-11-06 22:10:28,797 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 9 [2023-11-06 22:10:28,831 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 22:10:28,831 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:28,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:28,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477737621] [2023-11-06 22:10:28,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477737621] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:28,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:28,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:10:28,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218702030] [2023-11-06 22:10:28,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:28,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:10:28,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:28,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:10:28,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:10:28,833 INFO L87 Difference]: Start difference. First operand 140 states and 151 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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) [2023-11-06 22:10:29,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:29,652 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2023-11-06 22:10:29,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:10:29,653 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 62 [2023-11-06 22:10:29,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:29,655 INFO L225 Difference]: With dead ends: 139 [2023-11-06 22:10:29,655 INFO L226 Difference]: Without dead ends: 139 [2023-11-06 22:10:29,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:10:29,656 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 75 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:29,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 209 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:10:29,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-11-06 22:10:29,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2023-11-06 22:10:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 115 states have (on average 1.2782608695652173) internal successors, (147), 136 states have internal predecessors, (147), 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) [2023-11-06 22:10:29,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 149 transitions. [2023-11-06 22:10:29,663 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 149 transitions. Word has length 62 [2023-11-06 22:10:29,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:29,664 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 149 transitions. [2023-11-06 22:10:29,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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) [2023-11-06 22:10:29,664 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 149 transitions. [2023-11-06 22:10:29,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-06 22:10:29,665 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:29,666 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2023-11-06 22:10:29,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:29,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:29,876 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-06 22:10:29,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:29,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1378626871, now seen corresponding path program 1 times [2023-11-06 22:10:29,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:29,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865040760] [2023-11-06 22:10:29,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:29,879 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 [2023-11-06 22:10:29,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:29,880 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 22:10:29,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:30,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-06 22:10:30,563 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:30,576 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 22:10:30,671 INFO L322 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-06 22:10:30,671 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-06 22:10:30,773 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-06 22:10:30,921 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2023-11-06 22:10:31,184 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 22:10:31,185 INFO L351 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 56 treesize of output 55 [2023-11-06 22:10:31,273 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2023-11-06 22:10:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 22:10:31,416 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:31,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:31,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865040760] [2023-11-06 22:10:31,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865040760] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:31,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:31,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:10:31,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363333174] [2023-11-06 22:10:31,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:31,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:10:31,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:31,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:10:31,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:10:31,419 INFO L87 Difference]: Start difference. First operand 139 states and 149 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 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) [2023-11-06 22:10:33,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:33,569 INFO L93 Difference]: Finished difference Result 165 states and 176 transitions. [2023-11-06 22:10:33,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:10:33,570 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 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 67 [2023-11-06 22:10:33,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:33,571 INFO L225 Difference]: With dead ends: 165 [2023-11-06 22:10:33,572 INFO L226 Difference]: Without dead ends: 165 [2023-11-06 22:10:33,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:10:33,573 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 93 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:33,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 245 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-06 22:10:33,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-11-06 22:10:33,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 150. [2023-11-06 22:10:33,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 126 states have (on average 1.3015873015873016) internal successors, (164), 147 states have internal predecessors, (164), 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) [2023-11-06 22:10:33,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 166 transitions. [2023-11-06 22:10:33,581 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 166 transitions. Word has length 67 [2023-11-06 22:10:33,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:33,582 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 166 transitions. [2023-11-06 22:10:33,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 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) [2023-11-06 22:10:33,582 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 166 transitions. [2023-11-06 22:10:33,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-06 22:10:33,584 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:33,584 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2023-11-06 22:10:33,608 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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)] Ended with exit code 0 [2023-11-06 22:10:33,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:33,800 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-06 22:10:33,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:33,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1378626870, now seen corresponding path program 1 times [2023-11-06 22:10:33,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:33,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240916897] [2023-11-06 22:10:33,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:33,802 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 [2023-11-06 22:10:33,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:33,804 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 22:10:33,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:34,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-06 22:10:34,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:34,441 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 22:10:34,520 INFO L351 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 [2023-11-06 22:10:34,544 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 22:10:34,544 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-06 22:10:34,600 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-06 22:10:34,616 INFO L351 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 16 treesize of output 12 [2023-11-06 22:10:34,770 INFO L351 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 36 treesize of output 29 [2023-11-06 22:10:34,777 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-11-06 22:10:35,014 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 22:10:35,014 INFO L351 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 80 treesize of output 75 [2023-11-06 22:10:35,038 INFO L351 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 39 treesize of output 16 [2023-11-06 22:10:35,222 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2023-11-06 22:10:35,236 INFO L351 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 12 treesize of output 3 [2023-11-06 22:10:35,297 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 22:10:35,297 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:35,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:35,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240916897] [2023-11-06 22:10:35,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240916897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:35,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:35,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:10:35,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198959699] [2023-11-06 22:10:35,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:35,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:10:35,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:35,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:10:35,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:10:35,299 INFO L87 Difference]: Start difference. First operand 150 states and 166 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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) [2023-11-06 22:10:36,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:36,654 INFO L93 Difference]: Finished difference Result 162 states and 170 transitions. [2023-11-06 22:10:36,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:10:36,654 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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 67 [2023-11-06 22:10:36,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:36,656 INFO L225 Difference]: With dead ends: 162 [2023-11-06 22:10:36,656 INFO L226 Difference]: Without dead ends: 162 [2023-11-06 22:10:36,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:10:36,657 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 168 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:36,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 201 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:10:36,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-06 22:10:36,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 150. [2023-11-06 22:10:36,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 126 states have (on average 1.2698412698412698) internal successors, (160), 147 states have internal predecessors, (160), 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) [2023-11-06 22:10:36,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2023-11-06 22:10:36,663 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 67 [2023-11-06 22:10:36,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:36,663 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2023-11-06 22:10:36,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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) [2023-11-06 22:10:36,664 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2023-11-06 22:10:36,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-06 22:10:36,664 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:36,665 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:36,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:36,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:36,880 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-06 22:10:36,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:36,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1931110669, now seen corresponding path program 1 times [2023-11-06 22:10:36,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:36,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907967100] [2023-11-06 22:10:36,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:36,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:36,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:36,882 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 22:10:36,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:37,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 22:10:37,519 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:37,524 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 22:10:37,586 INFO L322 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-06 22:10:37,587 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-06 22:10:37,672 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-06 22:10:37,799 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2023-11-06 22:10:37,990 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 22:10:37,991 INFO L351 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 56 treesize of output 55 [2023-11-06 22:10:38,222 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 22:10:38,222 INFO L351 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 56 treesize of output 55 [2023-11-06 22:10:38,339 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2023-11-06 22:10:38,485 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2023-11-06 22:10:38,485 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:10:38,646 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_966 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_966) |c_ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|)))))) is different from false [2023-11-06 22:10:38,692 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_966 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_966) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-06 22:10:38,736 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_966 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_965 (Array (_ BitVec 64) (_ BitVec 64)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_965))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_966)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-06 22:10:38,761 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_966 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_965 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_965))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_966)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-06 22:10:38,809 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_966 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_965 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_964 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_964))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_965)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_966)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-06 22:10:38,870 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:10:38,870 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 78 [2023-11-06 22:10:38,876 INFO L351 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 3087 treesize of output 2376 [2023-11-06 22:10:38,915 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 234 [2023-11-06 22:10:38,921 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 178 [2023-11-06 22:10:38,931 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 67 [2023-11-06 22:10:42,270 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:10:42,270 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 82 treesize of output 278 [2023-11-06 22:10:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 4 not checked. [2023-11-06 22:10:44,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:44,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907967100] [2023-11-06 22:10:44,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1907967100] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:10:44,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:10:44,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2023-11-06 22:10:44,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888877193] [2023-11-06 22:10:44,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:10:44,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 22:10:44,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:44,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 22:10:44,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=143, Unknown=5, NotChecked=140, Total=342 [2023-11-06 22:10:44,997 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 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) [2023-11-06 22:10:46,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:46,991 INFO L93 Difference]: Finished difference Result 158 states and 166 transitions. [2023-11-06 22:10:46,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:10:46,993 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2023-11-06 22:10:46,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:46,994 INFO L225 Difference]: With dead ends: 158 [2023-11-06 22:10:46,994 INFO L226 Difference]: Without dead ends: 158 [2023-11-06 22:10:46,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 128 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=84, Invalid=203, Unknown=5, NotChecked=170, Total=462 [2023-11-06 22:10:46,996 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 206 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 449 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:46,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 310 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 215 Invalid, 0 Unknown, 449 Unchecked, 1.3s Time] [2023-11-06 22:10:46,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-11-06 22:10:47,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 149. [2023-11-06 22:10:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 126 states have (on average 1.253968253968254) internal successors, (158), 146 states have internal predecessors, (158), 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) [2023-11-06 22:10:47,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2023-11-06 22:10:47,002 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 73 [2023-11-06 22:10:47,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:47,002 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2023-11-06 22:10:47,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 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) [2023-11-06 22:10:47,002 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2023-11-06 22:10:47,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-06 22:10:47,003 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:47,003 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:47,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:47,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:47,204 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-06 22:10:47,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:47,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1931110670, now seen corresponding path program 1 times [2023-11-06 22:10:47,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:47,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170035230] [2023-11-06 22:10:47,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:47,206 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 [2023-11-06 22:10:47,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:47,207 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 22:10:47,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:10:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:48,279 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-06 22:10:48,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:48,291 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 22:10:48,339 INFO L351 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 [2023-11-06 22:10:48,376 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 22:10:48,376 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-06 22:10:48,448 INFO L351 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 16 treesize of output 12 [2023-11-06 22:10:48,487 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-06 22:10:48,652 INFO L351 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 36 treesize of output 29 [2023-11-06 22:10:48,681 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-11-06 22:10:48,895 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 22:10:48,896 INFO L351 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 80 treesize of output 75 [2023-11-06 22:10:48,914 INFO L351 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 39 treesize of output 16 [2023-11-06 22:10:49,265 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 22:10:49,266 INFO L351 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 80 treesize of output 75 [2023-11-06 22:10:49,302 INFO L351 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 39 treesize of output 16 [2023-11-06 22:10:49,515 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2023-11-06 22:10:49,521 INFO L351 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 12 treesize of output 3 [2023-11-06 22:10:49,583 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 22:10:49,583 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:10:50,867 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1082 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1082 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1083 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1083) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2023-11-06 22:10:51,090 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1082 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1082) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1082 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1083 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1082) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1083) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2023-11-06 22:10:51,259 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1082 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1082) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1082 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1083 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1082) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1083) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2023-11-06 22:10:51,378 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (_ bv1 32))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1080 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1082 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1081 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1081) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1080) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1082) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1080 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1082 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1081 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1083 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1080))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1081) .cse3 v_ArrVal_1082) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1083) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) is different from false [2023-11-06 22:10:52,445 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1080 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1082 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1081 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1081) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1080) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1082) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1080 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1082 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1081 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1083 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1080))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1081) .cse4 v_ArrVal_1082) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1083) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))) is different from false [2023-11-06 22:10:52,911 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1080 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1082 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1081 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1079 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1078 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1079))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1078) .cse2 v_ArrVal_1081) (select (select (store .cse3 .cse2 v_ArrVal_1080) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1082))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1080 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1082 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1081 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1079 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1078 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1083 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1079))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_1080))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1078) .cse5 v_ArrVal_1081) .cse6 v_ArrVal_1082) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_1083) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) is different from false [2023-11-06 22:10:53,134 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:10:53,135 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 216 [2023-11-06 22:10:53,177 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:10:53,177 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 138 [2023-11-06 22:10:53,194 INFO L351 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 1481 treesize of output 1238 [2023-11-06 22:10:53,216 INFO L351 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 2072 treesize of output 1919 [2023-11-06 22:10:53,272 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 987 treesize of output 875 [2023-11-06 22:10:53,284 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 875 treesize of output 819 [2023-11-06 22:10:53,304 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 819 treesize of output 651 [2023-11-06 22:10:53,316 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 651 treesize of output 595 [2023-11-06 22:10:53,326 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 595 treesize of output 511 [2023-11-06 22:10:53,947 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:10:53,948 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 228 [2023-11-06 22:10:53,998 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:10:53,999 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 137 [2023-11-06 22:10:54,013 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:10:54,028 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 617 treesize of output 392 [2023-11-06 22:10:54,042 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:10:54,043 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:10:54,052 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2023-11-06 22:10:54,773 INFO L322 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-06 22:10:54,773 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2023-11-06 22:10:54,782 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 4 not checked. [2023-11-06 22:10:54,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:54,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170035230] [2023-11-06 22:10:54,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170035230] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:10:54,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:10:54,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2023-11-06 22:10:54,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372992028] [2023-11-06 22:10:54,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:10:54,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-06 22:10:54,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:54,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-06 22:10:54,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=228, Unknown=6, NotChecked=210, Total=506 [2023-11-06 22:10:54,787 INFO L87 Difference]: Start difference. First operand 149 states and 160 transitions. Second operand has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 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) [2023-11-06 22:11:03,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:03,204 INFO L93 Difference]: Finished difference Result 174 states and 181 transitions. [2023-11-06 22:11:03,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:11:03,206 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2023-11-06 22:11:03,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:03,207 INFO L225 Difference]: With dead ends: 174 [2023-11-06 22:11:03,208 INFO L226 Difference]: Without dead ends: 174 [2023-11-06 22:11:03,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=163, Invalid=557, Unknown=6, NotChecked=330, Total=1056 [2023-11-06 22:11:03,209 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 123 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 619 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:03,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 596 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 506 Invalid, 0 Unknown, 619 Unchecked, 5.4s Time] [2023-11-06 22:11:03,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-11-06 22:11:03,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 161. [2023-11-06 22:11:03,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 138 states have (on average 1.2391304347826086) internal successors, (171), 158 states have internal predecessors, (171), 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) [2023-11-06 22:11:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2023-11-06 22:11:03,216 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 73 [2023-11-06 22:11:03,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:03,217 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2023-11-06 22:11:03,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 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) [2023-11-06 22:11:03,217 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2023-11-06 22:11:03,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-06 22:11:03,218 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:03,218 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:03,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:11:03,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:11:03,419 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-11-06 22:11:03,419 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:03,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1614791598, now seen corresponding path program 2 times [2023-11-06 22:11:03,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:11:03,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682358953] [2023-11-06 22:11:03,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:11:03,420 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 [2023-11-06 22:11:03,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:11:03,421 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 22:11:03,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abb82966-e90d-45a0-85fd-8b819afdfaab/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:11:04,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:11:04,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:11:04,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-06 22:11:04,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:11:04,330 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 22:11:04,409 INFO L351 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 [2023-11-06 22:11:04,444 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 22:11:04,444 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-06 22:11:04,552 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-06 22:11:04,579 INFO L351 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 16 treesize of output 12 [2023-11-06 22:11:04,826 INFO L351 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 36 treesize of output 29 [2023-11-06 22:11:04,833 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-11-06 22:11:05,182 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 22:11:05,183 INFO L351 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 80 treesize of output 75 [2023-11-06 22:11:05,201 INFO L351 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 39 treesize of output 16 [2023-11-06 22:11:05,650 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 22:11:05,650 INFO L351 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 80 treesize of output 75 [2023-11-06 22:11:05,685 INFO L351 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 39 treesize of output 16 [2023-11-06 22:11:06,125 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 22:11:06,126 INFO L351 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 80 treesize of output 75 [2023-11-06 22:11:06,159 INFO L351 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 39 treesize of output 16 [2023-11-06 22:11:06,413 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2023-11-06 22:11:06,420 INFO L351 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 12 treesize of output 3 [2023-11-06 22:11:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-06 22:11:06,501 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:11:08,086 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1208 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1208) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1208 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1207 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1208) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1207) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2023-11-06 22:11:08,263 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1208 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1208) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1208 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1207 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1208) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) (_ bv1 64) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1207) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2023-11-06 22:11:08,435 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1208 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1208) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1208 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1207 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1208) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1207) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2023-11-06 22:11:08,675 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1206 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1205 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1208 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1205) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1206) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1208) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1206 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1205 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1208 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1207 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1206))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1205) .cse3 v_ArrVal_1208) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1207) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) is different from false [2023-11-06 22:11:09,633 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1206 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1205 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1208 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1205) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1206) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1208) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1206 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1205 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1208 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1207 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1206))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1205) .cse4 v_ArrVal_1208) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1207) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))) is different from false [2023-11-06 22:11:09,805 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (_ bv2 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1206 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1205 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1208 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1205) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1206) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1208) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1206 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1205 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1208 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1207 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1206))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1205) .cse4 v_ArrVal_1208) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) (_ bv1 64) .cse1) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1207) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))) is different from false [2023-11-06 22:11:11,938 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (_ bv2 32))) (.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1206 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1205 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1208 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1207 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1204 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1203 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1204))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1206))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (_ bv1 64) .cse0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1203) .cse1 v_ArrVal_1205) .cse2 v_ArrVal_1208) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1207) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1206 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1205 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1208 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1204 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1203 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1204))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1203) .cse7 v_ArrVal_1205) (select (select (store .cse8 .cse7 v_ArrVal_1206) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1208))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse6) (bvadd (_ bv1 64) .cse0 .cse6)))))) is different from false [2023-11-06 22:11:16,967 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (_ bv2 32))) (.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1206 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1205 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1208 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1202 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1201 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1204 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1203 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1202))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_1204))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1201) .cse2 v_ArrVal_1203) .cse3 v_ArrVal_1205) (select (select (store .cse4 .cse3 v_ArrVal_1206) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1208))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1206 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1205 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1208 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1207 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1202 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1201 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1204 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1203 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1202))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_1204))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_1206))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd (_ bv1 64) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1201) .cse7 v_ArrVal_1203) .cse8 v_ArrVal_1205) .cse9 v_ArrVal_1208) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) .cse1) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_1207) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))))))))))) is different from false [2023-11-06 22:11:17,224 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:11:17,224 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 451 treesize of output 452 [2023-11-06 22:11:17,254 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:11:17,255 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 438 treesize of output 257 [2023-11-06 22:11:17,334 INFO L351 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 33225583 treesize of output 28900138 [2023-11-06 22:11:35,980 WARN L293 SmtUtils]: Spent 18.64s on a formula simplification. DAG size of input: 2050 DAG size of output: 354 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 22:11:36,542 INFO L351 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 2804525 treesize of output 2759804 [2023-11-06 22:11:43,122 WARN L293 SmtUtils]: Spent 6.58s on a formula simplification. DAG size of input: 1225 DAG size of output: 334 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 22:11:43,676 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117180 treesize of output 108724 [2023-11-06 22:11:44,248 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108724 treesize of output 104216 [2023-11-06 22:11:44,864 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104216 treesize of output 87836 [2023-11-06 22:11:45,479 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87836 treesize of output 83328 [2023-11-06 22:11:46,198 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83328 treesize of output 68964 [2023-11-06 22:11:46,768 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68964 treesize of output 64456 [2023-11-06 22:11:47,440 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64456 treesize of output 56084 [2023-11-06 22:11:47,989 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56084 treesize of output 53508