./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/busybox-1.22.0/basename-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/basename-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 65aca230ed2b7a8b5f7f2ccd484c93b0425fe4f5fb1895001f199a0c2754f5f4 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:53:51,882 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:53:51,955 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2023-11-06 21:53:51,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:53:51,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:53:51,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:53:51,991 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:53:51,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:53:51,992 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:53:51,993 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:53:51,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:53:51,994 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:53:51,995 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:53:51,996 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:53:51,996 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:53:51,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:53:51,997 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 21:53:51,998 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 21:53:51,999 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 21:53:51,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:53:52,000 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:53:52,001 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:53:52,001 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:53:52,002 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:53:52,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:53:52,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:53:52,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:53:52,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:53:52,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:53:52,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:53:52,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:53:52,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:53:52,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:53:52,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:53:52,008 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:53:52,009 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_301d9ea7-9554-4b7d-b4da-82281c454ac4/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_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 -> 65aca230ed2b7a8b5f7f2ccd484c93b0425fe4f5fb1895001f199a0c2754f5f4 [2023-11-06 21:53:52,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:53:52,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:53:52,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:53:52,303 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:53:52,304 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:53:52,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/busybox-1.22.0/basename-1.i [2023-11-06 21:53:55,451 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:53:55,768 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:53:55,769 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/sv-benchmarks/c/busybox-1.22.0/basename-1.i [2023-11-06 21:53:55,802 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/data/8eeca6863/1227f97b8eaa48aebbf12206c003dd12/FLAG4b0d78008 [2023-11-06 21:53:55,815 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/data/8eeca6863/1227f97b8eaa48aebbf12206c003dd12 [2023-11-06 21:53:55,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:53:55,820 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:53:55,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:55,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:53:55,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:53:55,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:55" (1/1) ... [2023-11-06 21:53:55,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3acec011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:55, skipping insertion in model container [2023-11-06 21:53:55,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:55" (1/1) ... [2023-11-06 21:53:55,903 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:53:56,688 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:56,707 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 21:53:56,708 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@57207d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:56, skipping insertion in model container [2023-11-06 21:53:56,708 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:56,708 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-06 21:53:56,711 INFO L158 Benchmark]: Toolchain (without parser) took 889.61ms. Allocated memory is still 161.5MB. Free memory was 113.3MB in the beginning and 92.4MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-06 21:53:56,711 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 125.8MB. Free memory is still 72.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:53:56,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 887.17ms. Allocated memory is still 161.5MB. Free memory was 112.7MB in the beginning and 92.4MB in the end (delta: 20.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 21:53:56,714 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.30ms. Allocated memory is still 125.8MB. Free memory is still 72.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 887.17ms. Allocated memory is still 161.5MB. Free memory was 112.7MB in the beginning and 92.4MB in the end (delta: 20.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1515]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/basename-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 65aca230ed2b7a8b5f7f2ccd484c93b0425fe4f5fb1895001f199a0c2754f5f4 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:53:59,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:53:59,281 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2023-11-06 21:53:59,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:53:59,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:53:59,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:53:59,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:53:59,345 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:53:59,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:53:59,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:53:59,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:53:59,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:53:59,353 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:53:59,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:53:59,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:53:59,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:53:59,356 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 21:53:59,357 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 21:53:59,357 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 21:53:59,358 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:53:59,359 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:53:59,359 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 21:53:59,359 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 21:53:59,360 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:53:59,360 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:53:59,361 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:53:59,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:53:59,362 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:53:59,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:53:59,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:53:59,364 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:53:59,365 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 21:53:59,365 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 21:53:59,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:53:59,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:53:59,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:53:59,366 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 21:53:59,366 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:53:59,367 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_301d9ea7-9554-4b7d-b4da-82281c454ac4/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_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 -> 65aca230ed2b7a8b5f7f2ccd484c93b0425fe4f5fb1895001f199a0c2754f5f4 [2023-11-06 21:53:59,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:53:59,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:53:59,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:53:59,850 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:53:59,851 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:53:59,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/busybox-1.22.0/basename-1.i [2023-11-06 21:54:03,125 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:54:03,513 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:54:03,518 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/sv-benchmarks/c/busybox-1.22.0/basename-1.i [2023-11-06 21:54:03,552 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/data/0be6658aa/f08b691fff874b6fa38035d8fb5ec3ae/FLAG8a314d9d8 [2023-11-06 21:54:03,565 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/data/0be6658aa/f08b691fff874b6fa38035d8fb5ec3ae [2023-11-06 21:54:03,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:54:03,569 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:54:03,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:54:03,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:54:03,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:54:03,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:54:03" (1/1) ... [2023-11-06 21:54:03,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e0374cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:03, skipping insertion in model container [2023-11-06 21:54:03,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:54:03" (1/1) ... [2023-11-06 21:54:03,649 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:54:04,754 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:54:04,779 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-06 21:54:04,799 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:54:04,935 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:54:04,946 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:54:05,066 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:54:05,201 WARN L672 CHandler]: The function strrchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:54:05,209 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:54:05,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:05 WrapperNode [2023-11-06 21:54:05,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:54:05,211 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:54:05,211 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:54:05,211 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:54:05,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:05" (1/1) ... [2023-11-06 21:54:05,278 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:05" (1/1) ... [2023-11-06 21:54:05,344 INFO L138 Inliner]: procedures = 352, calls = 113, calls flagged for inlining = 12, calls inlined = 11, statements flattened = 382 [2023-11-06 21:54:05,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:54:05,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:54:05,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:54:05,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:54:05,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:05" (1/1) ... [2023-11-06 21:54:05,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:05" (1/1) ... [2023-11-06 21:54:05,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:05" (1/1) ... [2023-11-06 21:54:05,378 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:05" (1/1) ... [2023-11-06 21:54:05,427 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:05" (1/1) ... [2023-11-06 21:54:05,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:05" (1/1) ... [2023-11-06 21:54:05,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:05" (1/1) ... [2023-11-06 21:54:05,464 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:05" (1/1) ... [2023-11-06 21:54:05,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:54:05,481 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:54:05,481 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:54:05,481 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:54:05,485 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:05" (1/1) ... [2023-11-06 21:54:05,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:54:05,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:54:05,523 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:54:05,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:54:05,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 21:54:05,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 21:54:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:54:05,563 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:54:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 21:54:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 21:54:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:54:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 21:54:05,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 21:54:05,564 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2023-11-06 21:54:05,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:54:05,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 21:54:05,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:54:05,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:54:06,001 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:54:06,003 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:54:07,517 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:54:07,530 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:54:07,530 INFO L302 CfgBuilder]: Removed 9 assume(true) statements. [2023-11-06 21:54:07,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:54:07 BoogieIcfgContainer [2023-11-06 21:54:07,537 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:54:07,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:54:07,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:54:07,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:54:07,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:54:03" (1/3) ... [2023-11-06 21:54:07,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e8b9fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:54:07, skipping insertion in model container [2023-11-06 21:54:07,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:05" (2/3) ... [2023-11-06 21:54:07,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e8b9fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:54:07, skipping insertion in model container [2023-11-06 21:54:07,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:54:07" (3/3) ... [2023-11-06 21:54:07,551 INFO L112 eAbstractionObserver]: Analyzing ICFG basename-1.i [2023-11-06 21:54:07,571 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:54:07,571 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2023-11-06 21:54:07,643 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:54:07,652 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;@61954124, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:54:07,653 INFO L358 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2023-11-06 21:54:07,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 149 states have (on average 1.8993288590604027) internal successors, (283), 241 states have internal predecessors, (283), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:54:07,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-06 21:54:07,666 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:07,667 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-06 21:54:07,668 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:54:07,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:07,677 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-11-06 21:54:07,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:07,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1933147444] [2023-11-06 21:54:07,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:07,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:54:07,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:07,699 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:07,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:07,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 21:54:07,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:07,983 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 21:54:07,996 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 21:54:07,996 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:07,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:07,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1933147444] [2023-11-06 21:54:07,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1933147444] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:07,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:07,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:54:08,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164259961] [2023-11-06 21:54:08,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:08,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:54:08,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:08,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:54:08,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:54:08,038 INFO L87 Difference]: Start difference. First operand has 245 states, 149 states have (on average 1.8993288590604027) internal successors, (283), 241 states have internal predecessors, (283), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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 21:54:08,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:08,606 INFO L93 Difference]: Finished difference Result 255 states and 286 transitions. [2023-11-06 21:54:08,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:54:08,608 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 21:54:08,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:08,619 INFO L225 Difference]: With dead ends: 255 [2023-11-06 21:54:08,620 INFO L226 Difference]: Without dead ends: 253 [2023-11-06 21:54:08,621 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 21:54:08,625 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 239 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:08,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 208 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 21:54:08,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-11-06 21:54:08,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 236. [2023-11-06 21:54:08,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 145 states have (on average 1.806896551724138) internal successors, (262), 232 states have internal predecessors, (262), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:54:08,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 266 transitions. [2023-11-06 21:54:08,684 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 266 transitions. Word has length 3 [2023-11-06 21:54:08,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:08,685 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 266 transitions. [2023-11-06 21:54:08,685 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 21:54:08,686 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 266 transitions. [2023-11-06 21:54:08,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-06 21:54:08,686 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:08,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-06 21:54:08,707 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:08,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:08,901 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:54:08,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:08,902 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-11-06 21:54:08,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:08,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659496918] [2023-11-06 21:54:08,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:08,904 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 21:54:08,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:08,905 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:08,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:09,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 21:54:09,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:09,077 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 21:54:09,092 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 21:54:09,092 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:09,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:09,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659496918] [2023-11-06 21:54:09,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659496918] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:09,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:09,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:54:09,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956905520] [2023-11-06 21:54:09,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:09,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:54:09,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:09,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:54:09,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:54:09,096 INFO L87 Difference]: Start difference. First operand 236 states and 266 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 21:54:10,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:10,074 INFO L93 Difference]: Finished difference Result 235 states and 265 transitions. [2023-11-06 21:54:10,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:54:10,075 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 21:54:10,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:10,077 INFO L225 Difference]: With dead ends: 235 [2023-11-06 21:54:10,077 INFO L226 Difference]: Without dead ends: 235 [2023-11-06 21:54:10,078 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 21:54:10,079 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 9 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:10,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 432 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 21:54:10,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-11-06 21:54:10,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2023-11-06 21:54:10,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 145 states have (on average 1.8) internal successors, (261), 231 states have internal predecessors, (261), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:54:10,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 265 transitions. [2023-11-06 21:54:10,096 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 265 transitions. Word has length 3 [2023-11-06 21:54:10,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:10,096 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 265 transitions. [2023-11-06 21:54:10,097 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 21:54:10,097 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 265 transitions. [2023-11-06 21:54:10,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 21:54:10,097 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:10,098 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 21:54:10,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:10,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:10,311 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:54:10,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:10,312 INFO L85 PathProgramCache]: Analyzing trace with hash 889446313, now seen corresponding path program 1 times [2023-11-06 21:54:10,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:10,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603160622] [2023-11-06 21:54:10,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:10,314 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 21:54:10,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:10,315 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:10,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:10,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 21:54:10,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:10,519 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 21:54:10,613 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 21:54:10,614 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:10,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:10,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603160622] [2023-11-06 21:54:10,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603160622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:10,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:10,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:54:10,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003446127] [2023-11-06 21:54:10,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:10,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:54:10,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:10,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:54:10,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:54:10,626 INFO L87 Difference]: Start difference. First operand 235 states and 265 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 21:54:11,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:11,688 INFO L93 Difference]: Finished difference Result 239 states and 269 transitions. [2023-11-06 21:54:11,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:54:11,690 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 21:54:11,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:11,693 INFO L225 Difference]: With dead ends: 239 [2023-11-06 21:54:11,693 INFO L226 Difference]: Without dead ends: 239 [2023-11-06 21:54:11,693 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 21:54:11,695 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 12 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:11,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 431 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 21:54:11,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-11-06 21:54:11,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2023-11-06 21:54:11,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 147 states have (on average 1.7891156462585034) internal successors, (263), 233 states have internal predecessors, (263), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:54:11,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 267 transitions. [2023-11-06 21:54:11,709 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 267 transitions. Word has length 6 [2023-11-06 21:54:11,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:11,709 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 267 transitions. [2023-11-06 21:54:11,710 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 21:54:11,710 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 267 transitions. [2023-11-06 21:54:11,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 21:54:11,711 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:11,711 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:11,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:11,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:11,925 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:54:11,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:11,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1261842348, now seen corresponding path program 1 times [2023-11-06 21:54:11,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:11,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192052537] [2023-11-06 21:54:11,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:11,927 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 21:54:11,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:11,929 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:11,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:12,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 21:54:12,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:12,127 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 21:54:12,279 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 21:54:12,280 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:54:13,156 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 21:54:13,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:13,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192052537] [2023-11-06 21:54:13,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192052537] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:54:13,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:54:13,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-11-06 21:54:13,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102567125] [2023-11-06 21:54:13,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:54:13,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:54:13,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:13,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:54:13,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:54:13,160 INFO L87 Difference]: Start difference. First operand 237 states and 267 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 21:54:18,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:18,002 INFO L93 Difference]: Finished difference Result 243 states and 273 transitions. [2023-11-06 21:54:18,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:54:18,004 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 21:54:18,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:18,006 INFO L225 Difference]: With dead ends: 243 [2023-11-06 21:54:18,006 INFO L226 Difference]: Without dead ends: 243 [2023-11-06 21:54:18,007 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 21:54:18,008 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 15 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:18,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 948 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-11-06 21:54:18,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-11-06 21:54:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2023-11-06 21:54:18,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 154 states have (on average 1.7467532467532467) internal successors, (269), 239 states have internal predecessors, (269), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:54:18,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 273 transitions. [2023-11-06 21:54:18,021 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 273 transitions. Word has length 10 [2023-11-06 21:54:18,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:18,021 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 273 transitions. [2023-11-06 21:54:18,021 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 21:54:18,022 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 273 transitions. [2023-11-06 21:54:18,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 21:54:18,023 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:18,023 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 21:54:18,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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)] Forceful destruction successful, exit code 0 [2023-11-06 21:54:18,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:18,237 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:54:18,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:18,238 INFO L85 PathProgramCache]: Analyzing trace with hash 924293661, now seen corresponding path program 1 times [2023-11-06 21:54:18,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:18,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585015986] [2023-11-06 21:54:18,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:18,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:54:18,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:18,241 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:18,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:18,456 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 21:54:18,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:18,528 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 21:54:18,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:54:18,650 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 21:54:18,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:18,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585015986] [2023-11-06 21:54:18,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585015986] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:54:18,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:54:18,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-06 21:54:18,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754527276] [2023-11-06 21:54:18,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:54:18,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 21:54:18,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:18,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 21:54:18,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:54:18,653 INFO L87 Difference]: Start difference. First operand 243 states and 273 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 21:54:18,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:18,969 INFO L93 Difference]: Finished difference Result 263 states and 293 transitions. [2023-11-06 21:54:18,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:54:18,970 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 21:54:18,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:18,972 INFO L225 Difference]: With dead ends: 263 [2023-11-06 21:54:18,972 INFO L226 Difference]: Without dead ends: 263 [2023-11-06 21:54:18,973 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 21:54:18,974 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 15 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:18,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1303 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:54:18,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2023-11-06 21:54:18,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2023-11-06 21:54:18,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 174 states have (on average 1.660919540229885) internal successors, (289), 259 states have internal predecessors, (289), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:54:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 293 transitions. [2023-11-06 21:54:18,987 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 293 transitions. Word has length 25 [2023-11-06 21:54:18,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:18,988 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 293 transitions. [2023-11-06 21:54:18,988 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 21:54:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 293 transitions. [2023-11-06 21:54:18,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-06 21:54:18,990 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:18,990 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 21:54:19,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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)] Forceful destruction successful, exit code 0 [2023-11-06 21:54:19,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:19,208 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:54:19,208 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:19,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1712175278, now seen corresponding path program 2 times [2023-11-06 21:54:19,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:19,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119711792] [2023-11-06 21:54:19,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 21:54:19,210 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 21:54:19,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:19,211 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:19,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:19,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 21:54:19,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:54:19,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 21:54:19,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:19,450 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 21:54:19,451 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 21:54:19,523 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 21:54:19,524 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:19,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:19,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119711792] [2023-11-06 21:54:19,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119711792] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:19,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:19,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:54:19,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962737943] [2023-11-06 21:54:19,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:19,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:54:19,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:19,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:54:19,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:54:19,526 INFO L87 Difference]: Start difference. First operand 263 states and 293 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 21:54:20,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:20,355 INFO L93 Difference]: Finished difference Result 275 states and 306 transitions. [2023-11-06 21:54:20,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:54:20,356 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 21:54:20,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:20,358 INFO L225 Difference]: With dead ends: 275 [2023-11-06 21:54:20,358 INFO L226 Difference]: Without dead ends: 275 [2023-11-06 21:54:20,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:54:20,359 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 224 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:20,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 211 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 21:54:20,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2023-11-06 21:54:20,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 258. [2023-11-06 21:54:20,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 174 states have (on average 1.632183908045977) internal successors, (284), 254 states have internal predecessors, (284), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:54:20,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 288 transitions. [2023-11-06 21:54:20,368 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 288 transitions. Word has length 45 [2023-11-06 21:54:20,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:20,370 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 288 transitions. [2023-11-06 21:54:20,370 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 21:54:20,370 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 288 transitions. [2023-11-06 21:54:20,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-06 21:54:20,372 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:20,372 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 21:54:20,393 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:20,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:20,587 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:54:20,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:20,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1712175279, now seen corresponding path program 1 times [2023-11-06 21:54:20,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:20,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048431850] [2023-11-06 21:54:20,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:20,588 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 21:54:20,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:20,589 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:20,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 21:54:20,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:21,036 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 21:54:21,036 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:54:21,436 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 21:54:21,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:21,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048431850] [2023-11-06 21:54:21,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048431850] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:54:21,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:54:21,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-11-06 21:54:21,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744620325] [2023-11-06 21:54:21,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:54:21,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-06 21:54:21,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:21,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-06 21:54:21,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-11-06 21:54:21,439 INFO L87 Difference]: Start difference. First operand 258 states and 288 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 21:54:22,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:22,159 INFO L93 Difference]: Finished difference Result 266 states and 296 transitions. [2023-11-06 21:54:22,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 21:54:22,160 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 21:54:22,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:22,162 INFO L225 Difference]: With dead ends: 266 [2023-11-06 21:54:22,162 INFO L226 Difference]: Without dead ends: 266 [2023-11-06 21:54:22,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-11-06 21:54:22,164 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 6 mSDsluCounter, 2840 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3104 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:22,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3104 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 21:54:22,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-11-06 21:54:22,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2023-11-06 21:54:22,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 182 states have (on average 1.6043956043956045) internal successors, (292), 262 states have internal predecessors, (292), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:54:22,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 296 transitions. [2023-11-06 21:54:22,173 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 296 transitions. Word has length 45 [2023-11-06 21:54:22,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:22,173 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 296 transitions. [2023-11-06 21:54:22,174 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 21:54:22,174 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 296 transitions. [2023-11-06 21:54:22,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-06 21:54:22,175 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:22,175 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 21:54:22,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:22,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:22,391 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:54:22,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:22,392 INFO L85 PathProgramCache]: Analyzing trace with hash -461625495, now seen corresponding path program 2 times [2023-11-06 21:54:22,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:22,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206132009] [2023-11-06 21:54:22,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 21:54:22,393 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 21:54:22,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:22,394 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:22,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:22,628 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 21:54:22,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:54:22,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 21:54:22,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:22,720 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 21:54:22,720 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 21:54:22,858 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 21:54:22,858 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:22,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:22,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206132009] [2023-11-06 21:54:22,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206132009] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:22,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:22,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:54:22,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073151172] [2023-11-06 21:54:22,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:22,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:54:22,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:22,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:54:22,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:54:22,861 INFO L87 Difference]: Start difference. First operand 266 states and 296 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 21:54:25,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:25,873 INFO L93 Difference]: Finished difference Result 449 states and 507 transitions. [2023-11-06 21:54:25,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:54:25,875 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 21:54:25,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:25,878 INFO L225 Difference]: With dead ends: 449 [2023-11-06 21:54:25,878 INFO L226 Difference]: Without dead ends: 449 [2023-11-06 21:54:25,878 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 21:54:25,879 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 646 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:25,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 773 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-06 21:54:25,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2023-11-06 21:54:25,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 372. [2023-11-06 21:54:25,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 288 states have (on average 1.6944444444444444) internal successors, (488), 367 states have internal predecessors, (488), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 21:54:25,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 494 transitions. [2023-11-06 21:54:25,893 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 494 transitions. Word has length 53 [2023-11-06 21:54:25,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:25,893 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 494 transitions. [2023-11-06 21:54:25,894 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 21:54:25,894 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 494 transitions. [2023-11-06 21:54:25,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-06 21:54:25,895 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:25,895 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 21:54:25,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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)] Ended with exit code 0 [2023-11-06 21:54:26,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:26,106 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:54:26,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:26,106 INFO L85 PathProgramCache]: Analyzing trace with hash 200130714, now seen corresponding path program 1 times [2023-11-06 21:54:26,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:26,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410677723] [2023-11-06 21:54:26,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:26,107 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 21:54:26,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:26,108 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:26,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:26,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 21:54:26,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:26,681 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 21:54:26,681 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 21:54:27,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:27,216 INFO L322 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-06 21:54:27,217 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 29 treesize of output 31 [2023-11-06 21:54:27,253 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 21:54:27,253 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 21:54:27,441 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 21:54:27,442 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:27,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:27,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410677723] [2023-11-06 21:54:27,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410677723] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:27,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:27,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 21:54:27,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992294986] [2023-11-06 21:54:27,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:27,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 21:54:27,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:27,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 21:54:27,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:54:27,444 INFO L87 Difference]: Start difference. First operand 372 states and 494 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 21:54:33,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:33,802 INFO L93 Difference]: Finished difference Result 304 states and 336 transitions. [2023-11-06 21:54:33,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:54:33,803 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 21:54:33,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:33,814 INFO L225 Difference]: With dead ends: 304 [2023-11-06 21:54:33,815 INFO L226 Difference]: Without dead ends: 304 [2023-11-06 21:54:33,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-11-06 21:54:33,818 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 561 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:33,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 666 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2023-11-06 21:54:33,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2023-11-06 21:54:33,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 279. [2023-11-06 21:54:33,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 197 states have (on average 1.583756345177665) internal successors, (312), 275 states have internal predecessors, (312), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:54:33,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 316 transitions. [2023-11-06 21:54:33,838 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 316 transitions. Word has length 56 [2023-11-06 21:54:33,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:33,839 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 316 transitions. [2023-11-06 21:54:33,840 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 21:54:33,841 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 316 transitions. [2023-11-06 21:54:33,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 21:54:33,843 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:33,843 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 21:54:33,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:34,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:34,046 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:54:34,046 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:34,046 INFO L85 PathProgramCache]: Analyzing trace with hash 679476087, now seen corresponding path program 1 times [2023-11-06 21:54:34,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:34,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372164236] [2023-11-06 21:54:34,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:34,047 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 21:54:34,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:34,051 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:34,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:34,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 21:54:34,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:34,699 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 21:54:34,706 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 21:54:34,738 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 21:54:34,759 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 21:54:35,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:54:35,035 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 21:54:35,048 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 21:54:35,049 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 21:54:35,253 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 21:54:35,254 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:35,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:35,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372164236] [2023-11-06 21:54:35,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372164236] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:35,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:35,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:54:35,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013966452] [2023-11-06 21:54:35,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:35,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:54:35,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:35,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:54:35,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:54:35,256 INFO L87 Difference]: Start difference. First operand 279 states and 316 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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 21:54:41,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:41,237 INFO L93 Difference]: Finished difference Result 298 states and 330 transitions. [2023-11-06 21:54:41,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:54:41,239 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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 21:54:41,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:41,241 INFO L225 Difference]: With dead ends: 298 [2023-11-06 21:54:41,242 INFO L226 Difference]: Without dead ends: 298 [2023-11-06 21:54:41,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:54:41,243 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 516 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:41,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 668 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2023-11-06 21:54:41,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-11-06 21:54:41,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 284. [2023-11-06 21:54:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 203 states have (on average 1.5665024630541873) internal successors, (318), 280 states have internal predecessors, (318), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:54:41,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 322 transitions. [2023-11-06 21:54:41,255 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 322 transitions. Word has length 59 [2023-11-06 21:54:41,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:41,255 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 322 transitions. [2023-11-06 21:54:41,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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 21:54:41,256 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 322 transitions. [2023-11-06 21:54:41,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-06 21:54:41,257 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:41,257 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 21:54:41,278 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:41,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:41,470 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:54:41,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:41,471 INFO L85 PathProgramCache]: Analyzing trace with hash 91230880, now seen corresponding path program 1 times [2023-11-06 21:54:41,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:41,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248768207] [2023-11-06 21:54:41,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:41,472 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 21:54:41,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:41,474 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:41,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:42,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-06 21:54:42,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:42,240 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 21:54:42,291 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 21:54:42,496 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 21:54:42,497 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 21:54:42,647 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 21:54:42,647 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 21:54:42,682 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 21:54:42,682 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:42,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:42,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248768207] [2023-11-06 21:54:42,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248768207] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:42,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:42,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:54:42,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576253543] [2023-11-06 21:54:42,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:42,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:54:42,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:42,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:54:42,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:54:42,685 INFO L87 Difference]: Start difference. First operand 284 states and 322 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 21:54:45,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:45,417 INFO L93 Difference]: Finished difference Result 282 states and 319 transitions. [2023-11-06 21:54:45,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 21:54:45,418 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 21:54:45,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:45,420 INFO L225 Difference]: With dead ends: 282 [2023-11-06 21:54:45,420 INFO L226 Difference]: Without dead ends: 282 [2023-11-06 21:54:45,421 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 21:54:45,421 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 232 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:45,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1045 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-06 21:54:45,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-11-06 21:54:45,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2023-11-06 21:54:45,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 203 states have (on average 1.5517241379310345) internal successors, (315), 278 states have internal predecessors, (315), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:54:45,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 319 transitions. [2023-11-06 21:54:45,432 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 319 transitions. Word has length 62 [2023-11-06 21:54:45,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:45,432 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 319 transitions. [2023-11-06 21:54:45,433 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 21:54:45,433 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 319 transitions. [2023-11-06 21:54:45,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-06 21:54:45,434 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:45,435 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 21:54:45,458 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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)] Ended with exit code 0 [2023-11-06 21:54:45,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:45,654 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:54:45,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:45,655 INFO L85 PathProgramCache]: Analyzing trace with hash 91230881, now seen corresponding path program 1 times [2023-11-06 21:54:45,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:45,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570671295] [2023-11-06 21:54:45,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:45,656 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 21:54:45,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:45,657 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:45,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:46,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 21:54:46,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:46,270 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 21:54:46,293 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 21:54:46,358 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 21:54:46,371 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 21:54:46,506 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 21:54:46,540 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 21:54:46,621 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 21:54:46,653 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 21:54:46,653 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:46,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:46,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1570671295] [2023-11-06 21:54:46,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1570671295] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:46,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:46,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:54:46,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687414743] [2023-11-06 21:54:46,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:46,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:54:46,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:46,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:54:46,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:54:46,656 INFO L87 Difference]: Start difference. First operand 282 states and 319 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 21:54:48,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:48,627 INFO L93 Difference]: Finished difference Result 281 states and 317 transitions. [2023-11-06 21:54:48,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:54:48,629 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 21:54:48,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:48,631 INFO L225 Difference]: With dead ends: 281 [2023-11-06 21:54:48,631 INFO L226 Difference]: Without dead ends: 281 [2023-11-06 21:54:48,632 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 21:54:48,633 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 241 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:48,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 723 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-06 21:54:48,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-11-06 21:54:48,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2023-11-06 21:54:48,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 203 states have (on average 1.541871921182266) internal successors, (313), 277 states have internal predecessors, (313), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:54:48,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 317 transitions. [2023-11-06 21:54:48,643 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 317 transitions. Word has length 62 [2023-11-06 21:54:48,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:48,644 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 317 transitions. [2023-11-06 21:54:48,644 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 21:54:48,644 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 317 transitions. [2023-11-06 21:54:48,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-06 21:54:48,646 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:48,646 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 21:54:48,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:48,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:48,869 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:54:48,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:48,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1437535940, now seen corresponding path program 1 times [2023-11-06 21:54:48,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:48,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128052343] [2023-11-06 21:54:48,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:48,871 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 21:54:48,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:48,872 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:48,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:49,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-06 21:54:49,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:49,545 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 21:54:49,639 INFO L322 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-06 21:54:49,639 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 21:54:49,738 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 21:54:49,926 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 21:54:50,170 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 21:54:50,170 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 21:54:50,244 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 21:54:50,391 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 21:54:50,391 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:50,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:50,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128052343] [2023-11-06 21:54:50,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128052343] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:50,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:50,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 21:54:50,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30079510] [2023-11-06 21:54:50,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:50,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 21:54:50,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:50,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 21:54:50,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:54:50,396 INFO L87 Difference]: Start difference. First operand 281 states and 317 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 21:54:53,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:53,208 INFO L93 Difference]: Finished difference Result 307 states and 344 transitions. [2023-11-06 21:54:53,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:54:53,209 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 21:54:53,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:53,212 INFO L225 Difference]: With dead ends: 307 [2023-11-06 21:54:53,212 INFO L226 Difference]: Without dead ends: 307 [2023-11-06 21:54:53,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-11-06 21:54:53,213 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 493 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:53,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 659 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-06 21:54:53,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2023-11-06 21:54:53,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 292. [2023-11-06 21:54:53,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 214 states have (on average 1.5420560747663552) internal successors, (330), 288 states have internal predecessors, (330), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:54:53,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 334 transitions. [2023-11-06 21:54:53,224 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 334 transitions. Word has length 67 [2023-11-06 21:54:53,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:53,224 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 334 transitions. [2023-11-06 21:54:53,225 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 21:54:53,225 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 334 transitions. [2023-11-06 21:54:53,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-06 21:54:53,226 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:53,226 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 21:54:53,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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)] Forceful destruction successful, exit code 0 [2023-11-06 21:54:53,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:53,446 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:54:53,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:53,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1437535939, now seen corresponding path program 1 times [2023-11-06 21:54:53,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:53,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414343179] [2023-11-06 21:54:53,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:53,448 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 21:54:53,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:53,449 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:53,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:54,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-06 21:54:54,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:54,154 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 21:54:54,224 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 21:54:54,224 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 21:54:54,234 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 6 treesize of output 5 [2023-11-06 21:54:54,286 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 21:54:54,305 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 21:54:54,467 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 21:54:54,474 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 21:54:54,709 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 21:54:54,709 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 21:54:54,730 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 21:54:54,901 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 21:54:54,921 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 21:54:54,978 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 21:54:54,978 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:54:54,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:54:54,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414343179] [2023-11-06 21:54:54,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1414343179] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:54,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:54,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 21:54:54,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413432894] [2023-11-06 21:54:54,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:54,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 21:54:54,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:54:54,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 21:54:54,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:54:54,981 INFO L87 Difference]: Start difference. First operand 292 states and 334 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 21:54:59,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:59,154 INFO L93 Difference]: Finished difference Result 304 states and 338 transitions. [2023-11-06 21:54:59,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 21:54:59,156 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 21:54:59,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:59,158 INFO L225 Difference]: With dead ends: 304 [2023-11-06 21:54:59,158 INFO L226 Difference]: Without dead ends: 304 [2023-11-06 21:54:59,158 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 21:54:59,159 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 481 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:59,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 816 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-11-06 21:54:59,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2023-11-06 21:54:59,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 292. [2023-11-06 21:54:59,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 214 states have (on average 1.5233644859813085) internal successors, (326), 288 states have internal predecessors, (326), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:54:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 330 transitions. [2023-11-06 21:54:59,171 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 330 transitions. Word has length 67 [2023-11-06 21:54:59,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:59,171 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 330 transitions. [2023-11-06 21:54:59,172 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 21:54:59,172 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 330 transitions. [2023-11-06 21:54:59,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-06 21:54:59,173 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:59,174 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 21:54:59,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:59,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:59,390 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:54:59,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:59,390 INFO L85 PathProgramCache]: Analyzing trace with hash 473277760, now seen corresponding path program 1 times [2023-11-06 21:54:59,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:54:59,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194262930] [2023-11-06 21:54:59,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:59,391 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 21:54:59,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:54:59,392 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:54:59,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:55:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:00,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-06 21:55:00,162 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:55:00,170 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 21:55:00,253 INFO L322 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-06 21:55:00,253 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 21:55:00,329 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 21:55:00,511 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 21:55:00,768 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 21:55:00,768 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 21:55:01,061 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 21:55:01,061 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 21:55:01,162 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 21:55:01,310 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 21:55:01,310 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:55:03,717 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_960 (Array (_ BitVec 64) (_ BitVec 64)))) (= (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_960) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-06 21:55:03,792 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_959 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_960 (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| |c_ULTIMATE.start_main_#t~mem122#1.base| v_ArrVal_959))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_960)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-06 21:55:03,831 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_959 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_960 (Array (_ BitVec 64) (_ BitVec 64)))) (= (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_959))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_960)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-06 21:55:03,891 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_959 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_958 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_960 (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_958))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_959)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_960)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-06 21:55:03,969 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:55:03,970 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 21:55:03,979 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 1641 treesize of output 1299 [2023-11-06 21:55:04,015 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 169 treesize of output 127 [2023-11-06 21:55:04,022 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 127 treesize of output 113 [2023-11-06 21:55:04,038 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 66 treesize of output 45 [2023-11-06 21:55:16,564 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:55:16,565 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 135 treesize of output 565 [2023-11-06 21:55:34,769 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 190 trivial. 2 not checked. [2023-11-06 21:55:34,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:55:34,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194262930] [2023-11-06 21:55:34,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194262930] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:55:34,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:55:34,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2023-11-06 21:55:34,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70112] [2023-11-06 21:55:34,770 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:55:34,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 21:55:34,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:55:34,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 21:55:34,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=160, Unknown=11, NotChecked=116, Total=342 [2023-11-06 21:55:34,773 INFO L87 Difference]: Start difference. First operand 292 states and 330 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 21:55:41,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:41,353 INFO L93 Difference]: Finished difference Result 300 states and 334 transitions. [2023-11-06 21:55:41,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 21:55:41,354 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 21:55:41,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:41,357 INFO L225 Difference]: With dead ends: 300 [2023-11-06 21:55:41,357 INFO L226 Difference]: Without dead ends: 300 [2023-11-06 21:55:41,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 127 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=86, Invalid=225, Unknown=11, NotChecked=140, Total=462 [2023-11-06 21:55:41,358 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 248 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 1895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1031 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:41,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1502 Invalid, 1895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 856 Invalid, 0 Unknown, 1031 Unchecked, 5.8s Time] [2023-11-06 21:55:41,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-06 21:55:41,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 291. [2023-11-06 21:55:41,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 214 states have (on average 1.514018691588785) internal successors, (324), 287 states have internal predecessors, (324), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:55:41,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 328 transitions. [2023-11-06 21:55:41,370 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 328 transitions. Word has length 73 [2023-11-06 21:55:41,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:41,370 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 328 transitions. [2023-11-06 21:55:41,371 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 21:55:41,371 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 328 transitions. [2023-11-06 21:55:41,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-06 21:55:41,372 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:41,372 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 21:55:41,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:55:41,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:55:41,597 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:55:41,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:41,597 INFO L85 PathProgramCache]: Analyzing trace with hash 473277761, now seen corresponding path program 1 times [2023-11-06 21:55:41,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:55:41,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724173054] [2023-11-06 21:55:41,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:41,599 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 21:55:41,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:55:41,601 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:55:41,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:55:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:43,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-06 21:55:43,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:55:43,128 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 21:55:43,218 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 21:55:43,219 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 21:55:43,234 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 6 treesize of output 5 [2023-11-06 21:55:43,316 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 21:55:43,341 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 21:55:43,541 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 21:55:43,548 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 21:55:43,851 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 21:55:43,852 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 21:55:43,882 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 21:55:44,333 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 21:55:44,335 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 21:55:44,358 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 21:55:44,624 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 21:55:44,645 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 21:55:44,740 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-11-06 21:55:44,740 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:55:46,328 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_1076 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem124#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1076 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1075 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem124#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) (_ bv1 64) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem124#1.base| v_ArrVal_1075) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2023-11-06 21:55:46,513 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse2 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1076 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1075 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1076) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1075) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_1076 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1076) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd .cse3 .cse2) (bvadd (_ bv1 64) .cse3 .cse2))))))) is different from false [2023-11-06 21:55:46,698 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (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))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1076 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1075 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1076) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1075) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (forall ((v_ArrVal_1076 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1076) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse3) (bvadd .cse0 (_ bv1 64) .cse3))))))) is different from false [2023-11-06 21:55:47,117 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ sign_extend 32) (_ bv1 32))) (.cse1 (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_1076 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1073 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1075 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1074 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem122#1.base| v_ArrVal_1073))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem122#1.base| v_ArrVal_1074) .cse0 v_ArrVal_1076) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse2 (_ bv1 64)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_1075) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1076 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1073 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1074 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem122#1.base| v_ArrVal_1074) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem122#1.base| v_ArrVal_1073) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1076) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd .cse4 .cse2) (bvadd .cse4 .cse2 (_ bv1 64))))))) is different from false [2023-11-06 21:55:47,267 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))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1076 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1073 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1075 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1074 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1073))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1074) .cse2 v_ArrVal_1076) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1075) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))) (forall ((v_ArrVal_1076 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1073 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1074 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1074) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1073) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1076) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse5) (bvadd .cse0 (_ bv1 64) .cse5))))))) is different from false [2023-11-06 21:55:48,209 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (_ bv1 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_1071 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1076 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1073 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1072 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1075 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1074 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1072))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1073))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (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_1071) .cse1 v_ArrVal_1074) .cse2 v_ArrVal_1076) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1075) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1071 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1076 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1073 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1072 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1074 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1072))) (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_~mem_track~0#1.base| v_ArrVal_1071) .cse7 v_ArrVal_1074) (select (select (store .cse8 .cse7 v_ArrVal_1073) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1076))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse6) (bvadd .cse0 (_ bv1 64) .cse6)))))) is different from false [2023-11-06 21:55:48,440 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:55:48,441 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 227 treesize of output 228 [2023-11-06 21:55:48,486 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:55:48,487 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 214 treesize of output 137 [2023-11-06 21:55:48,509 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 11479 treesize of output 9436 [2023-11-06 21:55:48,612 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 4629 treesize of output 4476 [2023-11-06 21:55:48,725 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 384 treesize of output 342 [2023-11-06 21:55:48,737 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 730 treesize of output 674 [2023-11-06 21:55:48,749 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 674 treesize of output 646 [2023-11-06 21:55:48,761 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 646 treesize of output 464 [2023-11-06 21:55:48,772 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 464 treesize of output 380 [2023-11-06 21:55:48,783 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 380 treesize of output 366 [2023-11-06 21:55:52,267 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:55:52,268 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 21:55:52,320 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:55:52,320 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 21:55:52,351 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 771 treesize of output 636 [2023-11-06 21:55:52,396 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 7049 treesize of output 6626 [2023-11-06 21:55:52,428 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 222 treesize of output 194 [2023-11-06 21:55:52,445 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 194 treesize of output 166 [2023-11-06 21:55:52,463 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 166 treesize of output 138 [2023-11-06 21:55:52,614 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 82 treesize of output 68 [2023-11-06 21:55:52,694 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 68 treesize of output 54 [2023-11-06 21:55:53,709 INFO L322 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-06 21:55:53,709 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 21:55:53,717 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 21:55:53,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:55:53,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724173054] [2023-11-06 21:55:53,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724173054] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:55:53,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:55:53,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2023-11-06 21:55:53,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245098063] [2023-11-06 21:55:53,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:55:53,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-06 21:55:53,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:55:53,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-06 21:55:53,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=260, Unknown=6, NotChecked=222, Total=552 [2023-11-06 21:55:53,720 INFO L87 Difference]: Start difference. First operand 291 states and 328 transitions. Second operand has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 24 states have internal predecessors, (61), 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 21:56:12,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:12,310 INFO L93 Difference]: Finished difference Result 316 states and 349 transitions. [2023-11-06 21:56:12,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 21:56:12,314 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 24 states have internal predecessors, (61), 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 21:56:12,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:12,316 INFO L225 Difference]: With dead ends: 316 [2023-11-06 21:56:12,317 INFO L226 Difference]: Without dead ends: 316 [2023-11-06 21:56:12,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=165, Invalid=609, Unknown=6, NotChecked=342, Total=1122 [2023-11-06 21:56:12,319 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 758 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 2808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1645 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:12,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 1288 Invalid, 2808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1148 Invalid, 0 Unknown, 1645 Unchecked, 15.1s Time] [2023-11-06 21:56:12,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2023-11-06 21:56:12,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 303. [2023-11-06 21:56:12,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 226 states have (on average 1.491150442477876) internal successors, (337), 299 states have internal predecessors, (337), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:56:12,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 341 transitions. [2023-11-06 21:56:12,332 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 341 transitions. Word has length 73 [2023-11-06 21:56:12,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:12,333 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 341 transitions. [2023-11-06 21:56:12,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 24 states have internal predecessors, (61), 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 21:56:12,333 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 341 transitions. [2023-11-06 21:56:12,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-06 21:56:12,334 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:12,335 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 21:56:12,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:56:12,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:56:12,558 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:56:12,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:12,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1214006853, now seen corresponding path program 2 times [2023-11-06 21:56:12,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:56:12,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490640322] [2023-11-06 21:56:12,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 21:56:12,559 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:12,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:56:12,560 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:56:12,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:56:13,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 21:56:13,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:56:13,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-06 21:56:13,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:13,661 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 21:56:13,737 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 21:56:13,737 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 21:56:13,750 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 6 treesize of output 5 [2023-11-06 21:56:13,827 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 21:56:13,851 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 21:56:14,042 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 21:56:14,079 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 21:56:14,358 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 21:56:14,359 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 21:56:14,384 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 21:56:14,877 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 21:56:14,877 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 21:56:14,899 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 21:56:15,464 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 21:56:15,465 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 21:56:15,482 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 21:56:15,774 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 21:56:15,788 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 21:56:15,894 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 21:56:15,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:56:17,399 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_1200 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem124#1.base| v_ArrVal_1200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1200 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1199 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem124#1.base| v_ArrVal_1200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) (_ bv1 64) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem124#1.base| v_ArrVal_1199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2023-11-06 21:56:17,658 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_1200 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1200 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1199 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2023-11-06 21:56:17,922 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) (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_1200 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1200 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1199 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2023-11-06 21:56:18,230 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ 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_1198 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1197 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1200 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1199 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem124#1.base| v_ArrVal_1197))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem124#1.base| v_ArrVal_1198) .cse1 v_ArrVal_1200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1198 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1197 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1200 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem124#1.base| v_ArrVal_1198) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem124#1.base| v_ArrVal_1197) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse4) (bvadd .cse0 (_ bv1 64) .cse4)))))) is different from false [2023-11-06 21:56:19,575 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) (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_1198 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1197 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1200 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1198) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1197) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1198 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1197 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1200 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1199 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1197))) (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_1198) .cse4 v_ArrVal_1200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))) is different from false [2023-11-06 21:56:19,793 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) (_ bv2 32))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1198 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1197 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1200 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1199 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1197))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (_ bv1 64) .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1198) .cse2 v_ArrVal_1200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))) (forall ((v_ArrVal_1198 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1197 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1200 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1198) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1197) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse5) (bvadd (_ bv1 64) .cse0 .cse5))))))) is different from false [2023-11-06 21:56:20,799 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ sign_extend 32) (_ bv2 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_1198 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1197 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1200 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1199 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1196 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1195 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem122#1.base| v_ArrVal_1196))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse4 (store .cse5 .cse0 v_ArrVal_1197))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem122#1.base| v_ArrVal_1195) .cse0 v_ArrVal_1198) .cse1 v_ArrVal_1200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) (_ bv1 64) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_1199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1198 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1197 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1200 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1196 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1195 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem122#1.base| v_ArrVal_1196))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem122#1.base| v_ArrVal_1195) .cse7 v_ArrVal_1198) (select (select (store .cse8 .cse7 v_ArrVal_1197) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1200))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse6 .cse3) (bvadd .cse6 (_ bv1 64) .cse3)))))) is different from false [2023-11-06 21:56:21,611 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 ((.cse4 ((_ sign_extend 32) (_ bv2 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1198 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1197 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1200 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1199 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1196 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1195 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1196))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_1197))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1195) .cse1 v_ArrVal_1198) .cse2 v_ArrVal_1200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) (_ bv1 64) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_1199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1198 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1197 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1200 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1196 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1195 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1196))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1195) .cse8 v_ArrVal_1198) (select (select (store .cse9 .cse8 v_ArrVal_1197) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1200))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse7 .cse4) (bvadd .cse7 (_ bv1 64) .cse4))))))) is different from false [2023-11-06 21:56:22,327 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_1198 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1197 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1200 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1194 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1193 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1196 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1195 (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_1193))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_1196))) (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_1194) .cse2 v_ArrVal_1195) .cse3 v_ArrVal_1198) (select (select (store .cse4 .cse3 v_ArrVal_1197) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1200))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1198 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1197 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1200 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1199 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1194 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1193 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1196 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1195 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1193))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_1196))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_1197))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1194) .cse7 v_ArrVal_1195) .cse8 v_ArrVal_1198) .cse9 v_ArrVal_1200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) (_ bv1 64) .cse1) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_1199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))))))))))) is different from false [2023-11-06 21:56:22,587 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:56:22,588 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 452 treesize of output 440 [2023-11-06 21:56:22,629 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:56:22,629 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 426 treesize of output 258 [2023-11-06 21:56:22,649 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 16851 treesize of output 14034 [2023-11-06 21:56:22,720 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 9390 treesize of output 9093 [2023-11-06 21:56:22,742 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 527 treesize of output 457 [2023-11-06 21:56:22,749 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 457 treesize of output 429 [2023-11-06 21:56:22,757 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 429 treesize of output 345 [2023-11-06 21:56:22,771 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 345 treesize of output 317 [2023-11-06 21:56:22,778 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 317 treesize of output 289 [2023-11-06 21:56:22,907 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 168 treesize of output 133 [2023-11-06 21:56:23,083 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 133 treesize of output 119 [2023-11-06 21:56:23,761 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:56:23,761 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 451 treesize of output 452 [2023-11-06 21:56:23,819 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:56:23,820 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 438 treesize of output 257 [2023-11-06 21:56:23,834 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:56:23,876 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 49335 treesize of output 32766 [2023-11-06 21:56:24,027 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:56:24,028 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:56:24,039 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 21:56:25,079 INFO L322 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-06 21:56:25,079 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 21:56:25,087 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 14 not checked. [2023-11-06 21:56:25,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:56:25,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490640322] [2023-11-06 21:56:25,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490640322] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:56:25,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:56:25,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 27 [2023-11-06 21:56:25,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755330166] [2023-11-06 21:56:25,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:56:25,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-06 21:56:25,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:56:25,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-06 21:56:25,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=290, Unknown=9, NotChecked=378, Total=756 [2023-11-06 21:56:25,091 INFO L87 Difference]: Start difference. First operand 303 states and 341 transitions. Second operand has 28 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 28 states have internal predecessors, (68), 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 21:56:47,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:47,519 INFO L93 Difference]: Finished difference Result 329 states and 362 transitions. [2023-11-06 21:56:47,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 21:56:47,522 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 28 states have internal predecessors, (68), 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 79 [2023-11-06 21:56:47,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:47,524 INFO L225 Difference]: With dead ends: 329 [2023-11-06 21:56:47,524 INFO L226 Difference]: Without dead ends: 329 [2023-11-06 21:56:47,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 133 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=206, Invalid=751, Unknown=9, NotChecked=594, Total=1560 [2023-11-06 21:56:47,527 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 753 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 3834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2494 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:47,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 1435 Invalid, 3834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1323 Invalid, 0 Unknown, 2494 Unchecked, 17.0s Time] [2023-11-06 21:56:47,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2023-11-06 21:56:47,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 315. [2023-11-06 21:56:47,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 238 states have (on average 1.4705882352941178) internal successors, (350), 311 states have internal predecessors, (350), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:56:47,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 354 transitions. [2023-11-06 21:56:47,540 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 354 transitions. Word has length 79 [2023-11-06 21:56:47,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:47,541 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 354 transitions. [2023-11-06 21:56:47,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 28 states have internal predecessors, (68), 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 21:56:47,541 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 354 transitions. [2023-11-06 21:56:47,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-06 21:56:47,543 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:47,543 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 4, 4, 4, 3, 3, 3, 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 21:56:47,569 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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)] Ended with exit code 0 [2023-11-06 21:56:47,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:56:47,770 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:56:47,771 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:47,771 INFO L85 PathProgramCache]: Analyzing trace with hash -555805623, now seen corresponding path program 3 times [2023-11-06 21:56:47,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:56:47,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814497488] [2023-11-06 21:56:47,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 21:56:47,773 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 21:56:47,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:56:47,774 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 21:56:47,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_301d9ea7-9554-4b7d-b4da-82281c454ac4/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 (19)] Waiting until timeout for monitored process [2023-11-06 21:56:48,873 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-06 21:56:48,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:56:48,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-06 21:56:48,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:48,908 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 21:56:48,988 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 21:56:48,988 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 21:56:49,001 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 6 treesize of output 5 [2023-11-06 21:56:49,081 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 21:56:49,108 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 21:56:49,313 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 21:56:49,321 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 21:56:49,627 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 21:56:49,628 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 21:56:49,661 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 21:56:50,138 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 21:56:50,139 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 21:56:50,162 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 21:56:50,683 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 21:56:50,684 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 21:56:50,708 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 21:56:51,270 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 21:56:51,270 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 21:56:51,304 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 21:56:51,595 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 21:56:51,610 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 21:56:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 21:56:51,715 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:56:53,330 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_1332 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem124#1.base| v_ArrVal_1332) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1332 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1331 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem124#1.base| v_ArrVal_1332) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) (_ bv1 64) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem124#1.base| v_ArrVal_1331) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2023-11-06 21:56:53,527 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse2 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1332 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1331 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1332) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) (_ bv1 64) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1331) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_1332 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1332) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd .cse3 .cse2) (bvadd .cse3 (_ bv1 64) .cse2))))))) is different from false [2023-11-06 21:56:53,749 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_1332 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1332) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1332 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1331 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1332) |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_1331) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2023-11-06 21:56:54,029 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ 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_1329 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1330 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1332 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1331 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem124#1.base| v_ArrVal_1330))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem124#1.base| v_ArrVal_1329) .cse1 v_ArrVal_1332) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1331) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1329 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1330 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1332 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem124#1.base| v_ArrVal_1329) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem124#1.base| v_ArrVal_1330) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1332) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse4) (bvadd .cse0 (_ bv1 64) .cse4)))))) is different from false [2023-11-06 21:56:55,944 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) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1329 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1330 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1332 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1331 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1330))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1329) .cse2 v_ArrVal_1332) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1331) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))) (forall ((v_ArrVal_1329 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1330 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1332 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1329) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1330) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1332) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse5) (bvadd .cse0 (_ bv1 64) .cse5))))))) is different from false [2023-11-06 21:56:56,172 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 ((_ sign_extend 32) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1329 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1330 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1332 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1331 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1330))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1329) .cse1 v_ArrVal_1332) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_1331) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1329 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1330 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1332 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1329) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1330) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1332) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse5 .cse3) (bvadd (_ bv1 64) .cse5 .cse3))))))) is different from false [2023-11-06 21:56:57,086 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~j~0#1|))) (.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_1327 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1329 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1328 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1330 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1332 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem124#1.base| v_ArrVal_1327))) (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_#t~mem124#1.base| v_ArrVal_1328) .cse2 v_ArrVal_1329) (select (select (store .cse3 .cse2 v_ArrVal_1330) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1332))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1327 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1329 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1328 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1330 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1332 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1331 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem124#1.base| v_ArrVal_1327))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_1330))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (_ bv1 64) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem124#1.base| v_ArrVal_1328) .cse5 v_ArrVal_1329) .cse6 v_ArrVal_1332) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) .cse1) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_1331) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) is different from false [2023-11-06 21:56:59,510 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (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 (_ bv3 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (and (forall ((v_ArrVal_1327 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1329 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1328 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1330 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1332 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1327))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1328) .cse3 v_ArrVal_1329) (select (select (store .cse4 .cse3 v_ArrVal_1330) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1332))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1327 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1329 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1328 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1330 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1332 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1331 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1327))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1330))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1328) .cse6 v_ArrVal_1329) .cse7 v_ArrVal_1332) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) (_ bv1 64) .cse1) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1331) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))))))))))) is different from false [2023-11-06 21:57:00,078 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 ((.cse4 ((_ sign_extend 32) (_ bv3 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1327 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1329 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1328 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1330 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1332 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1331 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1327))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_1330))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1328) .cse1 v_ArrVal_1329) .cse2 v_ArrVal_1332) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse4 (_ bv1 64)) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_1331) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1327 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1329 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1328 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1330 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1332 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1327))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1328) .cse8 v_ArrVal_1329) (select (select (store .cse9 .cse8 v_ArrVal_1330) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1332))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse7 .cse4) (bvadd .cse7 .cse4 (_ bv1 64)))))))) is different from false [2023-11-06 21:57:02,341 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ sign_extend 32) (_ bv3 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_1327 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1326 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1329 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1328 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1325 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1330 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1332 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1331 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem122#1.base| v_ArrVal_1325))) (let ((.cse0 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse0 v_ArrVal_1327))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_1330))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem122#1.base| v_ArrVal_1326) .cse0 v_ArrVal_1328) .cse1 v_ArrVal_1329) .cse2 v_ArrVal_1332) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse4 (_ bv1 64)) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_1331) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1327 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1326 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1329 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1328 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1325 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1330 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1332 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem122#1.base| v_ArrVal_1325))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_1327))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem122#1.base| v_ArrVal_1326) .cse9 v_ArrVal_1328) .cse10 v_ArrVal_1329) (select (select (store .cse11 .cse10 v_ArrVal_1330) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1332))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse8 .cse4) (bvadd .cse8 .cse4 (_ bv1 64))))))) is different from false [2023-11-06 21:57:04,949 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (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) (_ bv3 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (and (forall ((v_ArrVal_1327 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1326 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1329 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1328 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1325 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1330 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1332 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1325))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_1327))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1326) .cse3 v_ArrVal_1328) .cse4 v_ArrVal_1329) (select (select (store .cse5 .cse4 v_ArrVal_1330) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_1332))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1327 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1326 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1329 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1328 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1325 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1330 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1332 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1331 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1325))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_1327))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_1330))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1326) .cse8 v_ArrVal_1328) .cse9 v_ArrVal_1329) .cse10 v_ArrVal_1332) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6)) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_1331) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))))))))))))) is different from false [2023-11-06 21:57:08,151 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ sign_extend 32) (_ bv3 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_1327 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1326 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1329 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1328 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1323 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1325 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1324 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1330 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1332 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1331 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1324))) (let ((.cse0 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse8 (store .cse9 .cse0 v_ArrVal_1325))) (let ((.cse1 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse1 v_ArrVal_1327))) (let ((.cse2 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse2 v_ArrVal_1330))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1323) .cse0 v_ArrVal_1326) .cse1 v_ArrVal_1328) .cse2 v_ArrVal_1329) .cse3 v_ArrVal_1332) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) .cse5 (_ bv1 64)) (select |c_#length| (select (select (store .cse6 .cse3 v_ArrVal_1331) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))))) (forall ((v_ArrVal_1327 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1326 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1329 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1328 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1323 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1325 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1324 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1330 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1332 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse10 (select (select (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1324))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_1325))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_1327))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1323) .cse11 v_ArrVal_1326) .cse12 v_ArrVal_1328) .cse13 v_ArrVal_1329) (select (select (store .cse14 .cse13 v_ArrVal_1330) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1332))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse10 .cse5) (bvadd .cse10 .cse5 (_ bv1 64))))))) is different from false [2023-11-06 21:57:08,643 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:57:08,644 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 900 treesize of output 888 [2023-11-06 21:57:08,724 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:57:08,724 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 874 treesize of output 498 [2023-11-06 21:57:08,820 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 2007087 treesize of output 1746096 [2023-11-06 21:57:10,380 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 6905835 treesize of output 6799680 [2023-11-06 21:57:11,178 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 5692 treesize of output 5006 [2023-11-06 21:57:11,233 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 5006 treesize of output 4908 [2023-11-06 21:57:11,295 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 4908 treesize of output 4026 [2023-11-06 21:57:11,349 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 4026 treesize of output 3830 [2023-11-06 21:57:11,402 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 3830 treesize of output 3256 [2023-11-06 21:57:11,456 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 3256 treesize of output 3060 [2023-11-06 21:57:11,509 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 3060 treesize of output 2808 [2023-11-06 21:57:11,561 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 2808 treesize of output 2612 [2023-11-06 21:57:11,614 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 2612 treesize of output 2528 [2023-11-06 21:57:25,825 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:57:25,826 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 899 treesize of output 900 [2023-11-06 21:57:25,913 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:57:25,914 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 886 treesize of output 497 [2023-11-06 21:57:25,935 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:57:26,067 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 13612785 treesize of output 10680630 [2023-11-06 21:57:30,512 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:57:30,513 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:57:30,531 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 21:57:32,306 INFO L322 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-06 21:57:32,307 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 21:57:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 30 not checked. [2023-11-06 21:57:32,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:57:32,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814497488] [2023-11-06 21:57:32,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [814497488] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:57:32,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:57:32,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 32 [2023-11-06 21:57:32,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93515802] [2023-11-06 21:57:32,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:57:32,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-06 21:57:32,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:57:32,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-06 21:57:32,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=360, Unknown=12, NotChecked=588, Total=1056 [2023-11-06 21:57:32,319 INFO L87 Difference]: Start difference. First operand 315 states and 354 transitions. Second operand has 33 states, 32 states have (on average 2.5) internal successors, (80), 33 states have internal predecessors, (80), 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)