./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d619c50f205026415119876db06c9bf079f51316bee7c051af8e3a06a37e393d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:12:48,301 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:12:48,366 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 03:12:48,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:12:48,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:12:48,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:12:48,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:12:48,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:12:48,398 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:12:48,398 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:12:48,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:12:48,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:12:48,400 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:12:48,401 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:12:48,401 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:12:48,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:12:48,402 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:12:48,403 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:12:48,403 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:12:48,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:12:48,404 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 03:12:48,405 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 03:12:48,405 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 03:12:48,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:12:48,406 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:12:48,406 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 03:12:48,407 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:12:48,407 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:12:48,408 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:12:48,408 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:12:48,409 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:12:48,409 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:12:48,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:12:48,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:12:48,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:12:48,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:12:48,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:12:48,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:12:48,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:12:48,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:12:48,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:12:48,412 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_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/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_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d619c50f205026415119876db06c9bf079f51316bee7c051af8e3a06a37e393d [2023-11-29 03:12:48,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:12:48,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:12:48,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:12:48,684 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:12:48,684 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:12:48,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i [2023-11-29 03:12:51,503 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:12:51,791 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:12:51,792 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i [2023-11-29 03:12:51,812 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/data/c7c54ffc4/341877b9f6a64ee79b93aca31fc5e4a6/FLAG7a6dedff6 [2023-11-29 03:12:51,827 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/data/c7c54ffc4/341877b9f6a64ee79b93aca31fc5e4a6 [2023-11-29 03:12:51,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:12:51,832 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:12:51,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:12:51,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:12:51,840 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:12:51,841 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:12:51" (1/1) ... [2023-11-29 03:12:51,842 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fd1c83f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:12:51, skipping insertion in model container [2023-11-29 03:12:51,842 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:12:51" (1/1) ... [2023-11-29 03:12:51,906 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:12:52,428 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:12:52,441 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-29 03:12:52,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@312f10d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:12:52, skipping insertion in model container [2023-11-29 03:12:52,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:12:52,443 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 03:12:52,444 INFO L158 Benchmark]: Toolchain (without parser) took 611.82ms. Allocated memory is still 163.6MB. Free memory was 113.1MB in the beginning and 92.8MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 03:12:52,445 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 163.6MB. Free memory was 137.0MB in the beginning and 136.7MB in the end (delta: 286.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:12:52,446 INFO L158 Benchmark]: CACSL2BoogieTranslator took 609.01ms. Allocated memory is still 163.6MB. Free memory was 113.1MB in the beginning and 92.8MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 03:12:52,448 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.21ms. Allocated memory is still 163.6MB. Free memory was 137.0MB in the beginning and 136.7MB in the end (delta: 286.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 609.01ms. Allocated memory is still 163.6MB. Free memory was 113.1MB in the beginning and 92.8MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 815]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d619c50f205026415119876db06c9bf079f51316bee7c051af8e3a06a37e393d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:12:54,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:12:54,327 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 03:12:54,333 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:12:54,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:12:54,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:12:54,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:12:54,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:12:54,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:12:54,374 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:12:54,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:12:54,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:12:54,376 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:12:54,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:12:54,377 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:12:54,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:12:54,378 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:12:54,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:12:54,379 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:12:54,380 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:12:54,381 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 03:12:54,381 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 03:12:54,381 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 03:12:54,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:12:54,382 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:12:54,383 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 03:12:54,383 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 03:12:54,384 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 03:12:54,384 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:12:54,384 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:12:54,385 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:12:54,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:12:54,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:12:54,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:12:54,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:12:54,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:12:54,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:12:54,387 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 03:12:54,387 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 03:12:54,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:12:54,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:12:54,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:12:54,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:12:54,388 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 03:12:54,389 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_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/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_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d619c50f205026415119876db06c9bf079f51316bee7c051af8e3a06a37e393d [2023-11-29 03:12:54,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:12:54,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:12:54,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:12:54,694 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:12:54,695 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:12:54,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i [2023-11-29 03:12:57,498 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:12:57,784 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:12:57,785 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i [2023-11-29 03:12:57,815 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/data/9be2166ef/c26ea5c44f0f48ce8b786cd4bc850218/FLAGf58cbadcf [2023-11-29 03:12:57,831 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/data/9be2166ef/c26ea5c44f0f48ce8b786cd4bc850218 [2023-11-29 03:12:57,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:12:57,835 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:12:57,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:12:57,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:12:57,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:12:57,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:12:57" (1/1) ... [2023-11-29 03:12:57,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38287d6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:12:57, skipping insertion in model container [2023-11-29 03:12:57,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:12:57" (1/1) ... [2023-11-29 03:12:57,926 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:12:58,483 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:12:58,499 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 03:12:58,516 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:12:58,619 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:12:58,624 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:12:58,694 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:12:58,738 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:12:58,746 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:12:58,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:12:58 WrapperNode [2023-11-29 03:12:58,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:12:58,748 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:12:58,748 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:12:58,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:12:58,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:12:58" (1/1) ... [2023-11-29 03:12:58,789 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:12:58" (1/1) ... [2023-11-29 03:12:58,840 INFO L138 Inliner]: procedures = 211, calls = 288, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1060 [2023-11-29 03:12:58,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:12:58,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:12:58,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:12:58,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:12:58,854 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:12:58" (1/1) ... [2023-11-29 03:12:58,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:12:58" (1/1) ... [2023-11-29 03:12:58,873 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:12:58" (1/1) ... [2023-11-29 03:12:58,958 INFO L175 MemorySlicer]: Split 261 memory accesses to 4 slices as follows [2, 5, 34, 220]. 84 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 55 writes are split as follows [0, 1, 4, 50]. [2023-11-29 03:12:58,958 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:12:58" (1/1) ... [2023-11-29 03:12:58,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:12:58" (1/1) ... [2023-11-29 03:12:59,010 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:12:58" (1/1) ... [2023-11-29 03:12:59,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:12:58" (1/1) ... [2023-11-29 03:12:59,028 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:12:58" (1/1) ... [2023-11-29 03:12:59,036 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:12:58" (1/1) ... [2023-11-29 03:12:59,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:12:59,050 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:12:59,050 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:12:59,050 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:12:59,051 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:12:58" (1/1) ... [2023-11-29 03:12:59,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:12:59,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:12:59,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:12:59,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:12:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 03:12:59,131 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 03:12:59,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 03:12:59,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 03:12:59,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 03:12:59,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 03:12:59,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 03:12:59,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 03:12:59,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 03:12:59,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 03:12:59,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 03:12:59,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 03:12:59,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 03:12:59,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 03:12:59,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 03:12:59,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 03:12:59,134 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 03:12:59,134 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 03:12:59,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 03:12:59,134 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 03:12:59,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 03:12:59,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 03:12:59,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 03:12:59,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 03:12:59,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:12:59,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 03:12:59,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 03:12:59,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 03:12:59,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 03:12:59,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 03:12:59,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 03:12:59,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 03:12:59,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 03:12:59,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 03:12:59,136 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 03:12:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 03:12:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:12:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 03:12:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 03:12:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 03:12:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 03:12:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:12:59,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:12:59,359 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:12:59,362 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:12:59,395 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 03:12:59,429 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 03:12:59,450 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 03:12:59,473 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 03:13:03,924 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:13:04,067 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:13:04,067 INFO L309 CfgBuilder]: Removed 63 assume(true) statements. [2023-11-29 03:13:04,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:13:04 BoogieIcfgContainer [2023-11-29 03:13:04,068 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:13:04,071 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:13:04,071 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:13:04,074 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:13:04,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:12:57" (1/3) ... [2023-11-29 03:13:04,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c6ceb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:13:04, skipping insertion in model container [2023-11-29 03:13:04,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:12:58" (2/3) ... [2023-11-29 03:13:04,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c6ceb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:13:04, skipping insertion in model container [2023-11-29 03:13:04,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:13:04" (3/3) ... [2023-11-29 03:13:04,077 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test2-2.i [2023-11-29 03:13:04,091 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:13:04,092 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 535 error locations. [2023-11-29 03:13:04,152 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:13:04,158 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;@1e95e77d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:13:04,158 INFO L358 AbstractCegarLoop]: Starting to check reachability of 535 error locations. [2023-11-29 03:13:04,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 984 states, 438 states have (on average 2.5136986301369864) internal successors, (1101), 977 states have internal predecessors, (1101), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-29 03:13:04,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 03:13:04,172 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:13:04,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 03:13:04,173 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:13:04,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:13:04,178 INFO L85 PathProgramCache]: Analyzing trace with hash 56252, now seen corresponding path program 1 times [2023-11-29 03:13:04,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:13:04,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655122764] [2023-11-29 03:13:04,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:13:04,189 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-29 03:13:04,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:13:04,208 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:04,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:04,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:13:04,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:13:04,437 INFO L378 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-29 03:13:04,451 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-29 03:13:04,451 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:13:04,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:13:04,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655122764] [2023-11-29 03:13:04,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655122764] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:13:04,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:13:04,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:13:04,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114014231] [2023-11-29 03:13:04,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:13:04,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:13:04,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:13:04,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:13:04,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:13:04,514 INFO L87 Difference]: Start difference. First operand has 984 states, 438 states have (on average 2.5136986301369864) internal successors, (1101), 977 states have internal predecessors, (1101), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-29 03:13:06,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:13:06,784 INFO L93 Difference]: Finished difference Result 1136 states and 1212 transitions. [2023-11-29 03:13:06,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:13:06,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-29 03:13:06,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:13:06,808 INFO L225 Difference]: With dead ends: 1136 [2023-11-29 03:13:06,808 INFO L226 Difference]: Without dead ends: 1135 [2023-11-29 03:13:06,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-29 03:13:06,813 INFO L413 NwaCegarLoop]: 546 mSDtfsCounter, 906 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:13:06,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 674 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-29 03:13:06,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2023-11-29 03:13:06,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 970. [2023-11-29 03:13:06,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 441 states have (on average 2.312925170068027) internal successors, (1020), 963 states have internal predecessors, (1020), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 03:13:06,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1038 transitions. [2023-11-29 03:13:06,895 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1038 transitions. Word has length 2 [2023-11-29 03:13:06,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:13:06,895 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 1038 transitions. [2023-11-29 03:13:06,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-29 03:13:06,895 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1038 transitions. [2023-11-29 03:13:06,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 03:13:06,896 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:13:06,896 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 03:13:06,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:07,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:07,098 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:13:07,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:13:07,099 INFO L85 PathProgramCache]: Analyzing trace with hash 56253, now seen corresponding path program 1 times [2023-11-29 03:13:07,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:13:07,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768487687] [2023-11-29 03:13:07,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:13:07,100 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-29 03:13:07,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:13:07,101 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:07,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:07,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:13:07,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:13:07,211 INFO L378 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-29 03:13:07,222 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-29 03:13:07,223 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:13:07,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:13:07,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768487687] [2023-11-29 03:13:07,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768487687] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:13:07,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:13:07,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:13:07,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160195448] [2023-11-29 03:13:07,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:13:07,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:13:07,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:13:07,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:13:07,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:13:07,226 INFO L87 Difference]: Start difference. First operand 970 states and 1038 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-29 03:13:10,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:13:10,559 INFO L93 Difference]: Finished difference Result 1351 states and 1462 transitions. [2023-11-29 03:13:10,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:13:10,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-29 03:13:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:13:10,567 INFO L225 Difference]: With dead ends: 1351 [2023-11-29 03:13:10,567 INFO L226 Difference]: Without dead ends: 1351 [2023-11-29 03:13:10,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-29 03:13:10,568 INFO L413 NwaCegarLoop]: 775 mSDtfsCounter, 413 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:13:10,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1274 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-11-29 03:13:10,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2023-11-29 03:13:10,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1082. [2023-11-29 03:13:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 549 states have (on average 2.255009107468124) internal successors, (1238), 1075 states have internal predecessors, (1238), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 03:13:10,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1266 transitions. [2023-11-29 03:13:10,594 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1266 transitions. Word has length 2 [2023-11-29 03:13:10,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:13:10,594 INFO L495 AbstractCegarLoop]: Abstraction has 1082 states and 1266 transitions. [2023-11-29 03:13:10,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-29 03:13:10,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1266 transitions. [2023-11-29 03:13:10,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 03:13:10,595 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:13:10,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 03:13:10,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 03:13:10,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:10,797 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:13:10,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:13:10,797 INFO L85 PathProgramCache]: Analyzing trace with hash 411041670, now seen corresponding path program 1 times [2023-11-29 03:13:10,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:13:10,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324251903] [2023-11-29 03:13:10,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:13:10,798 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-29 03:13:10,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:13:10,799 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:10,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:10,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 03:13:10,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:13:10,951 INFO L378 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-29 03:13:10,960 INFO L378 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-29 03:13:11,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:13:11,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 03:13:11,065 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:13:11,066 INFO L378 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-29 03:13:11,089 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-29 03:13:11,089 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:13:11,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:13:11,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324251903] [2023-11-29 03:13:11,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324251903] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:13:11,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:13:11,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:13:11,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988509879] [2023-11-29 03:13:11,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:13:11,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:13:11,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:13:11,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:13:11,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:13:11,093 INFO L87 Difference]: Start difference. First operand 1082 states and 1266 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-29 03:13:14,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:13:14,459 INFO L93 Difference]: Finished difference Result 1236 states and 1428 transitions. [2023-11-29 03:13:14,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:13:14,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-29 03:13:14,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:13:14,467 INFO L225 Difference]: With dead ends: 1236 [2023-11-29 03:13:14,467 INFO L226 Difference]: Without dead ends: 1236 [2023-11-29 03:13:14,467 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-29 03:13:14,469 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 2045 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2053 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:13:14,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2053 Valid, 344 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-11-29 03:13:14,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2023-11-29 03:13:14,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 959. [2023-11-29 03:13:14,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 441 states have (on average 2.2857142857142856) internal successors, (1008), 952 states have internal predecessors, (1008), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 03:13:14,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1026 transitions. [2023-11-29 03:13:14,499 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1026 transitions. Word has length 6 [2023-11-29 03:13:14,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:13:14,500 INFO L495 AbstractCegarLoop]: Abstraction has 959 states and 1026 transitions. [2023-11-29 03:13:14,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-29 03:13:14,500 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1026 transitions. [2023-11-29 03:13:14,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 03:13:14,501 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:13:14,501 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:13:14,504 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 03:13:14,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:14,703 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:13:14,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:13:14,703 INFO L85 PathProgramCache]: Analyzing trace with hash -142610108, now seen corresponding path program 1 times [2023-11-29 03:13:14,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:13:14,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225339882] [2023-11-29 03:13:14,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:13:14,704 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-29 03:13:14,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:13:14,705 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:14,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:14,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:13:14,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:13:14,842 INFO L378 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-29 03:13:14,852 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-29 03:13:14,852 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:13:14,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:13:14,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225339882] [2023-11-29 03:13:14,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225339882] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:13:14,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:13:14,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:13:14,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301764360] [2023-11-29 03:13:14,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:13:14,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:13:14,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:13:14,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:13:14,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:13:14,854 INFO L87 Difference]: Start difference. First operand 959 states and 1026 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:13:16,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:13:16,910 INFO L93 Difference]: Finished difference Result 1112 states and 1211 transitions. [2023-11-29 03:13:16,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:13:16,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 03:13:16,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:13:16,918 INFO L225 Difference]: With dead ends: 1112 [2023-11-29 03:13:16,918 INFO L226 Difference]: Without dead ends: 1112 [2023-11-29 03:13:16,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-29 03:13:16,920 INFO L413 NwaCegarLoop]: 743 mSDtfsCounter, 732 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:13:16,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 984 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 03:13:16,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2023-11-29 03:13:16,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 912. [2023-11-29 03:13:16,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 441 states have (on average 2.179138321995465) internal successors, (961), 905 states have internal predecessors, (961), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 03:13:16,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 979 transitions. [2023-11-29 03:13:16,952 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 979 transitions. Word has length 7 [2023-11-29 03:13:16,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:13:16,952 INFO L495 AbstractCegarLoop]: Abstraction has 912 states and 979 transitions. [2023-11-29 03:13:16,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:13:16,953 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 979 transitions. [2023-11-29 03:13:16,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 03:13:16,953 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:13:16,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:13:16,956 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 03:13:17,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:17,165 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:13:17,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:13:17,166 INFO L85 PathProgramCache]: Analyzing trace with hash -142610107, now seen corresponding path program 1 times [2023-11-29 03:13:17,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:13:17,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664309118] [2023-11-29 03:13:17,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:13:17,166 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-29 03:13:17,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:13:17,167 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:17,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:17,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:13:17,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:13:17,305 INFO L378 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-29 03:13:17,326 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-29 03:13:17,327 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:13:17,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:13:17,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664309118] [2023-11-29 03:13:17,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664309118] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:13:17,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:13:17,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:13:17,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214939806] [2023-11-29 03:13:17,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:13:17,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:13:17,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:13:17,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:13:17,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:13:17,329 INFO L87 Difference]: Start difference. First operand 912 states and 979 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:13:20,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:13:20,094 INFO L93 Difference]: Finished difference Result 1170 states and 1272 transitions. [2023-11-29 03:13:20,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:13:20,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 03:13:20,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:13:20,101 INFO L225 Difference]: With dead ends: 1170 [2023-11-29 03:13:20,101 INFO L226 Difference]: Without dead ends: 1170 [2023-11-29 03:13:20,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-29 03:13:20,102 INFO L413 NwaCegarLoop]: 901 mSDtfsCounter, 450 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:13:20,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1267 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-29 03:13:20,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2023-11-29 03:13:20,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 925. [2023-11-29 03:13:20,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 464 states have (on average 2.1724137931034484) internal successors, (1008), 918 states have internal predecessors, (1008), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 03:13:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1026 transitions. [2023-11-29 03:13:20,129 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1026 transitions. Word has length 7 [2023-11-29 03:13:20,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:13:20,129 INFO L495 AbstractCegarLoop]: Abstraction has 925 states and 1026 transitions. [2023-11-29 03:13:20,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:13:20,129 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1026 transitions. [2023-11-29 03:13:20,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 03:13:20,130 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:13:20,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:13:20,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 03:13:20,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:20,330 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr428REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:13:20,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:13:20,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1512898287, now seen corresponding path program 1 times [2023-11-29 03:13:20,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:13:20,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014774377] [2023-11-29 03:13:20,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:13:20,331 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-29 03:13:20,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:13:20,332 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:20,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:20,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:13:20,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:13:20,489 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-29 03:13:20,489 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:13:20,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:13:20,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014774377] [2023-11-29 03:13:20,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1014774377] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:13:20,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:13:20,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:13:20,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91525192] [2023-11-29 03:13:20,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:13:20,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:13:20,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:13:20,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:13:20,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:13:20,492 INFO L87 Difference]: Start difference. First operand 925 states and 1026 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-29 03:13:21,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:13:21,773 INFO L93 Difference]: Finished difference Result 1356 states and 1503 transitions. [2023-11-29 03:13:21,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:13:21,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-29 03:13:21,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:13:21,780 INFO L225 Difference]: With dead ends: 1356 [2023-11-29 03:13:21,780 INFO L226 Difference]: Without dead ends: 1356 [2023-11-29 03:13:21,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-29 03:13:21,781 INFO L413 NwaCegarLoop]: 902 mSDtfsCounter, 516 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1623 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:13:21,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1623 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 03:13:21,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2023-11-29 03:13:21,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1079. [2023-11-29 03:13:21,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 613 states have (on average 2.096247960848287) internal successors, (1285), 1072 states have internal predecessors, (1285), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 03:13:21,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1313 transitions. [2023-11-29 03:13:21,804 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1313 transitions. Word has length 10 [2023-11-29 03:13:21,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:13:21,805 INFO L495 AbstractCegarLoop]: Abstraction has 1079 states and 1313 transitions. [2023-11-29 03:13:21,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-29 03:13:21,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1313 transitions. [2023-11-29 03:13:21,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 03:13:21,805 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:13:21,805 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:13:21,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 03:13:22,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:22,006 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:13:22,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:13:22,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1725604592, now seen corresponding path program 1 times [2023-11-29 03:13:22,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:13:22,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602214369] [2023-11-29 03:13:22,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:13:22,007 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-29 03:13:22,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:13:22,008 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:22,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:22,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:13:22,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:13:22,144 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-29 03:13:22,145 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:13:22,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:13:22,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602214369] [2023-11-29 03:13:22,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602214369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:13:22,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:13:22,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:13:22,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109882235] [2023-11-29 03:13:22,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:13:22,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:13:22,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:13:22,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:13:22,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:13:22,147 INFO L87 Difference]: Start difference. First operand 1079 states and 1313 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-29 03:13:22,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:13:22,914 INFO L93 Difference]: Finished difference Result 1025 states and 1233 transitions. [2023-11-29 03:13:22,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:13:22,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2023-11-29 03:13:22,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:13:22,921 INFO L225 Difference]: With dead ends: 1025 [2023-11-29 03:13:22,921 INFO L226 Difference]: Without dead ends: 1025 [2023-11-29 03:13:22,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-29 03:13:22,922 INFO L413 NwaCegarLoop]: 805 mSDtfsCounter, 70 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:13:22,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1561 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 03:13:22,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2023-11-29 03:13:22,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1025. [2023-11-29 03:13:22,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 583 states have (on average 2.0668953687821614) internal successors, (1205), 1018 states have internal predecessors, (1205), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 03:13:22,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1233 transitions. [2023-11-29 03:13:22,940 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1233 transitions. Word has length 12 [2023-11-29 03:13:22,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:13:22,940 INFO L495 AbstractCegarLoop]: Abstraction has 1025 states and 1233 transitions. [2023-11-29 03:13:22,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-29 03:13:22,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1233 transitions. [2023-11-29 03:13:22,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 03:13:22,941 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:13:22,942 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:13:22,944 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 03:13:23,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:23,144 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr533ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:13:23,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:13:23,144 INFO L85 PathProgramCache]: Analyzing trace with hash 641111906, now seen corresponding path program 1 times [2023-11-29 03:13:23,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:13:23,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045575206] [2023-11-29 03:13:23,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:13:23,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:13:23,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:13:23,145 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:23,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:23,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 03:13:23,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:13:23,296 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:13:23,297 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:13:23,297 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:13:23,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2023-11-29 03:13:23,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:13:23,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2023-11-29 03:13:23,371 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-29 03:13:23,371 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:13:23,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:13:23,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045575206] [2023-11-29 03:13:23,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045575206] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:13:23,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:13:23,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:13:23,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577786716] [2023-11-29 03:13:23,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:13:23,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:13:23,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:13:23,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:13:23,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:13:23,372 INFO L87 Difference]: Start difference. First operand 1025 states and 1233 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:13:25,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:13:25,285 INFO L93 Difference]: Finished difference Result 1786 states and 2016 transitions. [2023-11-29 03:13:25,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:13:25,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-29 03:13:25,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:13:25,292 INFO L225 Difference]: With dead ends: 1786 [2023-11-29 03:13:25,292 INFO L226 Difference]: Without dead ends: 1786 [2023-11-29 03:13:25,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:13:25,293 INFO L413 NwaCegarLoop]: 989 mSDtfsCounter, 851 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:13:25,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 2774 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 03:13:25,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2023-11-29 03:13:25,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1024. [2023-11-29 03:13:25,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 582 states have (on average 2.0670103092783507) internal successors, (1203), 1017 states have internal predecessors, (1203), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 03:13:25,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1231 transitions. [2023-11-29 03:13:25,322 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1231 transitions. Word has length 13 [2023-11-29 03:13:25,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:13:25,322 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 1231 transitions. [2023-11-29 03:13:25,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:13:25,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1231 transitions. [2023-11-29 03:13:25,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 03:13:25,323 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:13:25,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:13:25,329 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:25,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:25,524 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:13:25,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:13:25,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1860699003, now seen corresponding path program 1 times [2023-11-29 03:13:25,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:13:25,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [541894240] [2023-11-29 03:13:25,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:13:25,525 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-29 03:13:25,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:13:25,525 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:25,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:25,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:13:25,680 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:13:25,687 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-29 03:13:25,688 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:13:25,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:13:25,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [541894240] [2023-11-29 03:13:25,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [541894240] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:13:25,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:13:25,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:13:25,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291681790] [2023-11-29 03:13:25,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:13:25,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:13:25,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:13:25,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:13:25,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:13:25,689 INFO L87 Difference]: Start difference. First operand 1024 states and 1231 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:13:26,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:13:26,445 INFO L93 Difference]: Finished difference Result 970 states and 1151 transitions. [2023-11-29 03:13:26,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:13:26,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 03:13:26,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:13:26,451 INFO L225 Difference]: With dead ends: 970 [2023-11-29 03:13:26,451 INFO L226 Difference]: Without dead ends: 970 [2023-11-29 03:13:26,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-29 03:13:26,452 INFO L413 NwaCegarLoop]: 768 mSDtfsCounter, 70 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:13:26,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1487 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 03:13:26,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2023-11-29 03:13:26,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2023-11-29 03:13:26,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 552 states have (on average 2.0344202898550723) internal successors, (1123), 963 states have internal predecessors, (1123), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 03:13:26,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1151 transitions. [2023-11-29 03:13:26,473 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1151 transitions. Word has length 15 [2023-11-29 03:13:26,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:13:26,473 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 1151 transitions. [2023-11-29 03:13:26,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:13:26,473 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1151 transitions. [2023-11-29 03:13:26,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 03:13:26,474 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:13:26,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:13:26,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 03:13:26,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:26,675 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:13:26,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:13:26,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1425344277, now seen corresponding path program 1 times [2023-11-29 03:13:26,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:13:26,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913027808] [2023-11-29 03:13:26,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:13:26,676 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-29 03:13:26,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:13:26,676 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:26,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:26,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:13:26,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:13:26,829 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-29 03:13:26,830 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:13:26,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:13:26,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913027808] [2023-11-29 03:13:26,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913027808] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:13:26,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:13:26,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:13:26,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604648123] [2023-11-29 03:13:26,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:13:26,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:13:26,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:13:26,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:13:26,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:13:26,832 INFO L87 Difference]: Start difference. First operand 970 states and 1151 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-29 03:13:27,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:13:27,784 INFO L93 Difference]: Finished difference Result 956 states and 1109 transitions. [2023-11-29 03:13:27,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:13:27,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2023-11-29 03:13:27,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:13:27,790 INFO L225 Difference]: With dead ends: 956 [2023-11-29 03:13:27,790 INFO L226 Difference]: Without dead ends: 956 [2023-11-29 03:13:27,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:13:27,791 INFO L413 NwaCegarLoop]: 737 mSDtfsCounter, 58 mSDsluCounter, 1450 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2187 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:13:27,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2187 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 03:13:27,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2023-11-29 03:13:27,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 954. [2023-11-29 03:13:27,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 550 states have (on average 1.961818181818182) internal successors, (1079), 947 states have internal predecessors, (1079), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 03:13:27,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1107 transitions. [2023-11-29 03:13:27,809 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1107 transitions. Word has length 17 [2023-11-29 03:13:27,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:13:27,810 INFO L495 AbstractCegarLoop]: Abstraction has 954 states and 1107 transitions. [2023-11-29 03:13:27,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-29 03:13:27,810 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1107 transitions. [2023-11-29 03:13:27,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 03:13:27,811 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:13:27,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:13:27,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:28,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:28,012 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:13:28,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:13:28,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1980251715, now seen corresponding path program 1 times [2023-11-29 03:13:28,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:13:28,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881250155] [2023-11-29 03:13:28,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:13:28,013 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-29 03:13:28,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:13:28,013 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:28,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:28,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:13:28,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:13:28,176 INFO L378 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-29 03:13:28,244 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-29 03:13:28,244 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:13:28,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:13:28,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881250155] [2023-11-29 03:13:28,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881250155] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:13:28,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:13:28,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:13:28,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342713264] [2023-11-29 03:13:28,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:13:28,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:13:28,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:13:28,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:13:28,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:13:28,246 INFO L87 Difference]: Start difference. First operand 954 states and 1107 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-29 03:13:30,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:13:30,310 INFO L93 Difference]: Finished difference Result 1178 states and 1407 transitions. [2023-11-29 03:13:30,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:13:30,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2023-11-29 03:13:30,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:13:30,315 INFO L225 Difference]: With dead ends: 1178 [2023-11-29 03:13:30,315 INFO L226 Difference]: Without dead ends: 1178 [2023-11-29 03:13:30,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:13:30,316 INFO L413 NwaCegarLoop]: 489 mSDtfsCounter, 625 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:13:30,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 1057 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 03:13:30,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2023-11-29 03:13:30,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 950. [2023-11-29 03:13:30,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 550 states have (on average 1.9472727272727273) internal successors, (1071), 943 states have internal predecessors, (1071), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 03:13:30,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1099 transitions. [2023-11-29 03:13:30,336 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1099 transitions. Word has length 31 [2023-11-29 03:13:30,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:13:30,336 INFO L495 AbstractCegarLoop]: Abstraction has 950 states and 1099 transitions. [2023-11-29 03:13:30,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-29 03:13:30,337 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1099 transitions. [2023-11-29 03:13:30,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 03:13:30,338 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:13:30,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:13:30,342 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:30,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:30,538 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:13:30,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:13:30,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1980251716, now seen corresponding path program 1 times [2023-11-29 03:13:30,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:13:30,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466644724] [2023-11-29 03:13:30,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:13:30,540 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-29 03:13:30,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:13:30,541 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:30,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:30,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:13:30,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:13:30,748 INFO L378 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-29 03:13:30,935 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-29 03:13:30,935 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:13:30,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:13:30,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466644724] [2023-11-29 03:13:30,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466644724] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:13:30,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:13:30,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:13:30,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573860341] [2023-11-29 03:13:30,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:13:30,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:13:30,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:13:30,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:13:30,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:13:30,937 INFO L87 Difference]: Start difference. First operand 950 states and 1099 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-29 03:13:34,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:13:34,084 INFO L93 Difference]: Finished difference Result 1219 states and 1413 transitions. [2023-11-29 03:13:34,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:13:34,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2023-11-29 03:13:34,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:13:34,090 INFO L225 Difference]: With dead ends: 1219 [2023-11-29 03:13:34,090 INFO L226 Difference]: Without dead ends: 1219 [2023-11-29 03:13:34,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:13:34,091 INFO L413 NwaCegarLoop]: 876 mSDtfsCounter, 345 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:13:34,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1748 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-29 03:13:34,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2023-11-29 03:13:34,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 946. [2023-11-29 03:13:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 550 states have (on average 1.9327272727272726) internal successors, (1063), 939 states have internal predecessors, (1063), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 03:13:34,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1091 transitions. [2023-11-29 03:13:34,106 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1091 transitions. Word has length 31 [2023-11-29 03:13:34,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:13:34,107 INFO L495 AbstractCegarLoop]: Abstraction has 946 states and 1091 transitions. [2023-11-29 03:13:34,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-29 03:13:34,107 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1091 transitions. [2023-11-29 03:13:34,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 03:13:34,109 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:13:34,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:13:34,112 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 03:13:34,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:34,310 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:13:34,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:13:34,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1353315314, now seen corresponding path program 1 times [2023-11-29 03:13:34,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:13:34,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812885206] [2023-11-29 03:13:34,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:13:34,311 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-29 03:13:34,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:13:34,312 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:34,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:34,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:13:34,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:13:34,579 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-29 03:13:34,579 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:13:34,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:13:34,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812885206] [2023-11-29 03:13:34,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812885206] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:13:34,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:13:34,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:13:34,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714581460] [2023-11-29 03:13:34,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:13:34,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:13:34,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:13:34,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:13:34,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:13:34,581 INFO L87 Difference]: Start difference. First operand 946 states and 1091 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-29 03:13:35,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:13:35,483 INFO L93 Difference]: Finished difference Result 934 states and 1071 transitions. [2023-11-29 03:13:35,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:13:35,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 50 [2023-11-29 03:13:35,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:13:35,489 INFO L225 Difference]: With dead ends: 934 [2023-11-29 03:13:35,489 INFO L226 Difference]: Without dead ends: 934 [2023-11-29 03:13:35,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:13:35,489 INFO L413 NwaCegarLoop]: 731 mSDtfsCounter, 23 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2173 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:13:35,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2173 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 03:13:35,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2023-11-29 03:13:35,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2023-11-29 03:13:35,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 538 states have (on average 1.9386617100371748) internal successors, (1043), 927 states have internal predecessors, (1043), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 03:13:35,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1071 transitions. [2023-11-29 03:13:35,502 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1071 transitions. Word has length 50 [2023-11-29 03:13:35,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:13:35,502 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 1071 transitions. [2023-11-29 03:13:35,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-29 03:13:35,503 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1071 transitions. [2023-11-29 03:13:35,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 03:13:35,504 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:13:35,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:13:35,510 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:35,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:35,705 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:13:35,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:13:35,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1912808051, now seen corresponding path program 1 times [2023-11-29 03:13:35,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:13:35,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281807504] [2023-11-29 03:13:35,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:13:35,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:13:35,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:13:35,707 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:35,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:36,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 03:13:36,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:13:36,048 INFO L378 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-29 03:13:36,053 INFO L378 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-29 03:13:36,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:13:36,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 03:13:36,519 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:13:36,519 INFO L378 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-29 03:13:36,534 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-29 03:13:36,534 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:13:36,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:13:36,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281807504] [2023-11-29 03:13:36,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281807504] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:13:36,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:13:36,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:13:36,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132026606] [2023-11-29 03:13:36,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:13:36,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:13:36,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:13:36,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:13:36,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:13:36,537 INFO L87 Difference]: Start difference. First operand 934 states and 1071 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:13:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:13:39,094 INFO L93 Difference]: Finished difference Result 1124 states and 1341 transitions. [2023-11-29 03:13:39,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:13:39,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-11-29 03:13:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:13:39,100 INFO L225 Difference]: With dead ends: 1124 [2023-11-29 03:13:39,100 INFO L226 Difference]: Without dead ends: 1124 [2023-11-29 03:13:39,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 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-29 03:13:39,101 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 711 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:13:39,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 598 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-29 03:13:39,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2023-11-29 03:13:39,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 873. [2023-11-29 03:13:39,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 515 states have (on average 1.840776699029126) internal successors, (948), 866 states have internal predecessors, (948), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 03:13:39,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 976 transitions. [2023-11-29 03:13:39,119 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 976 transitions. Word has length 54 [2023-11-29 03:13:39,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:13:39,119 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 976 transitions. [2023-11-29 03:13:39,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:13:39,120 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 976 transitions. [2023-11-29 03:13:39,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 03:13:39,120 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:13:39,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:13:39,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 03:13:39,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:39,321 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:13:39,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:13:39,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1284972781, now seen corresponding path program 1 times [2023-11-29 03:13:39,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:13:39,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217444315] [2023-11-29 03:13:39,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:13:39,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:13:39,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:13:39,323 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:39,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:39,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 03:13:39,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:13:39,592 INFO L378 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-29 03:13:39,609 INFO L378 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 19 treesize of output 1 [2023-11-29 03:13:39,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 03:13:39,639 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-29 03:13:39,639 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:13:39,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:13:39,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217444315] [2023-11-29 03:13:39,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217444315] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:13:39,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:13:39,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:13:39,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975088386] [2023-11-29 03:13:39,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:13:39,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:13:39,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:13:39,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:13:39,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:13:39,641 INFO L87 Difference]: Start difference. First operand 873 states and 976 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-29 03:13:42,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:13:42,224 INFO L93 Difference]: Finished difference Result 872 states and 975 transitions. [2023-11-29 03:13:42,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:13:42,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2023-11-29 03:13:42,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:13:42,229 INFO L225 Difference]: With dead ends: 872 [2023-11-29 03:13:42,229 INFO L226 Difference]: Without dead ends: 872 [2023-11-29 03:13:42,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:13:42,229 INFO L413 NwaCegarLoop]: 705 mSDtfsCounter, 3 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:13:42,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1867 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-29 03:13:42,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2023-11-29 03:13:42,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2023-11-29 03:13:42,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 515 states have (on average 1.8388349514563107) internal successors, (947), 865 states have internal predecessors, (947), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 03:13:42,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 975 transitions. [2023-11-29 03:13:42,241 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 975 transitions. Word has length 58 [2023-11-29 03:13:42,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:13:42,241 INFO L495 AbstractCegarLoop]: Abstraction has 872 states and 975 transitions. [2023-11-29 03:13:42,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-29 03:13:42,241 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 975 transitions. [2023-11-29 03:13:42,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 03:13:42,242 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:13:42,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:13:42,247 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 03:13:42,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:42,443 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:13:42,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:13:42,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1284972780, now seen corresponding path program 1 times [2023-11-29 03:13:42,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:13:42,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280658215] [2023-11-29 03:13:42,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:13:42,443 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-29 03:13:42,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:13:42,444 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:42,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:42,687 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 03:13:42,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:13:42,696 INFO L378 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-29 03:13:42,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 03:13:42,724 INFO L378 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 19 treesize of output 1 [2023-11-29 03:13:42,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-29 03:13:42,785 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-29 03:13:42,785 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:13:42,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:13:42,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280658215] [2023-11-29 03:13:42,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280658215] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:13:42,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:13:42,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:13:42,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818990605] [2023-11-29 03:13:42,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:13:42,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:13:42,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:13:42,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:13:42,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:13:42,787 INFO L87 Difference]: Start difference. First operand 872 states and 975 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-29 03:13:45,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:13:45,880 INFO L93 Difference]: Finished difference Result 871 states and 974 transitions. [2023-11-29 03:13:45,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:13:45,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2023-11-29 03:13:45,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:13:45,884 INFO L225 Difference]: With dead ends: 871 [2023-11-29 03:13:45,884 INFO L226 Difference]: Without dead ends: 871 [2023-11-29 03:13:45,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:13:45,885 INFO L413 NwaCegarLoop]: 705 mSDtfsCounter, 1 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:13:45,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1901 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-29 03:13:45,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2023-11-29 03:13:45,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2023-11-29 03:13:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 514 states have (on average 1.8404669260700388) internal successors, (946), 864 states have internal predecessors, (946), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 03:13:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 974 transitions. [2023-11-29 03:13:45,896 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 974 transitions. Word has length 58 [2023-11-29 03:13:45,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:13:45,896 INFO L495 AbstractCegarLoop]: Abstraction has 871 states and 974 transitions. [2023-11-29 03:13:45,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-29 03:13:45,896 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 974 transitions. [2023-11-29 03:13:45,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 03:13:45,897 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:13:45,897 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:13:45,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 03:13:46,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:46,098 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:13:46,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:13:46,098 INFO L85 PathProgramCache]: Analyzing trace with hash 685707575, now seen corresponding path program 1 times [2023-11-29 03:13:46,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:13:46,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584730357] [2023-11-29 03:13:46,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:13:46,099 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-29 03:13:46,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:13:46,100 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:46,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:46,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:13:46,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:13:46,398 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-29 03:13:46,398 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:13:46,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:13:46,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584730357] [2023-11-29 03:13:46,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584730357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:13:46,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:13:46,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:13:46,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144828462] [2023-11-29 03:13:46,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:13:46,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:13:46,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:13:46,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:13:46,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:13:46,400 INFO L87 Difference]: Start difference. First operand 871 states and 974 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-29 03:13:47,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:13:47,311 INFO L93 Difference]: Finished difference Result 873 states and 977 transitions. [2023-11-29 03:13:47,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:13:47,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2023-11-29 03:13:47,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:13:47,318 INFO L225 Difference]: With dead ends: 873 [2023-11-29 03:13:47,318 INFO L226 Difference]: Without dead ends: 873 [2023-11-29 03:13:47,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:13:47,319 INFO L413 NwaCegarLoop]: 705 mSDtfsCounter, 1 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:13:47,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2112 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 03:13:47,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2023-11-29 03:13:47,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2023-11-29 03:13:47,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 515 states have (on average 1.840776699029126) internal successors, (948), 866 states have internal predecessors, (948), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 03:13:47,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 977 transitions. [2023-11-29 03:13:47,334 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 977 transitions. Word has length 64 [2023-11-29 03:13:47,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:13:47,334 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 977 transitions. [2023-11-29 03:13:47,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-29 03:13:47,334 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 977 transitions. [2023-11-29 03:13:47,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-29 03:13:47,335 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:13:47,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:13:47,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:47,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:47,536 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:13:47,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:13:47,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1426844639, now seen corresponding path program 1 times [2023-11-29 03:13:47,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:13:47,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286416352] [2023-11-29 03:13:47,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:13:47,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:13:47,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:13:47,538 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:47,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:13:47,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:13:47,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:13:47,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:13:47,836 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:13:47,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:13:47,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:13:47,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286416352] [2023-11-29 03:13:47,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286416352] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:13:47,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:13:47,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 03:13:47,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061582561] [2023-11-29 03:13:47,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:13:47,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:13:47,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:13:47,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:13:47,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:13:47,898 INFO L87 Difference]: Start difference. First operand 873 states and 977 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:13:49,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:13:49,323 INFO L93 Difference]: Finished difference Result 882 states and 991 transitions. [2023-11-29 03:13:49,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 03:13:49,324 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2023-11-29 03:13:49,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:13:49,328 INFO L225 Difference]: With dead ends: 882 [2023-11-29 03:13:49,328 INFO L226 Difference]: Without dead ends: 882 [2023-11-29 03:13:49,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:13:49,329 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 6 mSDsluCounter, 2810 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3514 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:13:49,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3514 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 03:13:49,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2023-11-29 03:13:49,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 881. [2023-11-29 03:13:49,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 522 states have (on average 1.8409961685823755) internal successors, (961), 873 states have internal predecessors, (961), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 03:13:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 990 transitions. [2023-11-29 03:13:49,343 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 990 transitions. Word has length 65 [2023-11-29 03:13:49,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:13:49,344 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 990 transitions. [2023-11-29 03:13:49,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:13:49,344 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 990 transitions. [2023-11-29 03:13:49,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 03:13:49,344 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:13:49,345 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:13:49,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-11-29 03:13:49,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:49,545 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:13:49,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:13:49,545 INFO L85 PathProgramCache]: Analyzing trace with hash 982809399, now seen corresponding path program 2 times [2023-11-29 03:13:49,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:13:49,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000407789] [2023-11-29 03:13:49,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:13:49,546 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-29 03:13:49,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:13:49,547 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:49,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 03:13:49,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 03:13:49,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:13:49,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 03:13:49,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:13:50,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:13:50,027 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:13:50,180 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:13:50,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:13:50,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000407789] [2023-11-29 03:13:50,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1000407789] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:13:50,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:13:50,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 03:13:50,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476847755] [2023-11-29 03:13:50,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:13:50,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 03:13:50,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:13:50,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 03:13:50,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 03:13:50,183 INFO L87 Difference]: Start difference. First operand 881 states and 990 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:13:52,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:13:52,531 INFO L93 Difference]: Finished difference Result 896 states and 1012 transitions. [2023-11-29 03:13:52,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 03:13:52,532 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2023-11-29 03:13:52,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:13:52,537 INFO L225 Difference]: With dead ends: 896 [2023-11-29 03:13:52,537 INFO L226 Difference]: Without dead ends: 894 [2023-11-29 03:13:52,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-29 03:13:52,538 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 12 mSDsluCounter, 4216 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4920 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:13:52,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4920 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-29 03:13:52,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2023-11-29 03:13:52,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 890. [2023-11-29 03:13:52,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 531 states have (on average 1.832391713747646) internal successors, (973), 882 states have internal predecessors, (973), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 03:13:52,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1002 transitions. [2023-11-29 03:13:52,554 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1002 transitions. Word has length 68 [2023-11-29 03:13:52,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:13:52,555 INFO L495 AbstractCegarLoop]: Abstraction has 890 states and 1002 transitions. [2023-11-29 03:13:52,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:13:52,555 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1002 transitions. [2023-11-29 03:13:52,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 03:13:52,555 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:13:52,556 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:13:52,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-11-29 03:13:52,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:52,756 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:13:52,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:13:52,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1292158409, now seen corresponding path program 3 times [2023-11-29 03:13:52,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:13:52,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532800888] [2023-11-29 03:13:52,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 03:13:52,757 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-29 03:13:52,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:13:52,758 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:13:52,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-29 03:13:53,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 03:13:53,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:13:53,489 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 03:13:53,491 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:13:53,621 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:13:53,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:13:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:13:54,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:13:54,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532800888] [2023-11-29 03:13:54,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532800888] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:13:54,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:13:54,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 03:13:54,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713582484] [2023-11-29 03:13:54,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:13:54,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 03:13:54,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:13:54,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 03:13:54,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 03:13:54,226 INFO L87 Difference]: Start difference. First operand 890 states and 1002 transitions. Second operand has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:14:00,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:14:00,438 INFO L93 Difference]: Finished difference Result 920 states and 1052 transitions. [2023-11-29 03:14:00,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 03:14:00,438 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2023-11-29 03:14:00,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:14:00,443 INFO L225 Difference]: With dead ends: 920 [2023-11-29 03:14:00,443 INFO L226 Difference]: Without dead ends: 917 [2023-11-29 03:14:00,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 03:14:00,444 INFO L413 NwaCegarLoop]: 703 mSDtfsCounter, 24 mSDsluCounter, 9823 mSDsCounter, 0 mSdLazyCounter, 2127 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 10526 SdHoareTripleChecker+Invalid, 2160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:14:00,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 10526 Invalid, 2160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2127 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-11-29 03:14:00,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2023-11-29 03:14:00,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 908. [2023-11-29 03:14:00,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 549 states have (on average 1.814207650273224) internal successors, (996), 900 states have internal predecessors, (996), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 03:14:00,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1025 transitions. [2023-11-29 03:14:00,458 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1025 transitions. Word has length 74 [2023-11-29 03:14:00,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:14:00,458 INFO L495 AbstractCegarLoop]: Abstraction has 908 states and 1025 transitions. [2023-11-29 03:14:00,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:14:00,458 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1025 transitions. [2023-11-29 03:14:00,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 03:14:00,459 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:14:00,459 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:14:00,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-11-29 03:14:00,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:14:00,659 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:14:00,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:14:00,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1582757943, now seen corresponding path program 4 times [2023-11-29 03:14:00,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:14:00,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173675153] [2023-11-29 03:14:00,660 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 03:14:00,661 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-29 03:14:00,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:14:00,661 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:14:00,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-29 03:14:01,013 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 03:14:01,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:14:01,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 03:14:01,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:14:01,375 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:14:01,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:14:02,907 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:14:02,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:14:02,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173675153] [2023-11-29 03:14:02,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173675153] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:14:02,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:14:02,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 03:14:02,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915055605] [2023-11-29 03:14:02,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:14:02,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 03:14:02,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:14:02,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 03:14:02,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 03:14:02,910 INFO L87 Difference]: Start difference. First operand 908 states and 1025 transitions. Second operand has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:14:16,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:14:16,740 INFO L93 Difference]: Finished difference Result 965 states and 1114 transitions. [2023-11-29 03:14:16,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 03:14:16,741 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2023-11-29 03:14:16,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:14:16,746 INFO L225 Difference]: With dead ends: 965 [2023-11-29 03:14:16,746 INFO L226 Difference]: Without dead ends: 963 [2023-11-29 03:14:16,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 03:14:16,751 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 48 mSDsluCounter, 16169 mSDsCounter, 0 mSdLazyCounter, 4601 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 16873 SdHoareTripleChecker+Invalid, 4649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 4601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:14:16,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 16873 Invalid, 4649 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 4601 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2023-11-29 03:14:16,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2023-11-29 03:14:16,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 942. [2023-11-29 03:14:16,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 583 states have (on average 1.7873070325900515) internal successors, (1042), 934 states have internal predecessors, (1042), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 03:14:16,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1071 transitions. [2023-11-29 03:14:16,772 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1071 transitions. Word has length 86 [2023-11-29 03:14:16,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:14:16,772 INFO L495 AbstractCegarLoop]: Abstraction has 942 states and 1071 transitions. [2023-11-29 03:14:16,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:14:16,772 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1071 transitions. [2023-11-29 03:14:16,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 03:14:16,773 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:14:16,774 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:14:16,780 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-11-29 03:14:16,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:14:16,974 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:14:16,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:14:16,975 INFO L85 PathProgramCache]: Analyzing trace with hash -774398153, now seen corresponding path program 5 times [2023-11-29 03:14:16,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:14:16,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673131899] [2023-11-29 03:14:16,975 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 03:14:16,975 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-29 03:14:16,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:14:16,976 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:14:16,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-11-29 03:14:18,355 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 03:14:18,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:14:18,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 03:14:18,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:14:18,400 INFO L378 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-29 03:14:18,520 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:14:18,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 03:14:18,551 INFO L378 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 19 treesize of output 1 [2023-11-29 03:14:18,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 03:14:19,617 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:14:19,618 INFO L378 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 44 treesize of output 43 [2023-11-29 03:14:19,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 03:14:19,713 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:14:19,713 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:14:20,158 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_1994) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 03:14:20,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:14:20,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673131899] [2023-11-29 03:14:20,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673131899] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:14:20,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [169322984] [2023-11-29 03:14:20,161 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 03:14:20,161 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:14:20,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:14:20,162 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:14:20,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2023-11-29 03:15:24,360 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 03:15:24,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:15:24,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 03:15:24,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:24,568 INFO L378 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-29 03:15:24,829 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:15:24,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 03:15:24,893 INFO L378 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 15 treesize of output 1 [2023-11-29 03:15:25,030 INFO L378 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 20 treesize of output 12 [2023-11-29 03:15:25,958 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:15:25,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:15:26,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 03:15:26,046 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:15:26,046 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:15:26,430 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2458) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:15:26,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [169322984] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:15:26,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:15:26,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 03:15:26,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280312139] [2023-11-29 03:15:26,432 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:15:26,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 03:15:26,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:26,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 03:15:26,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=163, Unknown=2, NotChecked=54, Total=272 [2023-11-29 03:15:26,434 INFO L87 Difference]: Start difference. First operand 942 states and 1071 transitions. Second operand has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 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-29 03:15:33,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:33,266 INFO L93 Difference]: Finished difference Result 1171 states and 1378 transitions. [2023-11-29 03:15:33,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:15:33,267 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 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) Word has length 108 [2023-11-29 03:15:33,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:33,273 INFO L225 Difference]: With dead ends: 1171 [2023-11-29 03:15:33,273 INFO L226 Difference]: Without dead ends: 1169 [2023-11-29 03:15:33,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=184, Unknown=2, NotChecked=58, Total=306 [2023-11-29 03:15:33,274 INFO L413 NwaCegarLoop]: 480 mSDtfsCounter, 517 mSDsluCounter, 2603 mSDsCounter, 0 mSdLazyCounter, 3205 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 3083 SdHoareTripleChecker+Invalid, 3210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:33,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 3083 Invalid, 3210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3205 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2023-11-29 03:15:33,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2023-11-29 03:15:33,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 941. [2023-11-29 03:15:33,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 583 states have (on average 1.7787307032590052) internal successors, (1037), 933 states have internal predecessors, (1037), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 03:15:33,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1066 transitions. [2023-11-29 03:15:33,293 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1066 transitions. Word has length 108 [2023-11-29 03:15:33,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:33,294 INFO L495 AbstractCegarLoop]: Abstraction has 941 states and 1066 transitions. [2023-11-29 03:15:33,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 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-29 03:15:33,294 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1066 transitions. [2023-11-29 03:15:33,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 03:15:33,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:33,295 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:33,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2023-11-29 03:15:33,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-11-29 03:15:33,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:15:33,696 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:15:33,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:33,696 INFO L85 PathProgramCache]: Analyzing trace with hash -774398152, now seen corresponding path program 1 times [2023-11-29 03:15:33,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:33,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698330365] [2023-11-29 03:15:33,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:33,697 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-29 03:15:33,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:33,698 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:15:33,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-11-29 03:15:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 03:15:34,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:34,364 INFO L378 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-29 03:15:34,578 INFO L378 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-29 03:15:34,590 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:15:34,590 INFO L378 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-29 03:15:34,621 INFO L378 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 11 treesize of output 7 [2023-11-29 03:15:34,631 INFO L378 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 15 treesize of output 1 [2023-11-29 03:15:34,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 03:15:34,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:15:35,391 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:15:35,392 INFO L378 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 50 treesize of output 45 [2023-11-29 03:15:35,403 INFO L378 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 24 treesize of output 11 [2023-11-29 03:15:35,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:15:35,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:15:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:15:35,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:15:36,904 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3012 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv16 32)) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3012 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:15:36,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:36,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698330365] [2023-11-29 03:15:36,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1698330365] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:15:36,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [805190909] [2023-11-29 03:15:36,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:36,911 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:15:36,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:15:36,912 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:15:36,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-11-29 03:17:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:19,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-29 03:17:19,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:17:19,956 INFO L378 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-29 03:17:20,214 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:17:20,215 INFO L378 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-29 03:17:20,243 INFO L378 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-29 03:17:20,260 INFO L378 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 15 treesize of output 1 [2023-11-29 03:17:20,266 INFO L378 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 11 treesize of output 7 [2023-11-29 03:17:20,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 03:17:20,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:17:21,125 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:17:21,125 INFO L378 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 50 treesize of output 45 [2023-11-29 03:17:21,135 INFO L378 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 24 treesize of output 11 [2023-11-29 03:17:21,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:17:21,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:17:21,204 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:17:21,204 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:17:22,420 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3567 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3568 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3568) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3567) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3568 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3568) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-11-29 03:17:22,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [805190909] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:17:22,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:17:22,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-11-29 03:17:22,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835100161] [2023-11-29 03:17:22,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:17:22,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:17:22,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:17:22,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:17:22,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=88, Unknown=2, NotChecked=38, Total=156 [2023-11-29 03:17:22,430 INFO L87 Difference]: Start difference. First operand 941 states and 1066 transitions. Second operand has 9 states, 7 states have (on average 9.142857142857142) internal successors, (64), 9 states have internal predecessors, (64), 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-29 03:17:31,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:17:31,032 INFO L93 Difference]: Finished difference Result 1168 states and 1373 transitions. [2023-11-29 03:17:31,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:17:31,033 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 9.142857142857142) internal successors, (64), 9 states have internal predecessors, (64), 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 108 [2023-11-29 03:17:31,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:17:31,037 INFO L225 Difference]: With dead ends: 1168 [2023-11-29 03:17:31,037 INFO L226 Difference]: Without dead ends: 1168 [2023-11-29 03:17:31,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=164, Unknown=2, NotChecked=54, Total=272 [2023-11-29 03:17:31,038 INFO L413 NwaCegarLoop]: 505 mSDtfsCounter, 471 mSDsluCounter, 1918 mSDsCounter, 0 mSdLazyCounter, 3630 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 2423 SdHoareTripleChecker+Invalid, 3637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:17:31,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 2423 Invalid, 3637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3630 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2023-11-29 03:17:31,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2023-11-29 03:17:31,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 940. [2023-11-29 03:17:31,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 583 states have (on average 1.777015437392796) internal successors, (1036), 932 states have internal predecessors, (1036), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 03:17:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1065 transitions. [2023-11-29 03:17:31,056 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1065 transitions. Word has length 108 [2023-11-29 03:17:31,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:17:31,056 INFO L495 AbstractCegarLoop]: Abstraction has 940 states and 1065 transitions. [2023-11-29 03:17:31,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 9.142857142857142) internal successors, (64), 9 states have internal predecessors, (64), 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-29 03:17:31,057 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1065 transitions. [2023-11-29 03:17:31,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 03:17:31,058 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:17:31,058 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:17:31,066 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2023-11-29 03:17:31,292 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2023-11-29 03:17:31,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 03:17:31,459 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:17:31,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:17:31,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1165879773, now seen corresponding path program 1 times [2023-11-29 03:17:31,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:17:31,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146203422] [2023-11-29 03:17:31,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:17:31,460 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-29 03:17:31,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:17:31,461 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:17:31,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-11-29 03:17:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:32,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 03:17:32,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:17:32,241 INFO L378 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-29 03:17:32,355 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:17:32,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 03:17:32,382 INFO L378 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 19 treesize of output 1 [2023-11-29 03:17:32,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 03:17:33,370 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:17:33,371 INFO L378 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 44 treesize of output 43 [2023-11-29 03:17:33,478 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:17:33,478 INFO L378 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 44 treesize of output 43 [2023-11-29 03:17:33,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 03:17:33,521 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:17:33,521 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:17:37,628 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3992) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:17:38,035 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4038))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3992)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:17:38,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:17:38,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146203422] [2023-11-29 03:17:38,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146203422] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:17:38,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [390174402] [2023-11-29 03:17:38,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:17:38,039 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:17:38,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:17:38,040 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:17:38,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-11-29 03:17:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:40,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 03:17:40,380 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:17:40,386 INFO L378 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-29 03:17:40,769 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:17:40,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 03:17:40,849 INFO L378 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 15 treesize of output 1 [2023-11-29 03:17:41,068 INFO L378 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 20 treesize of output 12 [2023-11-29 03:17:42,004 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:17:42,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:17:42,177 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:17:42,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:17:42,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 03:17:42,204 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:17:42,205 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:17:46,700 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4508))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3992)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:17:46,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [390174402] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:17:46,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:17:46,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 03:17:46,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984256095] [2023-11-29 03:17:46,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:17:46,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 03:17:46,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:17:46,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 03:17:46,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=242, Unknown=4, NotChecked=102, Total=420 [2023-11-29 03:17:46,705 INFO L87 Difference]: Start difference. First operand 940 states and 1065 transitions. Second operand has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 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-29 03:17:55,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:17:55,422 INFO L93 Difference]: Finished difference Result 1167 states and 1372 transitions. [2023-11-29 03:17:55,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 03:17:55,423 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 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) Word has length 110 [2023-11-29 03:17:55,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:17:55,428 INFO L225 Difference]: With dead ends: 1167 [2023-11-29 03:17:55,428 INFO L226 Difference]: Without dead ends: 1167 [2023-11-29 03:17:55,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 207 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=81, Invalid=269, Unknown=4, NotChecked=108, Total=462 [2023-11-29 03:17:55,429 INFO L413 NwaCegarLoop]: 479 mSDtfsCounter, 512 mSDsluCounter, 2614 mSDsCounter, 0 mSdLazyCounter, 3226 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 3093 SdHoareTripleChecker+Invalid, 3231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:17:55,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 3093 Invalid, 3231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3226 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2023-11-29 03:17:55,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2023-11-29 03:17:55,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 939. [2023-11-29 03:17:55,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 583 states have (on average 1.7753001715265866) internal successors, (1035), 931 states have internal predecessors, (1035), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 03:17:55,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1064 transitions. [2023-11-29 03:17:55,443 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1064 transitions. Word has length 110 [2023-11-29 03:17:55,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:17:55,443 INFO L495 AbstractCegarLoop]: Abstraction has 939 states and 1064 transitions. [2023-11-29 03:17:55,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 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-29 03:17:55,444 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1064 transitions. [2023-11-29 03:17:55,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 03:17:55,444 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:17:55,444 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:17:55,453 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-11-29 03:17:55,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2023-11-29 03:17:55,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 03:17:55,845 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:17:55,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:17:55,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1165879772, now seen corresponding path program 1 times [2023-11-29 03:17:55,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:17:55,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832761315] [2023-11-29 03:17:55,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:17:55,846 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-29 03:17:55,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:17:55,847 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:17:55,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-11-29 03:17:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:56,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-29 03:17:56,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:17:56,666 INFO L378 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-29 03:17:56,978 INFO L378 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-29 03:17:56,998 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:17:56,998 INFO L378 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-29 03:17:57,038 INFO L378 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 11 treesize of output 7 [2023-11-29 03:17:57,054 INFO L378 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 15 treesize of output 1 [2023-11-29 03:17:57,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 03:17:57,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:17:57,959 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:17:57,959 INFO L378 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 50 treesize of output 45 [2023-11-29 03:17:57,968 INFO L378 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 24 treesize of output 11 [2023-11-29 03:17:58,114 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:17:58,114 INFO L378 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 50 treesize of output 45 [2023-11-29 03:17:58,124 INFO L378 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 24 treesize of output 11 [2023-11-29 03:17:58,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:17:58,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:17:58,182 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:17:58,182 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:17:58,378 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4979) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4978 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4979) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:17:58,418 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_4979) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4978 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_4979) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_4978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 03:17:59,716 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5071 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5071) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4979) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4978 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5071 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5070))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5071) .cse2 v_ArrVal_4979) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 03:17:59,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:17:59,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832761315] [2023-11-29 03:17:59,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832761315] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:17:59,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [767234182] [2023-11-29 03:17:59,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:17:59,726 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:17:59,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:17:59,727 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:17:59,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2023-11-29 03:19:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:19:45,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-29 03:19:45,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:19:45,289 INFO L378 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-29 03:19:45,592 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:19:45,592 INFO L378 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-29 03:19:45,603 INFO L378 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-29 03:19:45,619 INFO L378 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 15 treesize of output 1 [2023-11-29 03:19:45,633 INFO L378 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 11 treesize of output 7 [2023-11-29 03:19:45,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 03:19:45,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:19:46,478 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:19:46,478 INFO L378 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 50 treesize of output 45 [2023-11-29 03:19:46,484 INFO L378 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 24 treesize of output 11 [2023-11-29 03:19:46,581 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:19:46,582 INFO L378 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 50 treesize of output 45 [2023-11-29 03:19:46,591 INFO L378 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 24 treesize of output 11 [2023-11-29 03:19:46,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:19:46,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:19:46,624 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:19:46,624 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:19:46,682 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5541 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5541) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5541 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5541) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5542) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:19:46,718 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5541 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_5541) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5541 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_5541) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_5542) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 03:19:48,054 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5633 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5541 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5634) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5633) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5541) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5633 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5541 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5633))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5634) .cse2 v_ArrVal_5541) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5542) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 03:19:48,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [767234182] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:19:48,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:19:48,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2023-11-29 03:19:48,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345163131] [2023-11-29 03:19:48,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:19:48,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:19:48,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:19:48,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:19:48,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=110, Unknown=6, NotChecked=150, Total=306 [2023-11-29 03:19:48,063 INFO L87 Difference]: Start difference. First operand 939 states and 1064 transitions. Second operand has 10 states, 8 states have (on average 8.25) internal successors, (66), 10 states have internal predecessors, (66), 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-29 03:19:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:19:55,738 INFO L93 Difference]: Finished difference Result 1166 states and 1371 transitions. [2023-11-29 03:19:55,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:19:55,739 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.25) internal successors, (66), 10 states have internal predecessors, (66), 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 110 [2023-11-29 03:19:55,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:19:55,743 INFO L225 Difference]: With dead ends: 1166 [2023-11-29 03:19:55,744 INFO L226 Difference]: Without dead ends: 1166 [2023-11-29 03:19:55,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 211 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=219, Unknown=6, NotChecked=210, Total=506 [2023-11-29 03:19:55,744 INFO L413 NwaCegarLoop]: 504 mSDtfsCounter, 469 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 2599 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 2606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:19:55,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1868 Invalid, 2606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2599 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2023-11-29 03:19:55,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2023-11-29 03:19:55,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 938. [2023-11-29 03:19:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 583 states have (on average 1.7735849056603774) internal successors, (1034), 930 states have internal predecessors, (1034), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 03:19:55,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1063 transitions. [2023-11-29 03:19:55,765 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1063 transitions. Word has length 110 [2023-11-29 03:19:55,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:19:55,766 INFO L495 AbstractCegarLoop]: Abstraction has 938 states and 1063 transitions. [2023-11-29 03:19:55,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.25) internal successors, (66), 10 states have internal predecessors, (66), 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-29 03:19:55,766 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1063 transitions. [2023-11-29 03:19:55,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 03:19:55,767 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:19:55,767 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:19:55,817 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2023-11-29 03:19:55,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2023-11-29 03:19:56,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:19:56,168 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:19:56,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:19:56,168 INFO L85 PathProgramCache]: Analyzing trace with hash 577400874, now seen corresponding path program 1 times [2023-11-29 03:19:56,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:19:56,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937129255] [2023-11-29 03:19:56,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:19:56,169 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-29 03:19:56,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:19:56,170 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:19:56,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-11-29 03:19:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:19:57,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 03:19:57,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:19:57,068 INFO L378 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-29 03:19:57,236 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:19:57,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 03:19:57,269 INFO L378 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 19 treesize of output 1 [2023-11-29 03:19:57,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 03:19:58,435 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:19:58,436 INFO L378 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 44 treesize of output 43 [2023-11-29 03:19:58,561 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:19:58,561 INFO L378 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 44 treesize of output 43 [2023-11-29 03:19:58,655 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:19:58,655 INFO L378 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 44 treesize of output 43 [2023-11-29 03:19:58,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 03:19:58,718 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:19:58,718 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:20:02,870 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6074 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 03:20:02,893 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6074 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6073))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6074)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:20:04,167 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6120 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6120))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6073)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6074)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:20:04,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:20:04,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937129255] [2023-11-29 03:20:04,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937129255] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:20:04,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1431899338] [2023-11-29 03:20:04,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:20:04,172 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:20:04,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:20:04,173 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:20:04,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2023-11-29 03:20:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:31,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 03:20:31,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:20:31,736 INFO L378 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-29 03:20:32,074 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:20:32,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 03:20:32,144 INFO L378 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 15 treesize of output 1 [2023-11-29 03:20:32,315 INFO L378 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 20 treesize of output 12 [2023-11-29 03:20:33,249 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:20:33,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:20:33,448 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:20:33,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:20:33,558 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:20:33,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:20:33,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 03:20:33,589 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:20:33,589 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:20:33,607 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6560) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 03:20:33,622 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6560) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 03:20:33,639 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6559))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6560)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:20:33,654 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6559))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6560)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:20:34,110 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6606 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6559 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6606))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6559)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6560)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:20:34,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1431899338] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:20:34,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:20:34,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 03:20:34,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384817461] [2023-11-29 03:20:34,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:20:34,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 03:20:34,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:20:34,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 03:20:34,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=336, Unknown=11, NotChecked=360, Total=812 [2023-11-29 03:20:34,117 INFO L87 Difference]: Start difference. First operand 938 states and 1063 transitions. Second operand has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 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-29 03:20:45,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:20:45,504 INFO L93 Difference]: Finished difference Result 1165 states and 1370 transitions. [2023-11-29 03:20:45,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:20:45,505 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 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) Word has length 112 [2023-11-29 03:20:45,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:20:45,509 INFO L225 Difference]: With dead ends: 1165 [2023-11-29 03:20:45,509 INFO L226 Difference]: Without dead ends: 1165 [2023-11-29 03:20:45,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=115, Invalid=368, Unknown=11, NotChecked=376, Total=870 [2023-11-29 03:20:45,510 INFO L413 NwaCegarLoop]: 478 mSDtfsCounter, 504 mSDsluCounter, 3716 mSDsCounter, 0 mSdLazyCounter, 4640 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 4194 SdHoareTripleChecker+Invalid, 4645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:20:45,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 4194 Invalid, 4645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4640 Invalid, 0 Unknown, 0 Unchecked, 11.2s Time] [2023-11-29 03:20:45,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2023-11-29 03:20:45,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 937. [2023-11-29 03:20:45,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 583 states have (on average 1.771869639794168) internal successors, (1033), 929 states have internal predecessors, (1033), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 03:20:45,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1062 transitions. [2023-11-29 03:20:45,522 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1062 transitions. Word has length 112 [2023-11-29 03:20:45,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:20:45,523 INFO L495 AbstractCegarLoop]: Abstraction has 937 states and 1062 transitions. [2023-11-29 03:20:45,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 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-29 03:20:45,523 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1062 transitions. [2023-11-29 03:20:45,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 03:20:45,524 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:20:45,524 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:20:45,536 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2023-11-29 03:20:45,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2023-11-29 03:20:45,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 03:20:45,924 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:20:45,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:20:45,925 INFO L85 PathProgramCache]: Analyzing trace with hash 577400875, now seen corresponding path program 1 times [2023-11-29 03:20:45,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:20:45,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312084808] [2023-11-29 03:20:45,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:20:45,926 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-29 03:20:45,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:20:45,926 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:20:45,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-11-29 03:20:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:20:46,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-29 03:20:46,876 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:20:46,881 INFO L378 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-29 03:20:47,196 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:20:47,197 INFO L378 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-29 03:20:47,207 INFO L378 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-29 03:20:47,255 INFO L378 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 11 treesize of output 7 [2023-11-29 03:20:47,265 INFO L378 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 15 treesize of output 1 [2023-11-29 03:20:47,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 03:20:47,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:20:48,117 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:20:48,117 INFO L378 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 50 treesize of output 45 [2023-11-29 03:20:48,127 INFO L378 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 24 treesize of output 11 [2023-11-29 03:20:48,243 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:20:48,243 INFO L378 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 50 treesize of output 45 [2023-11-29 03:20:48,251 INFO L378 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 24 treesize of output 11 [2023-11-29 03:20:48,345 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:20:48,345 INFO L378 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 50 treesize of output 45 [2023-11-29 03:20:48,350 INFO L378 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 24 treesize of output 11 [2023-11-29 03:20:48,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:20:48,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:20:48,412 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:20:48,412 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:20:48,602 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-11-29 03:20:48,641 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-11-29 03:20:48,687 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7091 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7092))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7091) .cse0 v_ArrVal_7094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7091 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7091) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 03:20:48,758 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7091 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7092))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7091) .cse1 v_ArrVal_7094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7091 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7091) (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-29 03:20:50,661 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7091 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7185))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7186) .cse1 v_ArrVal_7091) (select (select (store .cse2 .cse1 v_ArrVal_7092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7094))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7091 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7185))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7092))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7186) .cse4 v_ArrVal_7091) .cse5 v_ArrVal_7094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 03:20:50,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:20:50,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312084808] [2023-11-29 03:20:50,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312084808] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:20:50,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [352031984] [2023-11-29 03:20:50,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:20:50,678 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:20:50,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:20:50,679 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:20:50,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2023-11-29 03:21:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:21:18,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 03:21:18,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:21:18,415 INFO L378 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-29 03:21:18,899 INFO L378 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-29 03:21:18,928 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:21:18,929 INFO L378 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-29 03:21:18,956 INFO L378 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 15 treesize of output 1 [2023-11-29 03:21:18,974 INFO L378 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 11 treesize of output 7 [2023-11-29 03:21:19,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 03:21:19,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:21:20,155 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:21:20,155 INFO L378 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 50 treesize of output 45 [2023-11-29 03:21:20,169 INFO L378 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 24 treesize of output 11 [2023-11-29 03:21:20,318 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:21:20,319 INFO L378 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 50 treesize of output 45 [2023-11-29 03:21:20,331 INFO L378 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 24 treesize of output 11 [2023-11-29 03:21:20,408 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:21:20,409 INFO L378 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 50 treesize of output 45 [2023-11-29 03:21:20,421 INFO L378 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 24 treesize of output 11 [2023-11-29 03:21:20,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:21:20,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:21:20,466 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:21:20,466 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:21:20,542 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7674) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7673 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7674) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7673) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:21:20,582 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7673 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7674) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7673) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7674) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-11-29 03:21:21,065 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7672) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_7671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7674) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_7671))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7672) .cse3 v_ArrVal_7674) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7673) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 03:21:23,539 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7765))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7766) .cse1 v_ArrVal_7672) (select (select (store .cse2 .cse1 v_ArrVal_7671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7674))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7765))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7671))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7766) .cse4 v_ArrVal_7672) .cse5 v_ArrVal_7674) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7673) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 03:21:23,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [352031984] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:21:23,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:21:23,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2023-11-29 03:21:23,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557670033] [2023-11-29 03:21:23,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:21:23,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 03:21:23,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:21:23,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 03:21:23,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=145, Unknown=20, NotChecked=288, Total=506 [2023-11-29 03:21:23,557 INFO L87 Difference]: Start difference. First operand 937 states and 1062 transitions. Second operand has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 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-29 03:21:38,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:21:38,563 INFO L93 Difference]: Finished difference Result 1164 states and 1369 transitions. [2023-11-29 03:21:38,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 03:21:38,564 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 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 112 [2023-11-29 03:21:38,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:21:38,568 INFO L225 Difference]: With dead ends: 1164 [2023-11-29 03:21:38,568 INFO L226 Difference]: Without dead ends: 1164 [2023-11-29 03:21:38,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 214 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=92, Invalid=298, Unknown=26, NotChecked=396, Total=812 [2023-11-29 03:21:38,569 INFO L413 NwaCegarLoop]: 504 mSDtfsCounter, 464 mSDsluCounter, 1922 mSDsCounter, 0 mSdLazyCounter, 3619 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 2426 SdHoareTripleChecker+Invalid, 3625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:21:38,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 2426 Invalid, 3625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3619 Invalid, 0 Unknown, 0 Unchecked, 14.3s Time] [2023-11-29 03:21:38,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2023-11-29 03:21:38,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 936. [2023-11-29 03:21:38,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 583 states have (on average 1.7701543739279588) internal successors, (1032), 928 states have internal predecessors, (1032), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 03:21:38,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1061 transitions. [2023-11-29 03:21:38,585 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1061 transitions. Word has length 112 [2023-11-29 03:21:38,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:21:38,585 INFO L495 AbstractCegarLoop]: Abstraction has 936 states and 1061 transitions. [2023-11-29 03:21:38,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 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-29 03:21:38,585 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1061 transitions. [2023-11-29 03:21:38,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 03:21:38,586 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:21:38,586 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:21:38,621 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2023-11-29 03:21:38,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Ended with exit code 0 [2023-11-29 03:21:38,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:21:38,987 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:21:38,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:21:38,987 INFO L85 PathProgramCache]: Analyzing trace with hash 832851659, now seen corresponding path program 1 times [2023-11-29 03:21:38,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:21:38,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124575917] [2023-11-29 03:21:38,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:21:38,988 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-29 03:21:38,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:21:38,988 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:21:38,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2023-11-29 03:21:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:21:40,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 03:21:40,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:21:40,097 INFO L378 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-29 03:21:40,394 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:21:40,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 03:21:40,448 INFO L378 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 19 treesize of output 1 [2023-11-29 03:21:40,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 03:21:42,094 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:21:42,095 INFO L378 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 44 treesize of output 43 [2023-11-29 03:21:42,279 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:21:42,279 INFO L378 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 44 treesize of output 43 [2023-11-29 03:21:42,435 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:21:42,436 INFO L378 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 44 treesize of output 43 [2023-11-29 03:21:42,590 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:21:42,590 INFO L378 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 44 treesize of output 43 [2023-11-29 03:21:42,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 03:21:42,708 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:21:42,708 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:21:43,178 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8222 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-11-29 03:21:43,200 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8221 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8222 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8221))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8222)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:21:43,223 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8221 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8222 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8221))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8222)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:21:43,248 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8221 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8220 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8222 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8220))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8221)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8222)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:21:43,275 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8221 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8220 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8222 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8220))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8221)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8222)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:21:43,826 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8221 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8220 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8222 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8268))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8220)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8221)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8222)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:21:43,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:21:43,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124575917] [2023-11-29 03:21:43,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124575917] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:21:43,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1734415339] [2023-11-29 03:21:43,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:21:43,833 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:21:43,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:21:43,834 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:21:43,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2023-11-29 03:22:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:25,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 03:22:25,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:22:25,671 INFO L378 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-29 03:22:26,294 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:22:26,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 03:22:26,423 INFO L378 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 15 treesize of output 1 [2023-11-29 03:22:26,701 INFO L378 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 20 treesize of output 12 [2023-11-29 03:22:28,147 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:22:28,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:22:28,459 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:22:28,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:22:28,648 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:22:28,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:22:28,867 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:22:28,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:22:28,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 03:22:28,908 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:22:28,908 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:22:33,053 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8222 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8724))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8222)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 03:22:33,076 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8222 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8724))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8222)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:22:33,103 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8723 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8222 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8723))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8724)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8222)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:22:33,131 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8723 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8222 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8723))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8724)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8222)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 03:22:33,795 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8771 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8723 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8222 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8771))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8723)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8724)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8222)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:22:33,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1734415339] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:22:33,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:22:33,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 03:22:33,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479798791] [2023-11-29 03:22:33,802 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:22:33,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 03:22:33,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:22:33,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 03:22:33,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=378, Unknown=13, NotChecked=550, Total=1056 [2023-11-29 03:22:33,803 INFO L87 Difference]: Start difference. First operand 936 states and 1061 transitions. Second operand has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 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-29 03:22:50,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:50,004 INFO L93 Difference]: Finished difference Result 1163 states and 1368 transitions. [2023-11-29 03:22:50,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 03:22:50,005 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 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) Word has length 114 [2023-11-29 03:22:50,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:50,008 INFO L225 Difference]: With dead ends: 1163 [2023-11-29 03:22:50,009 INFO L226 Difference]: Without dead ends: 1163 [2023-11-29 03:22:50,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 211 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=124, Invalid=413, Unknown=13, NotChecked=572, Total=1122 [2023-11-29 03:22:50,010 INFO L413 NwaCegarLoop]: 477 mSDtfsCounter, 504 mSDsluCounter, 3352 mSDsCounter, 0 mSdLazyCounter, 4227 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 3829 SdHoareTripleChecker+Invalid, 4232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:50,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 3829 Invalid, 4232 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5 Valid, 4227 Invalid, 0 Unknown, 0 Unchecked, 16.0s Time] [2023-11-29 03:22:50,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2023-11-29 03:22:50,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 935. [2023-11-29 03:22:50,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 583 states have (on average 1.7684391080617496) internal successors, (1031), 927 states have internal predecessors, (1031), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 03:22:50,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1060 transitions. [2023-11-29 03:22:50,030 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1060 transitions. Word has length 114 [2023-11-29 03:22:50,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:50,031 INFO L495 AbstractCegarLoop]: Abstraction has 935 states and 1060 transitions. [2023-11-29 03:22:50,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 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-29 03:22:50,031 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1060 transitions. [2023-11-29 03:22:50,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 03:22:50,032 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:50,032 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:22:50,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2023-11-29 03:22:50,242 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Ended with exit code 0 [2023-11-29 03:22:50,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:22:50,433 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:22:50,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:50,433 INFO L85 PathProgramCache]: Analyzing trace with hash 832851660, now seen corresponding path program 1 times [2023-11-29 03:22:50,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:22:50,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183419529] [2023-11-29 03:22:50,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:50,434 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-29 03:22:50,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:22:50,435 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:22:50,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-11-29 03:22:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:51,607 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 03:22:51,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:22:51,621 INFO L378 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-29 03:22:51,872 INFO L378 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-29 03:22:51,898 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:22:51,898 INFO L378 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-29 03:22:51,953 INFO L378 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 19 treesize of output 1 [2023-11-29 03:22:51,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 03:22:52,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 03:22:52,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:22:53,378 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:22:53,378 INFO L378 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 62 treesize of output 57 [2023-11-29 03:22:53,387 INFO L378 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 30 treesize of output 13 [2023-11-29 03:22:53,593 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:22:53,593 INFO L378 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 62 treesize of output 57 [2023-11-29 03:22:53,607 INFO L378 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 30 treesize of output 13 [2023-11-29 03:22:53,757 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:22:53,758 INFO L378 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 62 treesize of output 57 [2023-11-29 03:22:53,779 INFO L378 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 30 treesize of output 13 [2023-11-29 03:22:53,941 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:22:53,942 INFO L378 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 62 treesize of output 57 [2023-11-29 03:22:53,958 INFO L378 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 30 treesize of output 13 [2023-11-29 03:22:53,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 03:22:54,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:22:54,059 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:22:54,059 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:22:54,327 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:22:54,377 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-11-29 03:22:54,559 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9274) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9273))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9274) .cse2 v_ArrVal_9275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 03:22:56,897 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9271 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9271))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9272) .cse1 v_ArrVal_9274) (select (select (store .cse2 .cse1 v_ArrVal_9273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9275))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9271 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9271))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9273))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9272) .cse4 v_ArrVal_9274) .cse5 v_ArrVal_9275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 03:23:13,469 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9367 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9368))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9271))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9367) .cse1 v_ArrVal_9272) .cse2 v_ArrVal_9274) (select (select (store .cse3 .cse2 v_ArrVal_9273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9275))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9367 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9368))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9271))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9273))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9367) .cse6 v_ArrVal_9272) .cse7 v_ArrVal_9274) .cse8 v_ArrVal_9275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_9276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 03:23:13,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:23:13,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183419529] [2023-11-29 03:23:13,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183419529] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:23:13,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [692559323] [2023-11-29 03:23:13,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:23:13,507 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:23:13,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:23:13,508 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:23:13,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2023-11-29 03:23:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:23:57,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-29 03:23:57,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:23:57,700 INFO L378 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-29 03:23:59,969 INFO L378 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-29 03:24:00,100 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:24:00,100 INFO L378 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-29 03:24:00,525 INFO L378 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 11 treesize of output 7 [2023-11-29 03:24:00,608 INFO L378 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 15 treesize of output 1 [2023-11-29 03:24:01,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 03:24:01,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:24:05,605 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:24:05,606 INFO L378 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 50 treesize of output 45 [2023-11-29 03:24:05,667 INFO L378 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 24 treesize of output 11 [2023-11-29 03:24:06,643 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:24:06,643 INFO L378 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 50 treesize of output 45 [2023-11-29 03:24:06,705 INFO L378 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 24 treesize of output 11 [2023-11-29 03:24:07,328 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:24:07,329 INFO L378 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 50 treesize of output 45 [2023-11-29 03:24:07,374 INFO L378 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 24 treesize of output 11 [2023-11-29 03:24:08,071 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:24:08,071 INFO L378 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 50 treesize of output 45 [2023-11-29 03:24:08,095 INFO L378 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 24 treesize of output 11 [2023-11-29 03:24:08,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:24:08,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:24:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:24:08,242 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:24:08,428 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9873) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-11-29 03:24:08,533 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9873) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 03:24:08,847 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9871 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9870 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9871) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9871 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9870 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9870))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9871) .cse2 v_ArrVal_9872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9873) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 03:24:09,044 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9871 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9870 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9870))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9871) .cse1 v_ArrVal_9872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9873) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9871 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9870 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9871) (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-11-29 03:24:10,436 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9871 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9870 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9868 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9868))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9870))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9869) .cse0 v_ArrVal_9871) .cse1 v_ArrVal_9872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9873) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9871 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9870 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9868 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9868))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9869) .cse6 v_ArrVal_9871) (select (select (store .cse7 .cse6 v_ArrVal_9870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9872))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-29 03:24:12,057 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_9871 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9870 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9868 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9868))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9869) .cse2 v_ArrVal_9871) (select (select (store .cse3 .cse2 v_ArrVal_9870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9872))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9871 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9870 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9868 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9868))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_9870))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9869) .cse5 v_ArrVal_9871) .cse6 v_ArrVal_9872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_9873) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 03:24:19,855 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9871 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9870 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9868 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9965))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9868))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9964) .cse1 v_ArrVal_9869) .cse2 v_ArrVal_9871) (select (select (store .cse3 .cse2 v_ArrVal_9870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9872))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9871 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9870 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9868 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9965))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9868))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9870))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9964) .cse6 v_ArrVal_9869) .cse7 v_ArrVal_9871) .cse8 v_ArrVal_9872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_9873) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 03:24:19,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [692559323] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:24:19,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:24:19,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 03:24:19,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178609536] [2023-11-29 03:24:19,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:24:19,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 03:24:19,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:24:19,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 03:24:19,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=412, Unknown=24, NotChecked=636, Total=1190 [2023-11-29 03:24:19,904 INFO L87 Difference]: Start difference. First operand 935 states and 1060 transitions. Second operand has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 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-29 03:25:28,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:25:28,309 INFO L93 Difference]: Finished difference Result 1162 states and 1367 transitions. [2023-11-29 03:25:28,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 03:25:28,310 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 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) Word has length 114 [2023-11-29 03:25:28,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:25:28,313 INFO L225 Difference]: With dead ends: 1162 [2023-11-29 03:25:28,313 INFO L226 Difference]: Without dead ends: 1162 [2023-11-29 03:25:28,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 30.8s TimeCoverageRelationStatistics Valid=193, Invalid=701, Unknown=24, NotChecked=804, Total=1722 [2023-11-29 03:25:28,315 INFO L413 NwaCegarLoop]: 477 mSDtfsCounter, 972 mSDsluCounter, 1850 mSDsCounter, 0 mSdLazyCounter, 3735 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 2327 SdHoareTripleChecker+Invalid, 3757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 65.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:25:28,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 2327 Invalid, 3757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3735 Invalid, 0 Unknown, 0 Unchecked, 65.7s Time] [2023-11-29 03:25:28,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2023-11-29 03:25:28,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 934. [2023-11-29 03:25:28,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 583 states have (on average 1.7667238421955402) internal successors, (1030), 926 states have internal predecessors, (1030), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 03:25:28,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1059 transitions. [2023-11-29 03:25:28,330 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1059 transitions. Word has length 114 [2023-11-29 03:25:28,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:25:28,330 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 1059 transitions. [2023-11-29 03:25:28,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 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-29 03:25:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1059 transitions. [2023-11-29 03:25:28,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-29 03:25:28,331 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:25:28,331 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:25:28,361 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (38)] Ended with exit code 0 [2023-11-29 03:25:28,540 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Ended with exit code 0 [2023-11-29 03:25:28,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:25:28,732 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 03:25:28,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:25:28,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1507959922, now seen corresponding path program 1 times [2023-11-29 03:25:28,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:25:28,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637540634] [2023-11-29 03:25:28,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:25:28,733 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-29 03:25:28,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:25:28,734 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 03:25:28,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2023-11-29 03:25:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:25:30,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 03:25:30,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:25:30,156 INFO L378 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-29 03:25:32,175 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:25:32,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 03:25:32,474 INFO L378 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 19 treesize of output 1 [2023-11-29 03:25:33,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 03:25:41,226 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:25:41,227 INFO L378 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 44 treesize of output 43 [2023-11-29 03:25:42,323 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:25:42,323 INFO L378 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 44 treesize of output 43 [2023-11-29 03:25:43,127 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:25:43,127 INFO L378 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 44 treesize of output 43 [2023-11-29 03:25:43,933 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:25:43,933 INFO L378 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 44 treesize of output 43 [2023-11-29 03:25:44,796 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:25:44,797 INFO L378 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 44 treesize of output 43 [2023-11-29 03:25:44,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 03:25:45,562 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 03:25:45,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 03:25:46,003 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:25:46,003 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:25:47,797 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10440 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10439 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10440) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10439) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 03:25:47,925 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10440 (_ BitVec 1)) (v_ArrVal_10438 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10439 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10440) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10438))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10439)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 03:25:48,051 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10440 (_ BitVec 1)) (v_ArrVal_10438 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10439 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10440) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10438))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10439)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 03:25:48,184 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10440 (_ BitVec 1)) (v_ArrVal_10437 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10438 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10439 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10440) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10437))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10438)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10439)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 03:25:48,316 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10440 (_ BitVec 1)) (v_ArrVal_10437 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10438 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10439 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10440) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10437))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10438)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10439)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 03:25:48,456 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10440 (_ BitVec 1)) (v_ArrVal_10436 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10437 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10438 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10439 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10440) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10436))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10437)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10438)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10439)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 03:25:48,594 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10440 (_ BitVec 1)) (v_ArrVal_10436 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10437 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10438 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10439 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10440) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10436))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10437)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10438)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10439)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2023-11-29 03:25:50,774 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10440 (_ BitVec 1)) (v_ArrVal_10486 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10436 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10437 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10438 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10439 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10440) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10486))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10436)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10437)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10438)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10439)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 03:25:50,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:25:50,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637540634] [2023-11-29 03:25:50,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637540634] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:25:50,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2139546752] [2023-11-29 03:25:50,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:25:50,798 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:25:50,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:25:50,799 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:25:50,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf7a54d0-b8e8-42c1-bd2b-f4ef5d938659/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2023-11-29 03:25:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:25:58,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-29 03:25:58,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:25:58,826 INFO L378 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-29 03:26:02,722 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:26:02,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 03:26:03,453 INFO L378 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 15 treesize of output 1 [2023-11-29 03:26:05,081 INFO L378 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 20 treesize of output 12 [2023-11-29 03:26:15,112 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:26:15,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:26:16,900 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:26:16,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:26:17,980 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:26:17,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:26:19,169 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:26:19,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:26:20,355 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:26:20,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:26:20,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 03:26:21,083 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 03:26:21,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 03:26:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:26:21,186 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:26:21,872 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10440 (_ BitVec 1)) (v_ArrVal_10960 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10440) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_10960) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))))) is different from false [2023-11-29 03:26:22,025 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10440 (_ BitVec 1)) (v_ArrVal_10960 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10440) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1))))) is different from false [2023-11-29 03:26:22,149 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10440 (_ BitVec 1)) (v_ArrVal_10959 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10960 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10440) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10959))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10960)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 03:26:22,274 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10440 (_ BitVec 1)) (v_ArrVal_10959 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10960 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10440) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10959))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10960)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 03:26:22,403 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10440 (_ BitVec 1)) (v_ArrVal_10959 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10960 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10958 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10440) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10958))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10959)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10960)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 03:26:22,536 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10440 (_ BitVec 1)) (v_ArrVal_10959 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10960 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10958 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10440) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10958))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10959)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10960)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 03:26:22,680 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10440 (_ BitVec 1)) (v_ArrVal_10959 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10960 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10958 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10440) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10957))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10958)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10959)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10960)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 03:26:22,821 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10440 (_ BitVec 1)) (v_ArrVal_10959 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10960 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10958 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10440) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10957))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10958)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10959)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10960)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 03:26:25,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2139546752] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:26:25,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:26:25,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2023-11-29 03:26:25,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524275662] [2023-11-29 03:26:25,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:26:25,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 03:26:25,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:26:25,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 03:26:25,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=597, Unknown=20, NotChecked=1040, Total=1806 [2023-11-29 03:26:25,733 INFO L87 Difference]: Start difference. First operand 934 states and 1059 transitions. Second operand has 23 states, 20 states have (on average 7.0) internal successors, (140), 23 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)