./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.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_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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_e697eca7-a41d-4849-9cc2-b39859bf80ea/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 dbea62dc4a872959247118f049e63d406eb1e848bb1ed8397f1082fdec77074c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:29:49,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:29:49,438 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-28 23:29:49,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:29:49,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:29:49,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:29:49,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:29:49,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:29:49,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 23:29:49,467 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 23:29:49,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 23:29:49,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 23:29:49,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:29:49,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:29:49,469 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:29:49,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:29:49,470 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 23:29:49,471 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 23:29:49,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 23:29:49,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:29:49,472 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 23:29:49,473 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 23:29:49,473 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 23:29:49,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 23:29:49,474 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 23:29:49,475 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 23:29:49,475 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 23:29:49,475 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:29:49,476 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:29:49,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:29:49,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 23:29:49,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 23:29:49,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:29:49,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:29:49,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 23:29:49,478 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 23:29:49,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 23:29:49,478 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 23:29:49,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 23:29:49,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 23:29:49,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 23:29:49,479 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_e697eca7-a41d-4849-9cc2-b39859bf80ea/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_e697eca7-a41d-4849-9cc2-b39859bf80ea/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 -> dbea62dc4a872959247118f049e63d406eb1e848bb1ed8397f1082fdec77074c [2023-11-28 23:29:49,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:29:49,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:29:49,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:29:49,739 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:29:49,740 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:29:49,741 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i [2023-11-28 23:29:52,463 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 23:29:52,766 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 23:29:52,766 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i [2023-11-28 23:29:52,784 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/data/f0dcc6452/6ff81d1d1ca342918e5a873922fc4a35/FLAGf4384bbac [2023-11-28 23:29:52,798 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/data/f0dcc6452/6ff81d1d1ca342918e5a873922fc4a35 [2023-11-28 23:29:52,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 23:29:52,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 23:29:52,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 23:29:52,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 23:29:52,809 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 23:29:52,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:29:52" (1/1) ... [2023-11-28 23:29:52,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef70c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:29:52, skipping insertion in model container [2023-11-28 23:29:52,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:29:52" (1/1) ... [2023-11-28 23:29:52,875 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:29:53,369 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:29:53,380 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-28 23:29:53,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@27826659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:29:53, skipping insertion in model container [2023-11-28 23:29:53,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 23:29:53,381 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-28 23:29:53,383 INFO L158 Benchmark]: Toolchain (without parser) took 579.99ms. Allocated memory is still 186.6MB. Free memory was 146.5MB in the beginning and 127.1MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-28 23:29:53,384 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 186.6MB. Free memory is still 156.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:29:53,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.67ms. Allocated memory is still 186.6MB. Free memory was 145.9MB in the beginning and 127.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-28 23:29:53,386 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.16ms. Allocated memory is still 186.6MB. Free memory is still 156.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 577.67ms. Allocated memory is still 186.6MB. Free memory was 145.9MB in the beginning and 127.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. 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_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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_e697eca7-a41d-4849-9cc2-b39859bf80ea/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 dbea62dc4a872959247118f049e63d406eb1e848bb1ed8397f1082fdec77074c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:29:55,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:29:55,132 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-28 23:29:55,137 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:29:55,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:29:55,166 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:29:55,166 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:29:55,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:29:55,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 23:29:55,168 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 23:29:55,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 23:29:55,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 23:29:55,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:29:55,171 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:29:55,171 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:29:55,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:29:55,173 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 23:29:55,173 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 23:29:55,174 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 23:29:55,174 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:29:55,175 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 23:29:55,175 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 23:29:55,176 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 23:29:55,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 23:29:55,177 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 23:29:55,177 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-28 23:29:55,178 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-28 23:29:55,178 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 23:29:55,179 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 23:29:55,179 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:29:55,180 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:29:55,180 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:29:55,180 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 23:29:55,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 23:29:55,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:29:55,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:29:55,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 23:29:55,181 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-28 23:29:55,182 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-28 23:29:55,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 23:29:55,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 23:29:55,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 23:29:55,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 23:29:55,183 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-28 23:29:55,183 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_e697eca7-a41d-4849-9cc2-b39859bf80ea/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_e697eca7-a41d-4849-9cc2-b39859bf80ea/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 -> dbea62dc4a872959247118f049e63d406eb1e848bb1ed8397f1082fdec77074c [2023-11-28 23:29:55,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:29:55,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:29:55,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:29:55,470 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:29:55,470 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:29:55,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i [2023-11-28 23:29:58,281 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 23:29:58,565 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 23:29:58,565 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i [2023-11-28 23:29:58,584 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/data/778870fe4/3378a67697834d399e0a9f428e35399b/FLAG763ff639e [2023-11-28 23:29:58,599 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/data/778870fe4/3378a67697834d399e0a9f428e35399b [2023-11-28 23:29:58,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 23:29:58,603 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 23:29:58,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 23:29:58,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 23:29:58,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 23:29:58,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:29:58" (1/1) ... [2023-11-28 23:29:58,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41bb7552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:29:58, skipping insertion in model container [2023-11-28 23:29:58,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:29:58" (1/1) ... [2023-11-28 23:29:58,695 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:29:59,212 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:29:59,226 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-28 23:29:59,238 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:29:59,350 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:29:59,358 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 23:29:59,424 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:29:59,466 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:29:59,474 INFO L206 MainTranslator]: Completed translation [2023-11-28 23:29:59,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:29:59 WrapperNode [2023-11-28 23:29:59,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 23:29:59,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 23:29:59,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 23:29:59,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 23:29:59,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:29:59" (1/1) ... [2023-11-28 23:29:59,513 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:29:59" (1/1) ... [2023-11-28 23:29:59,561 INFO L138 Inliner]: procedures = 211, calls = 237, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 893 [2023-11-28 23:29:59,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 23:29:59,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 23:29:59,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 23:29:59,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 23:29:59,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:29:59" (1/1) ... [2023-11-28 23:29:59,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:29:59" (1/1) ... [2023-11-28 23:29:59,578 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:29:59" (1/1) ... [2023-11-28 23:29:59,652 INFO L175 MemorySlicer]: Split 213 memory accesses to 4 slices as follows [2, 172, 34, 5]. 81 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 47 writes are split as follows [0, 42, 4, 1]. [2023-11-28 23:29:59,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:29:59" (1/1) ... [2023-11-28 23:29:59,653 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:29:59" (1/1) ... [2023-11-28 23:29:59,697 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:29:59" (1/1) ... [2023-11-28 23:29:59,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:29:59" (1/1) ... [2023-11-28 23:29:59,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:29:59" (1/1) ... [2023-11-28 23:29:59,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:29:59" (1/1) ... [2023-11-28 23:29:59,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 23:29:59,733 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 23:29:59,733 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 23:29:59,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 23:29:59,734 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:29:59" (1/1) ... [2023-11-28 23:29:59,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:29:59,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:29:59,767 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 23:29:59,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 23:29:59,811 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-28 23:29:59,812 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-28 23:29:59,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-28 23:29:59,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-28 23:29:59,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-28 23:29:59,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-28 23:29:59,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-28 23:29:59,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-28 23:29:59,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-28 23:29:59,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-28 23:29:59,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-28 23:29:59,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-28 23:29:59,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-28 23:29:59,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-28 23:29:59,814 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-28 23:29:59,814 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-28 23:29:59,814 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-28 23:29:59,815 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-28 23:29:59,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 23:29:59,815 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-28 23:29:59,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-28 23:29:59,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-28 23:29:59,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-28 23:29:59,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-28 23:29:59,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 23:29:59,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-28 23:29:59,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-28 23:29:59,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-28 23:29:59,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-28 23:29:59,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-28 23:29:59,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-28 23:29:59,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-28 23:29:59,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-28 23:29:59,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-28 23:29:59,817 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-28 23:29:59,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-28 23:29:59,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 23:29:59,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-28 23:29:59,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-28 23:29:59,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-28 23:29:59,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-28 23:29:59,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 23:29:59,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 23:30:00,017 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 23:30:00,020 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 23:30:00,049 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-28 23:30:00,082 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-28 23:30:00,104 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-28 23:30:00,124 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-28 23:30:03,808 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 23:30:03,956 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 23:30:03,956 INFO L309 CfgBuilder]: Removed 54 assume(true) statements. [2023-11-28 23:30:03,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:30:03 BoogieIcfgContainer [2023-11-28 23:30:03,957 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 23:30:03,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 23:30:03,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 23:30:03,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 23:30:03,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:29:58" (1/3) ... [2023-11-28 23:30:03,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32dc65a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:30:03, skipping insertion in model container [2023-11-28 23:30:03,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:29:59" (2/3) ... [2023-11-28 23:30:03,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32dc65a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:30:03, skipping insertion in model container [2023-11-28 23:30:03,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:30:03" (3/3) ... [2023-11-28 23:30:03,965 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test2-1.i [2023-11-28 23:30:03,980 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 23:30:03,980 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 430 error locations. [2023-11-28 23:30:04,034 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 23:30:04,039 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;@59af60e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 23:30:04,040 INFO L358 AbstractCegarLoop]: Starting to check reachability of 430 error locations. [2023-11-28 23:30:04,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 801 states, 360 states have (on average 2.4944444444444445) internal successors, (898), 794 states have internal predecessors, (898), 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-28 23:30:04,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-28 23:30:04,051 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:30:04,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-28 23:30:04,052 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:30:04,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:30:04,057 INFO L85 PathProgramCache]: Analyzing trace with hash 47665, now seen corresponding path program 1 times [2023-11-28 23:30:04,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:30:04,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085886954] [2023-11-28 23:30:04,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:30:04,069 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-28 23:30:04,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:30:04,080 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:04,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:30:04,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:30:04,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:30:04,285 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-28 23:30:04,297 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-28 23:30:04,298 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:30:04,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:30:04,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085886954] [2023-11-28 23:30:04,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085886954] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:30:04,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:30:04,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:30:04,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278580765] [2023-11-28 23:30:04,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:30:04,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:30:04,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:30:04,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:30:04,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:30:04,355 INFO L87 Difference]: Start difference. First operand has 801 states, 360 states have (on average 2.4944444444444445) internal successors, (898), 794 states have internal predecessors, (898), 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-28 23:30:05,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:30:05,711 INFO L93 Difference]: Finished difference Result 789 states and 845 transitions. [2023-11-28 23:30:05,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:30:05,713 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-28 23:30:05,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:30:05,731 INFO L225 Difference]: With dead ends: 789 [2023-11-28 23:30:05,732 INFO L226 Difference]: Without dead ends: 788 [2023-11-28 23:30:05,733 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-28 23:30:05,736 INFO L413 NwaCegarLoop]: 442 mSDtfsCounter, 729 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-28 23:30:05,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 483 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-28 23:30:05,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2023-11-28 23:30:05,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 787. [2023-11-28 23:30:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 363 states have (on average 2.275482093663912) internal successors, (826), 780 states have internal predecessors, (826), 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-28 23:30:05,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 844 transitions. [2023-11-28 23:30:05,837 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 844 transitions. Word has length 2 [2023-11-28 23:30:05,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:30:05,837 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 844 transitions. [2023-11-28 23:30:05,838 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-28 23:30:05,838 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 844 transitions. [2023-11-28 23:30:05,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-28 23:30:05,838 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:30:05,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-28 23:30:05,845 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:06,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:06,039 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:30:06,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:30:06,040 INFO L85 PathProgramCache]: Analyzing trace with hash 47666, now seen corresponding path program 1 times [2023-11-28 23:30:06,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:30:06,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782349376] [2023-11-28 23:30:06,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:30:06,041 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-28 23:30:06,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:30:06,042 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:06,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:30:06,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:30:06,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:30:06,160 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-28 23:30:06,172 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-28 23:30:06,172 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:30:06,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:30:06,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782349376] [2023-11-28 23:30:06,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782349376] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:30:06,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:30:06,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:30:06,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733306103] [2023-11-28 23:30:06,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:30:06,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:30:06,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:30:06,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:30:06,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:30:06,176 INFO L87 Difference]: Start difference. First operand 787 states and 844 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-28 23:30:08,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:30:08,440 INFO L93 Difference]: Finished difference Result 985 states and 1074 transitions. [2023-11-28 23:30:08,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:30:08,441 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-28 23:30:08,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:30:08,447 INFO L225 Difference]: With dead ends: 985 [2023-11-28 23:30:08,447 INFO L226 Difference]: Without dead ends: 985 [2023-11-28 23:30:08,447 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-28 23:30:08,448 INFO L413 NwaCegarLoop]: 678 mSDtfsCounter, 219 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-28 23:30:08,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1080 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-28 23:30:08,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2023-11-28 23:30:08,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 899. [2023-11-28 23:30:08,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 471 states have (on average 2.21656050955414) internal successors, (1044), 892 states have internal predecessors, (1044), 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-28 23:30:08,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1072 transitions. [2023-11-28 23:30:08,484 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1072 transitions. Word has length 2 [2023-11-28 23:30:08,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:30:08,485 INFO L495 AbstractCegarLoop]: Abstraction has 899 states and 1072 transitions. [2023-11-28 23:30:08,485 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-28 23:30:08,485 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1072 transitions. [2023-11-28 23:30:08,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-28 23:30:08,485 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:30:08,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-28 23:30:08,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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)] Forceful destruction successful, exit code 0 [2023-11-28 23:30:08,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:08,686 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:30:08,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:30:08,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1070701435, now seen corresponding path program 1 times [2023-11-28 23:30:08,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:30:08,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012150474] [2023-11-28 23:30:08,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:30:08,688 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-28 23:30:08,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:30:08,689 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:08,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:30:08,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-28 23:30:08,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:30:08,834 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-28 23:30:08,841 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-28 23:30:08,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:30:08,911 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-28 23:30:08,932 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 23:30:08,932 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-28 23:30:08,954 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-28 23:30:08,954 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:30:08,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:30:08,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012150474] [2023-11-28 23:30:08,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012150474] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:30:08,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:30:08,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:30:08,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270715919] [2023-11-28 23:30:08,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:30:08,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:30:08,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:30:08,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:30:08,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:30:08,957 INFO L87 Difference]: Start difference. First operand 899 states and 1072 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-28 23:30:11,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:30:11,079 INFO L93 Difference]: Finished difference Result 889 states and 1061 transitions. [2023-11-28 23:30:11,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:30:11,080 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-28 23:30:11,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:30:11,083 INFO L225 Difference]: With dead ends: 889 [2023-11-28 23:30:11,083 INFO L226 Difference]: Without dead ends: 889 [2023-11-28 23:30:11,084 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-28 23:30:11,085 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 794 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:30:11,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 257 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-28 23:30:11,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2023-11-28 23:30:11,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 776. [2023-11-28 23:30:11,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 363 states have (on average 2.242424242424242) internal successors, (814), 769 states have internal predecessors, (814), 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-28 23:30:11,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 832 transitions. [2023-11-28 23:30:11,106 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 832 transitions. Word has length 6 [2023-11-28 23:30:11,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:30:11,107 INFO L495 AbstractCegarLoop]: Abstraction has 776 states and 832 transitions. [2023-11-28 23:30:11,107 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-28 23:30:11,107 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 832 transitions. [2023-11-28 23:30:11,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-28 23:30:11,107 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:30:11,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:30:11,110 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:11,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:11,308 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:30:11,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:30:11,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1167993873, now seen corresponding path program 1 times [2023-11-28 23:30:11,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:30:11,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249325707] [2023-11-28 23:30:11,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:30:11,309 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-28 23:30:11,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:30:11,310 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:11,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:30:11,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:30:11,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:30:11,441 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-28 23:30:11,456 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-28 23:30:11,457 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:30:11,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:30:11,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1249325707] [2023-11-28 23:30:11,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1249325707] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:30:11,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:30:11,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:30:11,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181680545] [2023-11-28 23:30:11,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:30:11,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:30:11,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:30:11,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:30:11,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:30:11,459 INFO L87 Difference]: Start difference. First operand 776 states and 832 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-28 23:30:13,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:30:13,209 INFO L93 Difference]: Finished difference Result 929 states and 1017 transitions. [2023-11-28 23:30:13,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:30:13,211 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-28 23:30:13,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:30:13,216 INFO L225 Difference]: With dead ends: 929 [2023-11-28 23:30:13,216 INFO L226 Difference]: Without dead ends: 929 [2023-11-28 23:30:13,217 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-28 23:30:13,218 INFO L413 NwaCegarLoop]: 567 mSDtfsCounter, 732 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-28 23:30:13,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 722 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-28 23:30:13,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2023-11-28 23:30:13,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 729. [2023-11-28 23:30:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 363 states have (on average 2.112947658402204) internal successors, (767), 722 states have internal predecessors, (767), 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-28 23:30:13,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 785 transitions. [2023-11-28 23:30:13,242 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 785 transitions. Word has length 7 [2023-11-28 23:30:13,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:30:13,242 INFO L495 AbstractCegarLoop]: Abstraction has 729 states and 785 transitions. [2023-11-28 23:30:13,242 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-28 23:30:13,242 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 785 transitions. [2023-11-28 23:30:13,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-28 23:30:13,243 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:30:13,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:30:13,245 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:13,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:13,446 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:30:13,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:30:13,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1167993872, now seen corresponding path program 1 times [2023-11-28 23:30:13,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:30:13,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808834786] [2023-11-28 23:30:13,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:30:13,447 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-28 23:30:13,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:30:13,448 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:13,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:30:13,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:30:13,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:30:13,571 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-28 23:30:13,596 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-28 23:30:13,596 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:30:13,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:30:13,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808834786] [2023-11-28 23:30:13,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808834786] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:30:13,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:30:13,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:30:13,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425032300] [2023-11-28 23:30:13,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:30:13,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:30:13,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:30:13,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:30:13,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:30:13,599 INFO L87 Difference]: Start difference. First operand 729 states and 785 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-28 23:30:15,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:30:15,872 INFO L93 Difference]: Finished difference Result 989 states and 1079 transitions. [2023-11-28 23:30:15,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:30:15,874 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-28 23:30:15,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:30:15,878 INFO L225 Difference]: With dead ends: 989 [2023-11-28 23:30:15,878 INFO L226 Difference]: Without dead ends: 989 [2023-11-28 23:30:15,878 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-28 23:30:15,878 INFO L413 NwaCegarLoop]: 727 mSDtfsCounter, 452 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-28 23:30:15,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1005 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-28 23:30:15,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2023-11-28 23:30:15,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 742. [2023-11-28 23:30:15,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 386 states have (on average 2.1088082901554404) internal successors, (814), 735 states have internal predecessors, (814), 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-28 23:30:15,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 832 transitions. [2023-11-28 23:30:15,897 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 832 transitions. Word has length 7 [2023-11-28 23:30:15,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:30:15,897 INFO L495 AbstractCegarLoop]: Abstraction has 742 states and 832 transitions. [2023-11-28 23:30:15,897 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-28 23:30:15,897 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 832 transitions. [2023-11-28 23:30:15,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-28 23:30:15,898 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:30:15,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:30:15,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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)] Forceful destruction successful, exit code 0 [2023-11-28 23:30:16,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:16,100 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr428ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:30:16,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:30:16,101 INFO L85 PathProgramCache]: Analyzing trace with hash -648164610, now seen corresponding path program 1 times [2023-11-28 23:30:16,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:30:16,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693816032] [2023-11-28 23:30:16,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:30:16,101 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-28 23:30:16,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:30:16,102 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:16,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:30:16,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 23:30:16,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:30:16,242 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 23:30:16,243 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 23:30:16,243 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 23:30:16,247 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-28 23:30:16,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 23:30:16,296 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-28 23:30:16,312 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-28 23:30:16,312 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:30:16,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:30:16,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693816032] [2023-11-28 23:30:16,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693816032] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:30:16,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:30:16,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:30:16,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370400701] [2023-11-28 23:30:16,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:30:16,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:30:16,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:30:16,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:30:16,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:30:16,315 INFO L87 Difference]: Start difference. First operand 742 states and 832 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-28 23:30:18,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:30:18,103 INFO L93 Difference]: Finished difference Result 1468 states and 1649 transitions. [2023-11-28 23:30:18,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:30:18,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2023-11-28 23:30:18,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:30:18,111 INFO L225 Difference]: With dead ends: 1468 [2023-11-28 23:30:18,111 INFO L226 Difference]: Without dead ends: 1468 [2023-11-28 23:30:18,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-28 23:30:18,111 INFO L413 NwaCegarLoop]: 841 mSDtfsCounter, 732 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 2330 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-28 23:30:18,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 2330 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-28 23:30:18,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2023-11-28 23:30:18,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 744. [2023-11-28 23:30:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 388 states have (on average 2.1030927835051547) internal successors, (816), 737 states have internal predecessors, (816), 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-28 23:30:18,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 834 transitions. [2023-11-28 23:30:18,131 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 834 transitions. Word has length 9 [2023-11-28 23:30:18,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:30:18,132 INFO L495 AbstractCegarLoop]: Abstraction has 744 states and 834 transitions. [2023-11-28 23:30:18,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-28 23:30:18,132 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 834 transitions. [2023-11-28 23:30:18,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-28 23:30:18,132 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:30:18,133 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:30:18,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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)] Forceful destruction successful, exit code 0 [2023-11-28 23:30:18,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:18,333 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:30:18,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:30:18,334 INFO L85 PathProgramCache]: Analyzing trace with hash -305951994, now seen corresponding path program 1 times [2023-11-28 23:30:18,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:30:18,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40981447] [2023-11-28 23:30:18,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:30:18,334 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-28 23:30:18,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:30:18,335 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:18,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:30:18,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-28 23:30:18,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:30:18,481 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-28 23:30:18,481 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:30:18,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:30:18,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40981447] [2023-11-28 23:30:18,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40981447] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:30:18,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:30:18,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:30:18,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773120294] [2023-11-28 23:30:18,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:30:18,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:30:18,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:30:18,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:30:18,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:30:18,483 INFO L87 Difference]: Start difference. First operand 744 states and 834 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-28 23:30:19,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:30:19,162 INFO L93 Difference]: Finished difference Result 705 states and 794 transitions. [2023-11-28 23:30:19,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:30:19,164 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-28 23:30:19,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:30:19,167 INFO L225 Difference]: With dead ends: 705 [2023-11-28 23:30:19,167 INFO L226 Difference]: Without dead ends: 705 [2023-11-28 23:30:19,167 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-28 23:30:19,168 INFO L413 NwaCegarLoop]: 629 mSDtfsCounter, 70 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-28 23:30:19,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1209 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-28 23:30:19,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2023-11-28 23:30:19,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2023-11-28 23:30:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 373 states have (on average 2.0804289544235925) internal successors, (776), 698 states have internal predecessors, (776), 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-28 23:30:19,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 794 transitions. [2023-11-28 23:30:19,192 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 794 transitions. Word has length 15 [2023-11-28 23:30:19,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:30:19,192 INFO L495 AbstractCegarLoop]: Abstraction has 705 states and 794 transitions. [2023-11-28 23:30:19,193 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-28 23:30:19,193 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 794 transitions. [2023-11-28 23:30:19,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-28 23:30:19,193 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:30:19,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:30:19,197 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:19,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:19,394 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:30:19,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:30:19,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1962092576, now seen corresponding path program 1 times [2023-11-28 23:30:19,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:30:19,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1933573598] [2023-11-28 23:30:19,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:30:19,395 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-28 23:30:19,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:30:19,396 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:19,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:30:19,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:30:19,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:30:19,543 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-28 23:30:19,543 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:30:19,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:30:19,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1933573598] [2023-11-28 23:30:19,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1933573598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:30:19,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:30:19,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:30:19,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169357935] [2023-11-28 23:30:19,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:30:19,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:30:19,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:30:19,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:30:19,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:30:19,545 INFO L87 Difference]: Start difference. First operand 705 states and 794 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-28 23:30:20,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:30:20,356 INFO L93 Difference]: Finished difference Result 691 states and 773 transitions. [2023-11-28 23:30:20,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:30:20,358 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-28 23:30:20,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:30:20,361 INFO L225 Difference]: With dead ends: 691 [2023-11-28 23:30:20,361 INFO L226 Difference]: Without dead ends: 691 [2023-11-28 23:30:20,361 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-28 23:30:20,362 INFO L413 NwaCegarLoop]: 598 mSDtfsCounter, 58 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1770 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-28 23:30:20,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1770 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-28 23:30:20,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2023-11-28 23:30:20,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 690. [2023-11-28 23:30:20,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 372 states have (on average 2.0268817204301075) internal successors, (754), 683 states have internal predecessors, (754), 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-28 23:30:20,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 772 transitions. [2023-11-28 23:30:20,372 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 772 transitions. Word has length 17 [2023-11-28 23:30:20,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:30:20,373 INFO L495 AbstractCegarLoop]: Abstraction has 690 states and 772 transitions. [2023-11-28 23:30:20,373 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-28 23:30:20,373 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 772 transitions. [2023-11-28 23:30:20,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-28 23:30:20,373 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:30:20,374 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-28 23:30:20,377 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:20,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:20,574 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:30:20,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:30:20,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1060196302, now seen corresponding path program 1 times [2023-11-28 23:30:20,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:30:20,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [412555625] [2023-11-28 23:30:20,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:30:20,575 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-28 23:30:20,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:30:20,576 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:20,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:30:20,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:30:20,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:30:20,740 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-28 23:30:20,805 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-28 23:30:20,805 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:30:20,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:30:20,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [412555625] [2023-11-28 23:30:20,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [412555625] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:30:20,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:30:20,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:30:20,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936868105] [2023-11-28 23:30:20,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:30:20,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:30:20,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:30:20,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:30:20,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:30:20,807 INFO L87 Difference]: Start difference. First operand 690 states and 772 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-28 23:30:22,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:30:22,572 INFO L93 Difference]: Finished difference Result 886 states and 1000 transitions. [2023-11-28 23:30:22,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:30:22,573 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-28 23:30:22,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:30:22,577 INFO L225 Difference]: With dead ends: 886 [2023-11-28 23:30:22,578 INFO L226 Difference]: Without dead ends: 886 [2023-11-28 23:30:22,578 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-28 23:30:22,578 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 665 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-28 23:30:22,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 750 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-28 23:30:22,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2023-11-28 23:30:22,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 686. [2023-11-28 23:30:22,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 372 states have (on average 2.0161290322580645) internal successors, (750), 679 states have internal predecessors, (750), 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-28 23:30:22,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 768 transitions. [2023-11-28 23:30:22,593 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 768 transitions. Word has length 31 [2023-11-28 23:30:22,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:30:22,593 INFO L495 AbstractCegarLoop]: Abstraction has 686 states and 768 transitions. [2023-11-28 23:30:22,593 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-28 23:30:22,593 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 768 transitions. [2023-11-28 23:30:22,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-28 23:30:22,594 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:30:22,594 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-28 23:30:22,598 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:22,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:22,795 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:30:22,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:30:22,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1060196303, now seen corresponding path program 1 times [2023-11-28 23:30:22,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:30:22,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810377956] [2023-11-28 23:30:22,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:30:22,796 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-28 23:30:22,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:30:22,797 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:22,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:30:22,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 23:30:22,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:30:23,000 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-28 23:30:23,184 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-28 23:30:23,185 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:30:23,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:30:23,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810377956] [2023-11-28 23:30:23,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810377956] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:30:23,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:30:23,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:30:23,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771206817] [2023-11-28 23:30:23,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:30:23,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:30:23,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:30:23,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:30:23,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:30:23,186 INFO L87 Difference]: Start difference. First operand 686 states and 768 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-28 23:30:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:30:25,761 INFO L93 Difference]: Finished difference Result 929 states and 1011 transitions. [2023-11-28 23:30:25,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:30:25,762 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-28 23:30:25,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:30:25,766 INFO L225 Difference]: With dead ends: 929 [2023-11-28 23:30:25,767 INFO L226 Difference]: Without dead ends: 929 [2023-11-28 23:30:25,767 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-28 23:30:25,767 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 387 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-28 23:30:25,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 1046 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-28 23:30:25,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2023-11-28 23:30:25,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 682. [2023-11-28 23:30:25,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 372 states have (on average 2.0053763440860215) internal successors, (746), 675 states have internal predecessors, (746), 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-28 23:30:25,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 764 transitions. [2023-11-28 23:30:25,782 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 764 transitions. Word has length 31 [2023-11-28 23:30:25,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:30:25,783 INFO L495 AbstractCegarLoop]: Abstraction has 682 states and 764 transitions. [2023-11-28 23:30:25,783 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-28 23:30:25,783 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 764 transitions. [2023-11-28 23:30:25,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-28 23:30:25,784 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:30:25,785 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] [2023-11-28 23:30:25,788 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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)] Ended with exit code 0 [2023-11-28 23:30:25,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:25,985 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:30:25,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:30:25,986 INFO L85 PathProgramCache]: Analyzing trace with hash 319790408, now seen corresponding path program 1 times [2023-11-28 23:30:25,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:30:25,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328917663] [2023-11-28 23:30:25,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:30:25,986 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-28 23:30:25,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:30:25,987 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:25,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:30:26,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:30:26,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:30:26,218 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-28 23:30:26,218 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:30:26,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:30:26,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328917663] [2023-11-28 23:30:26,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328917663] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:30:26,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:30:26,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:30:26,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755207308] [2023-11-28 23:30:26,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:30:26,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:30:26,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:30:26,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:30:26,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:30:26,220 INFO L87 Difference]: Start difference. First operand 682 states and 764 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-28 23:30:26,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:30:26,985 INFO L93 Difference]: Finished difference Result 676 states and 754 transitions. [2023-11-28 23:30:26,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:30:26,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2023-11-28 23:30:26,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:30:26,990 INFO L225 Difference]: With dead ends: 676 [2023-11-28 23:30:26,990 INFO L226 Difference]: Without dead ends: 676 [2023-11-28 23:30:26,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-28 23:30:26,991 INFO L413 NwaCegarLoop]: 592 mSDtfsCounter, 23 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-28 23:30:26,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1756 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-28 23:30:26,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2023-11-28 23:30:26,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 676. [2023-11-28 23:30:27,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 366 states have (on average 2.010928961748634) internal successors, (736), 669 states have internal predecessors, (736), 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-28 23:30:27,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 754 transitions. [2023-11-28 23:30:27,002 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 754 transitions. Word has length 47 [2023-11-28 23:30:27,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:30:27,002 INFO L495 AbstractCegarLoop]: Abstraction has 676 states and 754 transitions. [2023-11-28 23:30:27,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-28 23:30:27,003 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 754 transitions. [2023-11-28 23:30:27,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-28 23:30:27,004 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:30:27,004 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] [2023-11-28 23:30:27,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:27,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:27,209 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:30:27,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:30:27,210 INFO L85 PathProgramCache]: Analyzing trace with hash 193945193, now seen corresponding path program 1 times [2023-11-28 23:30:27,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:30:27,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847005307] [2023-11-28 23:30:27,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:30:27,211 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-28 23:30:27,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:30:27,211 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:27,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:30:27,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:30:27,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:30:27,697 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-28 23:30:27,698 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:30:27,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:30:27,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847005307] [2023-11-28 23:30:27,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847005307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:30:27,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:30:27,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:30:27,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353237289] [2023-11-28 23:30:27,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:30:27,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:30:27,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:30:27,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:30:27,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:30:27,700 INFO L87 Difference]: Start difference. First operand 676 states and 754 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:30:28,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:30:28,512 INFO L93 Difference]: Finished difference Result 857 states and 958 transitions. [2023-11-28 23:30:28,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:30:28,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-11-28 23:30:28,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:30:28,517 INFO L225 Difference]: With dead ends: 857 [2023-11-28 23:30:28,517 INFO L226 Difference]: Without dead ends: 857 [2023-11-28 23:30:28,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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-28 23:30:28,518 INFO L413 NwaCegarLoop]: 716 mSDtfsCounter, 205 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-28 23:30:28,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1227 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-28 23:30:28,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2023-11-28 23:30:28,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 803. [2023-11-28 23:30:28,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 488 states have (on average 1.8995901639344261) internal successors, (927), 796 states have internal predecessors, (927), 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-28 23:30:28,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 955 transitions. [2023-11-28 23:30:28,536 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 955 transitions. Word has length 51 [2023-11-28 23:30:28,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:30:28,536 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 955 transitions. [2023-11-28 23:30:28,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:30:28,536 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 955 transitions. [2023-11-28 23:30:28,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-28 23:30:28,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:30:28,537 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-28 23:30:28,543 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:28,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:28,743 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:30:28,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:30:28,744 INFO L85 PathProgramCache]: Analyzing trace with hash 982802402, now seen corresponding path program 1 times [2023-11-28 23:30:28,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:30:28,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792502942] [2023-11-28 23:30:28,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:30:28,744 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-28 23:30:28,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:30:28,745 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:28,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:30:29,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-28 23:30:29,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:30:29,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-28 23:30:29,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-28 23:30:29,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:30:29,478 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-28 23:30:29,491 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 23:30:29,491 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-28 23:30:29,506 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-28 23:30:29,506 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:30:29,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:30:29,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792502942] [2023-11-28 23:30:29,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792502942] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:30:29,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:30:29,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:30:29,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113784447] [2023-11-28 23:30:29,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:30:29,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:30:29,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:30:29,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:30:29,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:30:29,509 INFO L87 Difference]: Start difference. First operand 803 states and 955 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-28 23:30:31,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:30:31,583 INFO L93 Difference]: Finished difference Result 1046 states and 1304 transitions. [2023-11-28 23:30:31,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:30:31,584 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-28 23:30:31,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:30:31,589 INFO L225 Difference]: With dead ends: 1046 [2023-11-28 23:30:31,589 INFO L226 Difference]: Without dead ends: 1046 [2023-11-28 23:30:31,590 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-28 23:30:31,590 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 1354 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1367 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-28 23:30:31,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1367 Valid, 295 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-28 23:30:31,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2023-11-28 23:30:31,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 742. [2023-11-28 23:30:31,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 465 states have (on average 1.789247311827957) internal successors, (832), 735 states have internal predecessors, (832), 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-28 23:30:31,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 860 transitions. [2023-11-28 23:30:31,604 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 860 transitions. Word has length 54 [2023-11-28 23:30:31,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:30:31,604 INFO L495 AbstractCegarLoop]: Abstraction has 742 states and 860 transitions. [2023-11-28 23:30:31,605 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-28 23:30:31,605 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 860 transitions. [2023-11-28 23:30:31,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-28 23:30:31,606 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:30:31,606 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-28 23:30:31,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:31,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:31,813 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:30:31,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:30:31,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1507704915, now seen corresponding path program 1 times [2023-11-28 23:30:31,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:30:31,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013721874] [2023-11-28 23:30:31,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:30:31,814 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-28 23:30:31,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:30:31,816 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:31,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:30:32,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 23:30:32,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:30:32,084 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-28 23:30:32,098 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-28 23:30:32,126 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-28 23:30:32,136 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-28 23:30:32,137 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:30:32,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:30:32,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013721874] [2023-11-28 23:30:32,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013721874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:30:32,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:30:32,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:30:32,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170977551] [2023-11-28 23:30:32,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:30:32,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:30:32,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:30:32,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:30:32,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:30:32,139 INFO L87 Difference]: Start difference. First operand 742 states and 860 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-28 23:30:34,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:30:34,206 INFO L93 Difference]: Finished difference Result 741 states and 859 transitions. [2023-11-28 23:30:34,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:30:34,207 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-28 23:30:34,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:30:34,211 INFO L225 Difference]: With dead ends: 741 [2023-11-28 23:30:34,211 INFO L226 Difference]: Without dead ends: 741 [2023-11-28 23:30:34,211 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-28 23:30:34,212 INFO L413 NwaCegarLoop]: 566 mSDtfsCounter, 3 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-28 23:30:34,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1508 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-28 23:30:34,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2023-11-28 23:30:34,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2023-11-28 23:30:34,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 465 states have (on average 1.7870967741935484) internal successors, (831), 734 states have internal predecessors, (831), 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-28 23:30:34,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 859 transitions. [2023-11-28 23:30:34,222 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 859 transitions. Word has length 58 [2023-11-28 23:30:34,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:30:34,222 INFO L495 AbstractCegarLoop]: Abstraction has 741 states and 859 transitions. [2023-11-28 23:30:34,222 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-28 23:30:34,222 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 859 transitions. [2023-11-28 23:30:34,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-28 23:30:34,223 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:30:34,223 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-28 23:30:34,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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)] Forceful destruction successful, exit code 0 [2023-11-28 23:30:34,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:34,423 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:30:34,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:30:34,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1507704916, now seen corresponding path program 1 times [2023-11-28 23:30:34,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:30:34,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1646840784] [2023-11-28 23:30:34,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:30:34,424 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-28 23:30:34,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:30:34,425 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:34,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:30:34,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-28 23:30:34,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:30:34,691 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-28 23:30:34,711 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-28 23:30:34,720 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-28 23:30:34,756 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-28 23:30:34,774 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-28 23:30:34,774 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:30:34,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:30:34,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1646840784] [2023-11-28 23:30:34,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1646840784] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:30:34,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:30:34,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:30:34,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565938978] [2023-11-28 23:30:34,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:30:34,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:30:34,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:30:34,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:30:34,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:30:34,776 INFO L87 Difference]: Start difference. First operand 741 states and 859 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-28 23:30:37,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:30:37,385 INFO L93 Difference]: Finished difference Result 740 states and 858 transitions. [2023-11-28 23:30:37,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:30:37,387 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-28 23:30:37,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:30:37,390 INFO L225 Difference]: With dead ends: 740 [2023-11-28 23:30:37,390 INFO L226 Difference]: Without dead ends: 740 [2023-11-28 23:30:37,390 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-28 23:30:37,391 INFO L413 NwaCegarLoop]: 566 mSDtfsCounter, 1 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-28 23:30:37,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1528 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-28 23:30:37,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2023-11-28 23:30:37,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2023-11-28 23:30:37,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 464 states have (on average 1.7887931034482758) internal successors, (830), 733 states have internal predecessors, (830), 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-28 23:30:37,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 858 transitions. [2023-11-28 23:30:37,402 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 858 transitions. Word has length 58 [2023-11-28 23:30:37,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:30:37,402 INFO L495 AbstractCegarLoop]: Abstraction has 740 states and 858 transitions. [2023-11-28 23:30:37,402 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-28 23:30:37,402 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 858 transitions. [2023-11-28 23:30:37,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-28 23:30:37,403 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:30:37,403 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-28 23:30:37,408 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:37,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:37,603 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:30:37,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:30:37,604 INFO L85 PathProgramCache]: Analyzing trace with hash -590566217, now seen corresponding path program 1 times [2023-11-28 23:30:37,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:30:37,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919839534] [2023-11-28 23:30:37,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:30:37,604 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-28 23:30:37,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:30:37,605 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:37,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:30:37,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:30:37,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:30:37,860 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-28 23:30:37,860 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:30:37,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:30:37,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919839534] [2023-11-28 23:30:37,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919839534] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:30:37,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:30:37,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:30:37,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088626032] [2023-11-28 23:30:37,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:30:37,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:30:37,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:30:37,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:30:37,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:30:37,862 INFO L87 Difference]: Start difference. First operand 740 states and 858 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-28 23:30:38,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:30:38,613 INFO L93 Difference]: Finished difference Result 742 states and 861 transitions. [2023-11-28 23:30:38,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:30:38,614 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-28 23:30:38,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:30:38,618 INFO L225 Difference]: With dead ends: 742 [2023-11-28 23:30:38,618 INFO L226 Difference]: Without dead ends: 742 [2023-11-28 23:30:38,618 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-28 23:30:38,619 INFO L413 NwaCegarLoop]: 566 mSDtfsCounter, 1 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-28 23:30:38,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1695 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-28 23:30:38,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2023-11-28 23:30:38,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2023-11-28 23:30:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 465 states have (on average 1.789247311827957) internal successors, (832), 735 states have internal predecessors, (832), 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-28 23:30:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 861 transitions. [2023-11-28 23:30:38,635 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 861 transitions. Word has length 64 [2023-11-28 23:30:38,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:30:38,636 INFO L495 AbstractCegarLoop]: Abstraction has 742 states and 861 transitions. [2023-11-28 23:30:38,636 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-28 23:30:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 861 transitions. [2023-11-28 23:30:38,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-28 23:30:38,637 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:30:38,637 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-28 23:30:38,642 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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)] Forceful destruction successful, exit code 0 [2023-11-28 23:30:38,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:38,837 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:30:38,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:30:38,838 INFO L85 PathProgramCache]: Analyzing trace with hash 73834601, now seen corresponding path program 1 times [2023-11-28 23:30:38,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:30:38,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812929086] [2023-11-28 23:30:38,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:30:38,838 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-28 23:30:38,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:30:38,839 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:38,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:30:39,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:30:39,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:30:39,164 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-28 23:30:39,164 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:30:39,229 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-28 23:30:39,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:30:39,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812929086] [2023-11-28 23:30:39,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812929086] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:30:39,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:30:39,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-28 23:30:39,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824704557] [2023-11-28 23:30:39,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:30:39,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 23:30:39,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:30:39,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 23:30:39,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-28 23:30:39,232 INFO L87 Difference]: Start difference. First operand 742 states and 861 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-28 23:30:40,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:30:40,405 INFO L93 Difference]: Finished difference Result 751 states and 875 transitions. [2023-11-28 23:30:40,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 23:30:40,405 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-28 23:30:40,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:30:40,410 INFO L225 Difference]: With dead ends: 751 [2023-11-28 23:30:40,410 INFO L226 Difference]: Without dead ends: 751 [2023-11-28 23:30:40,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-11-28 23:30:40,410 INFO L413 NwaCegarLoop]: 565 mSDtfsCounter, 6 mSDsluCounter, 2253 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2818 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:30:40,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2818 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-28 23:30:40,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2023-11-28 23:30:40,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 750. [2023-11-28 23:30:40,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 472 states have (on average 1.7902542372881356) internal successors, (845), 742 states have internal predecessors, (845), 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-28 23:30:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 874 transitions. [2023-11-28 23:30:40,424 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 874 transitions. Word has length 65 [2023-11-28 23:30:40,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:30:40,425 INFO L495 AbstractCegarLoop]: Abstraction has 750 states and 874 transitions. [2023-11-28 23:30:40,425 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-28 23:30:40,425 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 874 transitions. [2023-11-28 23:30:40,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-28 23:30:40,426 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:30:40,426 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-28 23:30:40,432 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:40,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:40,626 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:30:40,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:30:40,627 INFO L85 PathProgramCache]: Analyzing trace with hash -310048457, now seen corresponding path program 2 times [2023-11-28 23:30:40,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:30:40,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830966347] [2023-11-28 23:30:40,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 23:30:40,628 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-28 23:30:40,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:30:40,628 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:40,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:41,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 23:30:41,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:30:41,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-28 23:30:41,046 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:30:41,091 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-28 23:30:41,091 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:30:41,223 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-28 23:30:41,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:30:41,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830966347] [2023-11-28 23:30:41,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830966347] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:30:41,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:30:41,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-28 23:30:41,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778968060] [2023-11-28 23:30:41,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:30:41,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-28 23:30:41,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:30:41,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-28 23:30:41,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-28 23:30:41,225 INFO L87 Difference]: Start difference. First operand 750 states and 874 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-28 23:30:43,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:30:43,048 INFO L93 Difference]: Finished difference Result 765 states and 896 transitions. [2023-11-28 23:30:43,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-28 23:30:43,049 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-28 23:30:43,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:30:43,053 INFO L225 Difference]: With dead ends: 765 [2023-11-28 23:30:43,053 INFO L226 Difference]: Without dead ends: 763 [2023-11-28 23:30:43,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-28 23:30:43,053 INFO L413 NwaCegarLoop]: 565 mSDtfsCounter, 13 mSDsluCounter, 2820 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3385 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-28 23:30:43,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3385 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-28 23:30:43,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2023-11-28 23:30:43,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 759. [2023-11-28 23:30:43,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 481 states have (on average 1.7817047817047817) internal successors, (857), 751 states have internal predecessors, (857), 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-28 23:30:43,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 886 transitions. [2023-11-28 23:30:43,069 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 886 transitions. Word has length 68 [2023-11-28 23:30:43,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:30:43,069 INFO L495 AbstractCegarLoop]: Abstraction has 759 states and 886 transitions. [2023-11-28 23:30:43,069 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-28 23:30:43,069 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 886 transitions. [2023-11-28 23:30:43,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-28 23:30:43,070 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:30:43,070 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-28 23:30:43,076 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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)] Ended with exit code 0 [2023-11-28 23:30:43,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:43,270 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:30:43,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:30:43,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1799314423, now seen corresponding path program 3 times [2023-11-28 23:30:43,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:30:43,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696756617] [2023-11-28 23:30:43,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-28 23:30:43,271 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-28 23:30:43,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:30:43,272 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:43,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:43,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-28 23:30:43,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:30:43,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-28 23:30:43,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:30:44,100 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-28 23:30:44,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:30:44,697 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-28 23:30:44,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:30:44,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696756617] [2023-11-28 23:30:44,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696756617] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:30:44,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:30:44,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-28 23:30:44,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242006292] [2023-11-28 23:30:44,698 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:30:44,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-28 23:30:44,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:30:44,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-28 23:30:44,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-28 23:30:44,699 INFO L87 Difference]: Start difference. First operand 759 states and 886 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-28 23:30:49,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:30:49,454 INFO L93 Difference]: Finished difference Result 789 states and 936 transitions. [2023-11-28 23:30:49,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-28 23:30:49,455 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-28 23:30:49,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:30:49,458 INFO L225 Difference]: With dead ends: 789 [2023-11-28 23:30:49,458 INFO L226 Difference]: Without dead ends: 786 [2023-11-28 23:30:49,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-28 23:30:49,460 INFO L413 NwaCegarLoop]: 564 mSDtfsCounter, 24 mSDsluCounter, 6191 mSDsCounter, 0 mSdLazyCounter, 1624 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 6755 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-28 23:30:49,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 6755 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1624 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-11-28 23:30:49,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2023-11-28 23:30:49,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 777. [2023-11-28 23:30:49,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 499 states have (on average 1.7635270541082164) internal successors, (880), 769 states have internal predecessors, (880), 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-28 23:30:49,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 909 transitions. [2023-11-28 23:30:49,474 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 909 transitions. Word has length 74 [2023-11-28 23:30:49,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:30:49,475 INFO L495 AbstractCegarLoop]: Abstraction has 777 states and 909 transitions. [2023-11-28 23:30:49,475 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-28 23:30:49,475 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 909 transitions. [2023-11-28 23:30:49,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-28 23:30:49,476 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:30:49,476 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-28 23:30:49,481 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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)] Ended with exit code 0 [2023-11-28 23:30:49,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:49,676 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:30:49,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:30:49,677 INFO L85 PathProgramCache]: Analyzing trace with hash 842322295, now seen corresponding path program 4 times [2023-11-28 23:30:49,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:30:49,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51554303] [2023-11-28 23:30:49,677 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-28 23:30:49,677 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-28 23:30:49,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:30:49,678 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:49,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:30:50,017 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-28 23:30:50,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:30:50,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-28 23:30:50,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:30:50,364 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-28 23:30:50,364 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:30:51,937 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-28 23:30:51,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:30:51,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51554303] [2023-11-28 23:30:51,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51554303] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:30:51,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:30:51,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-28 23:30:51,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619283417] [2023-11-28 23:30:51,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:30:51,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-28 23:30:51,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:30:51,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-28 23:30:51,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-28 23:30:51,940 INFO L87 Difference]: Start difference. First operand 777 states and 909 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-28 23:31:04,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:31:04,025 INFO L93 Difference]: Finished difference Result 834 states and 998 transitions. [2023-11-28 23:31:04,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-28 23:31:04,026 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-28 23:31:04,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:31:04,030 INFO L225 Difference]: With dead ends: 834 [2023-11-28 23:31:04,031 INFO L226 Difference]: Without dead ends: 832 [2023-11-28 23:31:04,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-28 23:31:04,035 INFO L413 NwaCegarLoop]: 565 mSDtfsCounter, 47 mSDsluCounter, 12972 mSDsCounter, 0 mSdLazyCounter, 4260 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 13537 SdHoareTripleChecker+Invalid, 4334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 4260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2023-11-28 23:31:04,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 13537 Invalid, 4334 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [74 Valid, 4260 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2023-11-28 23:31:04,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2023-11-28 23:31:04,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 811. [2023-11-28 23:31:04,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 533 states have (on average 1.7373358348968104) internal successors, (926), 803 states have internal predecessors, (926), 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-28 23:31:04,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 955 transitions. [2023-11-28 23:31:04,055 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 955 transitions. Word has length 86 [2023-11-28 23:31:04,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:31:04,055 INFO L495 AbstractCegarLoop]: Abstraction has 811 states and 955 transitions. [2023-11-28 23:31:04,055 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-28 23:31:04,055 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 955 transitions. [2023-11-28 23:31:04,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-28 23:31:04,056 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:31:04,056 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-28 23:31:04,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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)] Forceful destruction successful, exit code 0 [2023-11-28 23:31:04,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:31:04,257 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:31:04,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:31:04,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1470306761, now seen corresponding path program 5 times [2023-11-28 23:31:04,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:31:04,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564866636] [2023-11-28 23:31:04,258 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-28 23:31:04,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:31:04,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:31:04,259 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:31:04,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:31:05,595 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-28 23:31:05,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:31:05,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-28 23:31:05,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:31:05,636 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-28 23:31:05,747 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 23:31:05,747 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-28 23:31:05,776 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-28 23:31:05,865 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-28 23:31:06,741 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:31:06,741 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-28 23:31:06,786 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-28 23:31:06,822 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-28 23:31:06,823 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:31:07,217 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1997 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_1997) |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-28 23:31:07,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:31:07,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564866636] [2023-11-28 23:31:07,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564866636] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:31:07,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1665555837] [2023-11-28 23:31:07,220 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-28 23:31:07,220 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 23:31:07,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 23:31:07,221 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 23:31:07,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-11-28 23:32:17,312 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-28 23:32:17,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:32:17,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-28 23:32:17,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:32:17,555 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-28 23:32:17,816 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 23:32:17,816 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-28 23:32:17,880 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-28 23:32:18,014 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-28 23:32:18,849 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:32:18,850 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-28 23:32:18,939 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-28 23:32:18,949 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-28 23:32:18,949 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:32:23,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1665555837] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:32:23,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:32:23,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-28 23:32:23,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710417331] [2023-11-28 23:32:23,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:32:23,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-28 23:32:23,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:32:23,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-28 23:32:23,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=4, NotChecked=28, Total=272 [2023-11-28 23:32:23,327 INFO L87 Difference]: Start difference. First operand 811 states and 955 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-28 23:32:28,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:32:28,818 INFO L93 Difference]: Finished difference Result 1093 states and 1341 transitions. [2023-11-28 23:32:28,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 23:32:28,818 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-28 23:32:28,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:32:28,824 INFO L225 Difference]: With dead ends: 1093 [2023-11-28 23:32:28,824 INFO L226 Difference]: Without dead ends: 1091 [2023-11-28 23:32:28,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=4, NotChecked=30, Total=306 [2023-11-28 23:32:28,825 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 553 mSDsluCounter, 1783 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 2354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-11-28 23:32:28,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 2102 Invalid, 2354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2023-11-28 23:32:28,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2023-11-28 23:32:28,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 810. [2023-11-28 23:32:28,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 533 states have (on average 1.727954971857411) internal successors, (921), 802 states have internal predecessors, (921), 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-28 23:32:28,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 950 transitions. [2023-11-28 23:32:28,843 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 950 transitions. Word has length 108 [2023-11-28 23:32:28,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:32:28,844 INFO L495 AbstractCegarLoop]: Abstraction has 810 states and 950 transitions. [2023-11-28 23:32:28,844 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-28 23:32:28,844 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 950 transitions. [2023-11-28 23:32:28,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-28 23:32:28,845 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:32:28,845 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-28 23:32:28,888 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-11-28 23:32:29,054 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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)] Forceful destruction successful, exit code 0 [2023-11-28 23:32:29,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:32:29,246 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:32:29,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:32:29,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1470306760, now seen corresponding path program 1 times [2023-11-28 23:32:29,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:32:29,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379704688] [2023-11-28 23:32:29,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:32:29,247 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-28 23:32:29,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:32:29,248 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:32:29,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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 (24)] Waiting until timeout for monitored process [2023-11-28 23:32:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:32:29,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 107 conjunts are in the unsatisfiable core [2023-11-28 23:32:29,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:32:29,914 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-28 23:32:30,050 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 23:32:30,050 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-28 23:32:30,057 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-28 23:32:30,084 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-28 23:32:30,093 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-28 23:32:30,205 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-28 23:32:30,210 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-28 23:32:30,978 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:32:30,979 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-28 23:32:30,986 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-28 23:32:31,050 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-28 23:32:31,056 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-28 23:32:31,089 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-28 23:32:31,090 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:32:32,543 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3011 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 23:32:32,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:32:32,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379704688] [2023-11-28 23:32:32,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [379704688] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:32:32,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [580931167] [2023-11-28 23:32:32,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:32:32,549 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 23:32:32,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 23:32:32,550 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 23:32:32,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-11-28 23:34:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:19,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-28 23:34:19,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:34:19,205 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-28 23:34:19,527 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-28 23:34:19,541 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 23:34:19,541 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-28 23:34:19,594 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-28 23:34:19,604 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-28 23:34:19,752 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-28 23:34:19,757 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-28 23:34:20,447 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:34:20,447 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-28 23:34:20,457 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-28 23:34:20,549 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-28 23:34:20,554 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-28 23:34:20,559 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-28 23:34:20,559 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:34:21,939 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3565 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 23:34:21,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [580931167] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:34:21,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:34:21,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-28 23:34:21,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529207526] [2023-11-28 23:34:21,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:34:21,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-28 23:34:21,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:34:21,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-28 23:34:21,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=172, Unknown=2, NotChecked=54, Total=272 [2023-11-28 23:34:21,946 INFO L87 Difference]: Start difference. First operand 810 states and 950 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-28 23:34:30,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:34:30,455 INFO L93 Difference]: Finished difference Result 1090 states and 1336 transitions. [2023-11-28 23:34:30,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 23:34:30,456 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-28 23:34:30,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:34:30,461 INFO L225 Difference]: With dead ends: 1090 [2023-11-28 23:34:30,461 INFO L226 Difference]: Without dead ends: 1090 [2023-11-28 23:34:30,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2023-11-28 23:34:30,462 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 1066 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 3742 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 3762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2023-11-28 23:34:30,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 1734 Invalid, 3762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3742 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2023-11-28 23:34:30,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2023-11-28 23:34:30,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 809. [2023-11-28 23:34:30,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 533 states have (on average 1.726078799249531) internal successors, (920), 801 states have internal predecessors, (920), 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-28 23:34:30,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 949 transitions. [2023-11-28 23:34:30,476 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 949 transitions. Word has length 108 [2023-11-28 23:34:30,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:34:30,477 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 949 transitions. [2023-11-28 23:34:30,477 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-28 23:34:30,477 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 949 transitions. [2023-11-28 23:34:30,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-28 23:34:30,478 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:34:30,478 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-28 23:34:30,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2023-11-28 23:34:30,687 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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 (24)] Ended with exit code 0 [2023-11-28 23:34:30,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:34:30,879 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:34:30,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:30,879 INFO L85 PathProgramCache]: Analyzing trace with hash 80579918, now seen corresponding path program 1 times [2023-11-28 23:34:30,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:34:30,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636294052] [2023-11-28 23:34:30,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:30,880 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-28 23:34:30,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:34:30,881 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:34:30,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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)] Waiting until timeout for monitored process [2023-11-28 23:34:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:31,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-28 23:34:31,610 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:34:31,613 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-28 23:34:31,729 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 23:34:31,729 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-28 23:34:31,763 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-28 23:34:31,866 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-28 23:34:32,723 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:34:32,723 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-28 23:34:32,820 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:34:32,820 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-28 23:34:32,835 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-28 23:34:32,873 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-28 23:34:32,873 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:34:36,987 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3988 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3988) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 23:34:37,413 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4034 (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$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4034))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3988)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 23:34:37,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:34:37,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636294052] [2023-11-28 23:34:37,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636294052] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:34:37,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1572622283] [2023-11-28 23:34:37,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:37,416 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 23:34:37,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 23:34:37,417 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 23:34:37,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-11-28 23:34:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:41,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-28 23:34:41,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:34:41,242 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-28 23:34:41,562 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 23:34:41,562 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-28 23:34:41,622 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-28 23:34:41,797 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-28 23:34:42,630 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:34:42,631 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-28 23:34:42,797 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:34:42,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 36 treesize of output 35 [2023-11-28 23:34:42,814 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-28 23:34:42,824 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-28 23:34:42,825 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:34:42,841 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4457 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4457) |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-28 23:34:42,851 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4457 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4457) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-28 23:34:43,246 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4503 (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$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4503))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4457)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 23:34:43,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1572622283] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:34:43,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:34:43,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-28 23:34:43,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591176961] [2023-11-28 23:34:43,249 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:34:43,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-28 23:34:43,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:34:43,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-28 23:34:43,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=244, Unknown=6, NotChecked=180, Total=506 [2023-11-28 23:34:43,250 INFO L87 Difference]: Start difference. First operand 809 states and 949 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-28 23:34:49,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:34:49,438 INFO L93 Difference]: Finished difference Result 1089 states and 1335 transitions. [2023-11-28 23:34:49,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 23:34:49,438 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-28 23:34:49,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:34:49,443 INFO L225 Difference]: With dead ends: 1089 [2023-11-28 23:34:49,443 INFO L226 Difference]: Without dead ends: 1089 [2023-11-28 23:34:49,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=85, Invalid=271, Unknown=6, NotChecked=190, Total=552 [2023-11-28 23:34:49,444 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 552 mSDsluCounter, 2019 mSDsCounter, 0 mSdLazyCounter, 2571 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 2337 SdHoareTripleChecker+Invalid, 2576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:34:49,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 2337 Invalid, 2576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2571 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2023-11-28 23:34:49,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2023-11-28 23:34:49,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 808. [2023-11-28 23:34:49,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 533 states have (on average 1.724202626641651) internal successors, (919), 800 states have internal predecessors, (919), 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-28 23:34:49,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 948 transitions. [2023-11-28 23:34:49,458 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 948 transitions. Word has length 110 [2023-11-28 23:34:49,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:34:49,459 INFO L495 AbstractCegarLoop]: Abstraction has 808 states and 948 transitions. [2023-11-28 23:34:49,459 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-28 23:34:49,459 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 948 transitions. [2023-11-28 23:34:49,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-28 23:34:49,460 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:34:49,460 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-28 23:34:49,469 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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)] Ended with exit code 0 [2023-11-28 23:34:49,672 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2023-11-28 23:34:49,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-28 23:34:49,861 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:34:49,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:34:49,861 INFO L85 PathProgramCache]: Analyzing trace with hash 80579919, now seen corresponding path program 1 times [2023-11-28 23:34:49,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:34:49,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449295568] [2023-11-28 23:34:49,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:49,862 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-28 23:34:49,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:34:49,863 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:34:49,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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)] Waiting until timeout for monitored process [2023-11-28 23:34:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:50,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-28 23:34:50,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:34:50,670 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-28 23:34:50,785 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-28 23:34:50,798 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 23:34:50,798 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-28 23:34:50,823 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-28 23:34:50,828 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-28 23:34:50,945 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-28 23:34:50,950 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-28 23:34:51,604 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:34:51,604 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-28 23:34:51,610 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-28 23:34:51,740 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:34:51,741 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-28 23:34:51,755 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-28 23:34:51,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 31 treesize of output 13 [2023-11-28 23:34:51,776 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-28 23:34:51,805 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-28 23:34:51,805 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:34:51,979 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4971 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4972 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4972) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 23:34:52,016 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4971 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4972 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4972) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-28 23:34:53,404 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4972 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5064))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5063) .cse0 v_ArrVal_4971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4972) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4971 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5063) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5064) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-11-28 23:34:53,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:34:53,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449295568] [2023-11-28 23:34:53,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449295568] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:34:53,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2111640173] [2023-11-28 23:34:53,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:34:53,414 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 23:34:53,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 23:34:53,415 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 23:34:53,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-28 23:34:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:34:56,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-28 23:34:56,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:34:56,989 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-28 23:34:57,274 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 23:34:57,274 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-28 23:34:57,281 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-28 23:34:57,355 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-28 23:34:57,362 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-28 23:34:57,540 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-28 23:34:57,544 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-28 23:34:58,212 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:34:58,212 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-28 23:34:58,219 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-28 23:34:58,377 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:34:58,377 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-28 23:34:58,384 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-28 23:34:58,402 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-28 23:34:58,406 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-28 23:34:58,413 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-28 23:34:58,413 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:34:58,468 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5532 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5533 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 23:34:58,505 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5532 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5533 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_5533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-28 23:34:59,881 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5532 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5624) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5625) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5533 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5625))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5624) .cse2 v_ArrVal_5532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-28 23:34:59,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2111640173] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:34:59,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:34:59,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-28 23:34:59,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311048061] [2023-11-28 23:34:59,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:34:59,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-28 23:34:59,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:34:59,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-28 23:34:59,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=228, Unknown=6, NotChecked=210, Total=506 [2023-11-28 23:34:59,892 INFO L87 Difference]: Start difference. First operand 808 states and 948 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-28 23:35:09,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:35:09,254 INFO L93 Difference]: Finished difference Result 1088 states and 1334 transitions. [2023-11-28 23:35:09,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 23:35:09,254 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-28 23:35:09,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:35:09,259 INFO L225 Difference]: With dead ends: 1088 [2023-11-28 23:35:09,259 INFO L226 Difference]: Without dead ends: 1088 [2023-11-28 23:35:09,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=105, Invalid=375, Unknown=6, NotChecked=270, Total=756 [2023-11-28 23:35:09,259 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 557 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 4298 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 2068 SdHoareTripleChecker+Invalid, 4306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 4298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:35:09,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 2068 Invalid, 4306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 4298 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2023-11-28 23:35:09,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2023-11-28 23:35:09,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 807. [2023-11-28 23:35:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 533 states have (on average 1.722326454033771) internal successors, (918), 799 states have internal predecessors, (918), 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-28 23:35:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 947 transitions. [2023-11-28 23:35:09,271 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 947 transitions. Word has length 110 [2023-11-28 23:35:09,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:35:09,271 INFO L495 AbstractCegarLoop]: Abstraction has 807 states and 947 transitions. [2023-11-28 23:35:09,271 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-28 23:35:09,271 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 947 transitions. [2023-11-28 23:35:09,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-28 23:35:09,272 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:35:09,272 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-28 23:35:09,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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)] Ended with exit code 0 [2023-11-28 23:35:09,489 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2023-11-28 23:35:09,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-28 23:35:09,673 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:35:09,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:35:09,673 INFO L85 PathProgramCache]: Analyzing trace with hash 129022144, now seen corresponding path program 1 times [2023-11-28 23:35:09,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:35:09,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554931044] [2023-11-28 23:35:09,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:35:09,674 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-28 23:35:09,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:35:09,675 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:35:09,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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 (30)] Waiting until timeout for monitored process [2023-11-28 23:35:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:35:10,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-28 23:35:10,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:35:10,583 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-28 23:35:10,700 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 23:35:10,700 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-28 23:35:10,735 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-28 23:35:10,834 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-28 23:35:11,732 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:35:11,733 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-28 23:35:11,840 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:35:11,841 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-28 23:35:11,917 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:35:11,917 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-28 23:35:11,929 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-28 23:35:11,966 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-28 23:35:11,966 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:35:12,019 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6064 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6064) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2023-11-28 23:35:12,030 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6064 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6064) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-28 23:35:12,043 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6064 (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$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6063))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6064)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 23:35:12,055 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6064 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6063))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6064)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 23:35:12,461 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6110 (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$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6110))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6063)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6064)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 23:35:12,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:35:12,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554931044] [2023-11-28 23:35:12,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554931044] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:35:12,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2131790351] [2023-11-28 23:35:12,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:35:12,465 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 23:35:12,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 23:35:12,466 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 23:35:12,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-28 23:35:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:35:29,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-28 23:35:29,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:35:29,124 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-28 23:35:29,447 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 23:35:29,447 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-28 23:35:29,516 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-28 23:35:29,678 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-28 23:35:30,551 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:35:30,552 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-28 23:35:30,746 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:35:30,747 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-28 23:35:30,868 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:35:30,869 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-28 23:35:30,882 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-28 23:35:30,893 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-28 23:35:30,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:35:34,988 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6550 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 23:35:35,005 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6550 (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$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6549))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6550)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 23:35:35,020 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6550 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6549))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6550)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 23:35:35,420 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6550 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6596 (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$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6596))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6549)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6550)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 23:35:35,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2131790351] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:35:35,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:35:35,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-28 23:35:35,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399953823] [2023-11-28 23:35:35,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:35:35,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-28 23:35:35,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:35:35,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-28 23:35:35,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=307, Unknown=12, NotChecked=396, Total=812 [2023-11-28 23:35:35,425 INFO L87 Difference]: Start difference. First operand 807 states and 947 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-28 23:35:43,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:35:43,739 INFO L93 Difference]: Finished difference Result 1087 states and 1333 transitions. [2023-11-28 23:35:43,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-28 23:35:43,740 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-28 23:35:43,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:35:43,744 INFO L225 Difference]: With dead ends: 1087 [2023-11-28 23:35:43,744 INFO L226 Difference]: Without dead ends: 1087 [2023-11-28 23:35:43,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=106, Invalid=338, Unknown=12, NotChecked=414, Total=870 [2023-11-28 23:35:43,745 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 1039 mSDsluCounter, 2768 mSDsCounter, 0 mSdLazyCounter, 3528 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 3085 SdHoareTripleChecker+Invalid, 3544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-11-28 23:35:43,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 3085 Invalid, 3544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3528 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2023-11-28 23:35:43,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2023-11-28 23:35:43,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 806. [2023-11-28 23:35:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 533 states have (on average 1.7204502814258913) internal successors, (917), 798 states have internal predecessors, (917), 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-28 23:35:43,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 946 transitions. [2023-11-28 23:35:43,756 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 946 transitions. Word has length 112 [2023-11-28 23:35:43,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:35:43,756 INFO L495 AbstractCegarLoop]: Abstraction has 806 states and 946 transitions. [2023-11-28 23:35:43,756 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-28 23:35:43,756 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 946 transitions. [2023-11-28 23:35:43,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-28 23:35:43,757 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:35:43,757 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-28 23:35:43,779 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-11-28 23:35:43,966 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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 (30)] Ended with exit code 0 [2023-11-28 23:35:44,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:35:44,158 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:35:44,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:35:44,158 INFO L85 PathProgramCache]: Analyzing trace with hash 129022145, now seen corresponding path program 1 times [2023-11-28 23:35:44,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:35:44,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102557037] [2023-11-28 23:35:44,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:35:44,159 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-28 23:35:44,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:35:44,160 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:35:44,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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)] Waiting until timeout for monitored process [2023-11-28 23:35:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:35:45,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-28 23:35:45,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:35:45,132 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-28 23:35:45,245 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 23:35:45,245 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-28 23:35:45,252 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-28 23:35:45,289 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-28 23:35:45,303 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-28 23:35:45,408 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-28 23:35:45,412 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-28 23:35:46,082 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:35:46,082 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-28 23:35:46,088 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-28 23:35:46,215 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:35:46,215 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-28 23:35:46,224 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-28 23:35:46,340 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:35:46,340 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-28 23:35:46,347 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-28 23:35:46,366 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-28 23:35:46,371 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-28 23:35:46,407 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-28 23:35:46,407 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:35:46,596 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7082 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7081) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7082) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7081 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7081) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-11-28 23:35:46,634 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7081 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7081) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7082 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7081) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7082) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-28 23:35:46,693 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7079))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7080) .cse0 v_ArrVal_7081) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7082) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7080) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7081) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-28 23:35:46,735 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7080) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7081) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7079))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7080) .cse3 v_ArrVal_7081) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7082) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-28 23:35:53,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:35:53,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102557037] [2023-11-28 23:35:53,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102557037] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:35:53,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [254438045] [2023-11-28 23:35:53,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:35:53,281 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 23:35:53,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 23:35:53,282 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 23:35:53,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-28 23:36:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:36:10,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-28 23:36:10,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:36:10,079 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-28 23:36:10,810 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-28 23:36:10,849 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 23:36:10,850 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-28 23:36:10,995 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-28 23:36:11,003 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-28 23:36:11,378 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-28 23:36:11,387 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-28 23:36:12,748 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:36:12,748 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-28 23:36:12,765 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-28 23:36:13,149 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:36:13,149 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-28 23:36:13,159 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-28 23:36:13,416 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:36:13,416 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-28 23:36:13,431 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-28 23:36:13,463 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-28 23:36:13,478 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-28 23:36:13,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-28 23:36:13,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:36:13,560 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7659 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7660 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-11-28 23:36:13,606 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7660 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7659 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-28 23:36:13,660 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7657 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7657) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7658) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7657 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7658))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7657) .cse2 v_ArrVal_7660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-28 23:36:13,719 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7657 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7657) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7658) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7657 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7658))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7657) .cse3 v_ArrVal_7660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-28 23:36:15,494 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7657 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7751))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7752) .cse1 v_ArrVal_7657) (select (select (store .cse2 .cse1 v_ArrVal_7658) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7660))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7657 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7751))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7658))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7752) .cse4 v_ArrVal_7657) .cse5 v_ArrVal_7660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-28 23:36:15,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [254438045] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:36:15,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:36:15,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-28 23:36:15,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121052227] [2023-11-28 23:36:15,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:36:15,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-28 23:36:15,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:36:15,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-28 23:36:15,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=318, Unknown=16, NotChecked=396, Total=812 [2023-11-28 23:36:15,519 INFO L87 Difference]: Start difference. First operand 806 states and 946 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-28 23:36:26,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:36:26,789 INFO L93 Difference]: Finished difference Result 1086 states and 1332 transitions. [2023-11-28 23:36:26,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-28 23:36:26,790 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-28 23:36:26,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:36:26,794 INFO L225 Difference]: With dead ends: 1086 [2023-11-28 23:36:26,794 INFO L226 Difference]: Without dead ends: 1086 [2023-11-28 23:36:26,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=136, Invalid=534, Unknown=16, NotChecked=504, Total=1190 [2023-11-28 23:36:26,795 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 1056 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 2363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2023-11-28 23:36:26,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 1206 Invalid, 2363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2344 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2023-11-28 23:36:26,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2023-11-28 23:36:26,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 805. [2023-11-28 23:36:26,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 533 states have (on average 1.7185741088180113) internal successors, (916), 797 states have internal predecessors, (916), 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-28 23:36:26,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 945 transitions. [2023-11-28 23:36:26,815 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 945 transitions. Word has length 112 [2023-11-28 23:36:26,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:36:26,816 INFO L495 AbstractCegarLoop]: Abstraction has 805 states and 945 transitions. [2023-11-28 23:36:26,816 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-28 23:36:26,816 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 945 transitions. [2023-11-28 23:36:26,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-28 23:36:26,816 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:36:26,817 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-28 23:36:26,838 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-28 23:36:27,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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)] Ended with exit code 0 [2023-11-28 23:36:27,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:36:27,217 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:36:27,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:36:27,218 INFO L85 PathProgramCache]: Analyzing trace with hash -562644468, now seen corresponding path program 1 times [2023-11-28 23:36:27,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:36:27,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221757484] [2023-11-28 23:36:27,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:36:27,219 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-28 23:36:27,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:36:27,220 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:36:27,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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 (34)] Waiting until timeout for monitored process [2023-11-28 23:36:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:36:28,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-28 23:36:28,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:36:28,450 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-28 23:36:28,810 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 23:36:28,810 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-28 23:36:28,871 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-28 23:36:29,072 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-28 23:36:30,762 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:36:30,762 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-28 23:36:30,986 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:36:30,987 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-28 23:36:31,168 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:36:31,168 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-28 23:36:31,356 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:36:31,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 44 treesize of output 43 [2023-11-28 23:36:31,383 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-28 23:36:31,477 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-28 23:36:31,478 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:36:31,614 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8207) |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-28 23:36:35,766 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8206 (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$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8206))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8207)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 23:36:35,791 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8206 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8206))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8207)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 23:36:35,821 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8205 (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$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8205))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8206)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8207)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 23:36:35,853 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8205 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8205))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8206)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8207)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-28 23:36:36,453 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8253 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8253))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8205)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8206)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8207)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 23:36:36,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:36:36,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221757484] [2023-11-28 23:36:36,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1221757484] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:36:36,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1246674198] [2023-11-28 23:36:36,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:36:36,462 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 23:36:36,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 23:36:36,463 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 23:36:36,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-28 23:36:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:36:59,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-28 23:36:59,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:36:59,094 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-28 23:36:59,903 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 23:36:59,903 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-28 23:37:00,055 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-28 23:37:00,416 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-28 23:37:02,070 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:37:02,070 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-28 23:37:02,422 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:37:02,422 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-28 23:37:02,658 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:37:02,659 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-28 23:37:02,890 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:37:02,890 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-28 23:37:02,914 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-28 23:37:02,934 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-28 23:37:02,935 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:37:02,968 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8708 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8708) |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-28 23:37:02,992 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8708 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8708) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-28 23:37:03,019 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8707 (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$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8707))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8708)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 23:37:03,045 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8707 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8707))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8708)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 23:37:03,076 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8706 (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$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8706))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8707)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8708)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 23:37:03,107 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8706 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8706))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8707)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8708)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 23:37:03,725 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8706 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8754 (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$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8754))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8706)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8707)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8708)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 23:37:03,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1246674198] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:37:03,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:37:03,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-28 23:37:03,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572008870] [2023-11-28 23:37:03,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:37:03,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-28 23:37:03,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:37:03,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-28 23:37:03,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=374, Unknown=14, NotChecked=676, Total=1190 [2023-11-28 23:37:03,734 INFO L87 Difference]: Start difference. First operand 805 states and 945 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-28 23:37:16,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:37:16,154 INFO L93 Difference]: Finished difference Result 1085 states and 1331 transitions. [2023-11-28 23:37:16,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-28 23:37:16,155 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-28 23:37:16,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:37:16,161 INFO L225 Difference]: With dead ends: 1085 [2023-11-28 23:37:16,161 INFO L226 Difference]: Without dead ends: 1085 [2023-11-28 23:37:16,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=136, Invalid=408, Unknown=14, NotChecked=702, Total=1260 [2023-11-28 23:37:16,163 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 1031 mSDsluCounter, 2177 mSDsCounter, 0 mSdLazyCounter, 2842 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 2493 SdHoareTripleChecker+Invalid, 2858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2023-11-28 23:37:16,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 2493 Invalid, 2858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2842 Invalid, 0 Unknown, 0 Unchecked, 12.2s Time] [2023-11-28 23:37:16,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2023-11-28 23:37:16,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 804. [2023-11-28 23:37:16,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 533 states have (on average 1.7166979362101313) internal successors, (915), 796 states have internal predecessors, (915), 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-28 23:37:16,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 944 transitions. [2023-11-28 23:37:16,175 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 944 transitions. Word has length 114 [2023-11-28 23:37:16,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:37:16,175 INFO L495 AbstractCegarLoop]: Abstraction has 804 states and 944 transitions. [2023-11-28 23:37:16,175 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-28 23:37:16,175 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 944 transitions. [2023-11-28 23:37:16,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-28 23:37:16,176 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:37:16,176 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-28 23:37:16,186 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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 (34)] Ended with exit code 0 [2023-11-28 23:37:16,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2023-11-28 23:37:16,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-28 23:37:16,577 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:37:16,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:37:16,577 INFO L85 PathProgramCache]: Analyzing trace with hash -562644467, now seen corresponding path program 1 times [2023-11-28 23:37:16,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:37:16,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015371748] [2023-11-28 23:37:16,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:37:16,578 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-28 23:37:16,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:37:16,578 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:37:16,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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 (36)] Waiting until timeout for monitored process [2023-11-28 23:37:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:37:17,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-28 23:37:17,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:37:17,683 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-28 23:37:18,001 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-28 23:37:18,034 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 23:37:18,035 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-28 23:37:18,091 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-28 23:37:18,109 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-28 23:37:18,318 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-28 23:37:18,325 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-28 23:37:19,794 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:37:19,795 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-28 23:37:19,805 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-28 23:37:20,049 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:37:20,049 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-28 23:37:20,059 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-28 23:37:20,255 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:37:20,255 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-28 23:37:20,280 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-28 23:37:20,467 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:37:20,468 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-28 23:37:20,493 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-28 23:37:20,518 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-28 23:37:20,533 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-28 23:37:20,603 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-28 23:37:20,604 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:37:20,888 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9256 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9257) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9256) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9257 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9257) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv20 32) .cse1) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-11-28 23:37:20,937 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9256 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9257) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9256) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9257 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9257) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-11-28 23:37:21,023 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9255 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9256 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9255))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9254) .cse0 v_ArrVal_9257) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9256) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9255 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9257 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9254) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9255) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9257) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-28 23:37:21,182 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9255 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9257 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9254) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9255) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9257) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9255 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9256 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9255))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9254) .cse3 v_ArrVal_9257) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9256) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-28 23:37:22,297 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9255 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9253 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9257 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9253))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9252) .cse1 v_ArrVal_9254) (select (select (store .cse2 .cse1 v_ArrVal_9255) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9257))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9255 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9253 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9256 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9253))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9255))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9252) .cse4 v_ArrVal_9254) .cse5 v_ArrVal_9257) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9256) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-28 23:37:41,001 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9255 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9253 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9349 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9256 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9348))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9253))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9255))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9349) .cse0 v_ArrVal_9252) .cse1 v_ArrVal_9254) .cse2 v_ArrVal_9257) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9256) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9255 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9253 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9349 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9257 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9348))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9253))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9349) .cse8 v_ArrVal_9252) .cse9 v_ArrVal_9254) (select (select (store .cse10 .cse9 v_ArrVal_9255) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9257))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-11-28 23:37:41,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:37:41,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015371748] [2023-11-28 23:37:41,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015371748] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:37:41,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1505374729] [2023-11-28 23:37:41,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:37:41,033 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 23:37:41,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 23:37:41,034 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 23:37:41,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-28 23:38:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:38:01,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-28 23:38:01,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:38:01,302 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-28 23:38:04,167 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 23:38:04,168 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-28 23:38:04,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-28 23:38:04,779 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-28 23:38:04,833 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-28 23:38:06,075 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-28 23:38:06,102 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-28 23:38:11,194 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:38:11,194 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-28 23:38:11,248 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-28 23:38:12,467 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:38:12,467 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-28 23:38:12,520 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-28 23:38:13,375 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:38:13,375 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-28 23:38:13,428 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-28 23:38:14,285 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:38:14,285 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-28 23:38:14,339 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-28 23:38:14,423 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-28 23:38:14,476 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-28 23:38:14,504 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-28 23:38:14,504 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:38:14,747 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9852 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9852) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 23:38:14,884 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9852 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9852) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-28 23:38:15,125 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9852 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9850))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9849) .cse0 v_ArrVal_9851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9852) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9849) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-28 23:38:15,394 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9852 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9850))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9849) .cse1 v_ArrVal_9851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9852) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9849) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-11-28 23:38:17,281 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9848))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9847) .cse1 v_ArrVal_9849) (select (select (store .cse2 .cse1 v_ArrVal_9850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9851))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9852 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9848))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9850))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9847) .cse4 v_ArrVal_9849) .cse5 v_ArrVal_9851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9852) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-28 23:38:18,964 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_9849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9848))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9847) .cse2 v_ArrVal_9849) (select (select (store .cse3 .cse2 v_ArrVal_9850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9851))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9852 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9848))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_9850))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9847) .cse5 v_ArrVal_9849) .cse6 v_ArrVal_9851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_9852) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-28 23:38:27,439 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9944 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9943 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9852 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9943))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9848))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9850))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9944) .cse0 v_ArrVal_9847) .cse1 v_ArrVal_9849) .cse2 v_ArrVal_9851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9852) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9944 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9943 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9943))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9848))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9944) .cse8 v_ArrVal_9847) .cse9 v_ArrVal_9849) (select (select (store .cse10 .cse9 v_ArrVal_9850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9851))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-11-28 23:38:27,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1505374729] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:38:27,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:38:27,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-28 23:38:27,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4176826] [2023-11-28 23:38:27,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:38:27,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-28 23:38:27,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:38:27,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-28 23:38:27,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=390, Unknown=16, NotChecked=676, Total=1190 [2023-11-28 23:38:27,484 INFO L87 Difference]: Start difference. First operand 804 states and 944 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-28 23:39:32,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:39:32,622 INFO L93 Difference]: Finished difference Result 1084 states and 1330 transitions. [2023-11-28 23:39:32,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-28 23:39:32,622 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-28 23:39:32,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:39:32,628 INFO L225 Difference]: With dead ends: 1084 [2023-11-28 23:39:32,628 INFO L226 Difference]: Without dead ends: 1084 [2023-11-28 23:39:32,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=177, Invalid=671, Unknown=16, NotChecked=858, Total=1722 [2023-11-28 23:39:32,629 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 1052 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 3762 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 3783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 62.7s IncrementalHoareTripleChecker+Time [2023-11-28 23:39:32,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 1744 Invalid, 3783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3762 Invalid, 0 Unknown, 0 Unchecked, 62.7s Time] [2023-11-28 23:39:32,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2023-11-28 23:39:32,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 803. [2023-11-28 23:39:32,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 533 states have (on average 1.7148217636022514) internal successors, (914), 795 states have internal predecessors, (914), 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-28 23:39:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 943 transitions. [2023-11-28 23:39:32,641 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 943 transitions. Word has length 114 [2023-11-28 23:39:32,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:39:32,642 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 943 transitions. [2023-11-28 23:39:32,642 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-28 23:39:32,642 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 943 transitions. [2023-11-28 23:39:32,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-28 23:39:32,642 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:39:32,643 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-28 23:39:32,654 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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 (36)] Ended with exit code 0 [2023-11-28 23:39:32,869 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2023-11-28 23:39:33,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-28 23:39:33,043 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:39:33,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:39:33,044 INFO L85 PathProgramCache]: Analyzing trace with hash 465703443, now seen corresponding path program 1 times [2023-11-28 23:39:33,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:39:33,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628013649] [2023-11-28 23:39:33,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:39:33,044 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-28 23:39:33,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:39:33,045 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:39:33,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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 (38)] Waiting until timeout for monitored process [2023-11-28 23:39:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,536 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-28 23:39:34,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:39:34,572 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-28 23:39:36,406 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 23:39:36,406 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-28 23:39:36,757 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-28 23:39:37,562 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-28 23:39:45,052 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:39:45,052 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-28 23:39:46,015 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:39:46,015 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-28 23:39:46,744 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:39:46,744 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-28 23:39:47,499 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:39:47,499 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-28 23:39:48,288 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:39:48,289 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-28 23:39:48,383 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-28 23:39:48,727 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-28 23:39:48,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2023-11-28 23:39:49,183 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-28 23:39:49,183 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:39:50,050 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10417 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_10417) |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-28 23:39:50,128 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10417 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10417) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 23:39:50,210 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10416 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10417 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10416))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10417)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 23:39:50,292 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10416 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10417 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10416))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10417)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 23:39:50,378 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10416 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10417 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10415))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10416)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10417)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 23:39:50,467 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10416 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10417 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10415))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10416)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10417)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 23:39:50,569 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10416 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10417 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (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$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10414))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10415)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10416)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10417)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 23:39:50,670 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10416 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10417 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10414))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10415)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10416)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10417)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-28 23:39:52,665 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10416 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10417 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (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$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10464))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10414)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10415)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10416)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10417)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-28 23:39:52,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:39:52,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628013649] [2023-11-28 23:39:52,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628013649] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:39:52,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [90926509] [2023-11-28 23:39:52,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:39:52,682 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 23:39:52,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 23:39:52,683 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 23:39:52,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2023-11-28 23:40:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:40:01,702 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-28 23:40:01,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:40:01,783 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-28 23:40:05,376 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 23:40:05,376 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-28 23:40:05,963 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-28 23:40:07,495 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-28 23:40:16,924 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:40:16,925 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-28 23:40:18,406 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:40:18,406 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-28 23:40:19,432 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:40:19,433 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-28 23:40:20,485 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:40:20,486 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-28 23:40:21,487 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:40:21,487 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-28 23:40:21,646 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-28 23:40:22,208 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-28 23:40:22,208 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-28 23:40:22,524 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-28 23:40:22,525 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:40:27,317 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10938 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17|))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17| v_ArrVal_10938) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_10937) |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-28 23:40:27,462 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10938 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17|))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17| v_ArrVal_10938) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10937) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1))))) is different from false [2023-11-28 23:40:27,576 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10938 (_ BitVec 1)) (v_ArrVal_10936 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17|))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17| v_ArrVal_10938) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10936))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10937)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-28 23:40:27,690 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10938 (_ BitVec 1)) (v_ArrVal_10936 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17| v_ArrVal_10938) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10936))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10937)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2023-11-28 23:40:27,809 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10938 (_ BitVec 1)) (v_ArrVal_10935 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10936 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17|))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17| v_ArrVal_10938) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10935))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10936)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10937)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-28 23:40:27,928 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10938 (_ BitVec 1)) (v_ArrVal_10935 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10936 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17|))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17| v_ArrVal_10938) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10935))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10936)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10937)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-28 23:40:28,054 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10938 (_ BitVec 1)) (v_ArrVal_10935 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10936 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10934 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17|))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17| v_ArrVal_10938) (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$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10934))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10935)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10936)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10937)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-28 23:40:28,180 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10938 (_ BitVec 1)) (v_ArrVal_10935 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10936 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10934 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17|))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17| v_ArrVal_10938) (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10934))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10935)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10936)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10937)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-28 23:40:30,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [90926509] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:40:30,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:40:30,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2023-11-28 23:40:30,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420404163] [2023-11-28 23:40:30,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:40:30,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-28 23:40:30,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:40:30,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-28 23:40:30,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=590, Unknown=18, NotChecked=1122, Total=1892 [2023-11-28 23:40:30,849 INFO L87 Difference]: Start difference. First operand 803 states and 943 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) [2023-11-28 23:41:59,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:41:59,163 INFO L93 Difference]: Finished difference Result 1083 states and 1329 transitions. [2023-11-28 23:41:59,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-28 23:41:59,164 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 116 [2023-11-28 23:41:59,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:41:59,168 INFO L225 Difference]: With dead ends: 1083 [2023-11-28 23:41:59,169 INFO L226 Difference]: Without dead ends: 1083 [2023-11-28 23:41:59,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 208 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=172, Invalid=634, Unknown=18, NotChecked=1156, Total=1980 [2023-11-28 23:41:59,170 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 536 mSDsluCounter, 4364 mSDsCounter, 0 mSdLazyCounter, 5385 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 85.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 4679 SdHoareTripleChecker+Invalid, 5391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 87.7s IncrementalHoareTripleChecker+Time [2023-11-28 23:41:59,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 4679 Invalid, 5391 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6 Valid, 5385 Invalid, 0 Unknown, 0 Unchecked, 87.7s Time] [2023-11-28 23:41:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2023-11-28 23:41:59,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 802. [2023-11-28 23:41:59,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 533 states have (on average 1.7129455909943714) internal successors, (913), 794 states have internal predecessors, (913), 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-28 23:41:59,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 942 transitions. [2023-11-28 23:41:59,182 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 942 transitions. Word has length 116 [2023-11-28 23:41:59,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:41:59,183 INFO L495 AbstractCegarLoop]: Abstraction has 802 states and 942 transitions. [2023-11-28 23:41:59,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2023-11-28 23:41:59,183 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 942 transitions. [2023-11-28 23:41:59,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-28 23:41:59,183 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:41:59,183 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-28 23:41:59,195 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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 (38)] Ended with exit code 0 [2023-11-28 23:41:59,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2023-11-28 23:41:59,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-28 23:41:59,584 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 23:41:59,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:41:59,584 INFO L85 PathProgramCache]: Analyzing trace with hash 465703444, now seen corresponding path program 1 times [2023-11-28 23:41:59,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:41:59,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129473147] [2023-11-28 23:41:59,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:41:59,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:41:59,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:41:59,586 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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-28 23:41:59,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/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 (40)] Waiting until timeout for monitored process [2023-11-28 23:42:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:01,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 123 conjunts are in the unsatisfiable core [2023-11-28 23:42:01,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:42:01,070 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-28 23:42:02,867 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 23:42:02,867 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-28 23:42:02,988 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-28 23:42:03,317 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-28 23:42:03,473 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-28 23:42:04,533 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 35 treesize of output 17 [2023-11-28 23:42:04,565 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-28 23:42:15,673 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:42:15,674 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 75 treesize of output 68 [2023-11-28 23:42:15,709 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-28 23:42:17,008 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:42:17,008 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 75 treesize of output 68 [2023-11-28 23:42:17,042 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-28 23:42:17,949 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:42:17,950 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 75 treesize of output 68 [2023-11-28 23:42:17,983 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-28 23:42:18,897 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:42:18,897 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 75 treesize of output 68 [2023-11-28 23:42:18,930 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-28 23:42:19,950 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:42:19,950 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 75 treesize of output 68 [2023-11-28 23:42:19,984 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-28 23:42:20,152 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 44 treesize of output 20 [2023-11-28 23:42:20,186 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-28 23:42:20,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:42:20,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-28 23:42:20,548 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-11-28 23:42:20,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-28 23:42:20,849 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-28 23:42:20,849 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:42:22,553 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_11506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) (forall ((v_ArrVal_11507 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11508 (_ BitVec 32))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_11506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11508) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_11507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-28 23:42:22,765 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (or (forall ((v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_11506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (forall ((v_ArrVal_11507 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11508 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_11506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11508) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_11507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))))))) is different from false [2023-11-28 23:42:22,991 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_11505) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_11504) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (forall ((v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11507 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11508 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_11504))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_11505) .cse2 v_ArrVal_11506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11508) (select (select (store .cse3 .cse2 v_ArrVal_11507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-28 23:42:23,225 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11507 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11508 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_11504))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_11505) .cse1 v_ArrVal_11506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11508) (select (select (store .cse3 .cse1 v_ArrVal_11507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_11505) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_11504) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse4 (bvadd (_ bv4 32) .cse4)))))))) is different from false [2023-11-28 23:42:23,436 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_11503))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_11502) .cse1 v_ArrVal_11505) (select (select (store .cse2 .cse1 v_ArrVal_11504) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11506))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_11503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11507 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11508 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_11503))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_11504))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_11502) .cse4 v_ArrVal_11505) .cse5 v_ArrVal_11506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11508) (select (select (store .cse6 .cse5 v_ArrVal_11507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-28 23:42:23,784 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((v_ArrVal_11503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_11503))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_11502) .cse2 v_ArrVal_11505) (select (select (store .cse3 .cse2 v_ArrVal_11504) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_11506))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (forall ((v_ArrVal_11503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11507 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11508 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_11503))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_11504))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_11502) .cse5 v_ArrVal_11505) .cse6 v_ArrVal_11506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11508) (select (select (store .cse7 .cse6 v_ArrVal_11507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))))))) is different from false [2023-11-28 23:42:24,052 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11507 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11508 (_ BitVec 32))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11500))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_11503))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_11504))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11501) .cse0 v_ArrVal_11502) .cse1 v_ArrVal_11505) .cse2 v_ArrVal_11506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11508) (select (select (store .cse4 .cse2 v_ArrVal_11507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((v_ArrVal_11500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11500))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_11503))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11501) .cse8 v_ArrVal_11502) .cse9 v_ArrVal_11505) (select (select (store .cse10 .cse9 v_ArrVal_11504) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11506))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse7 (bvadd (_ bv4 32) .cse7)))) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-28 23:42:24,486 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_11500))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_11503))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_11501) .cse2 v_ArrVal_11502) .cse3 v_ArrVal_11505) (select (select (store .cse4 .cse3 v_ArrVal_11504) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_11506))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) (forall ((v_ArrVal_11500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11507 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11508 (_ BitVec 32))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_11500))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_11503))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_11504))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_11501) .cse7 v_ArrVal_11502) .cse8 v_ArrVal_11505) .cse9 v_ArrVal_11506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11508) (select (select (store .cse10 .cse9 v_ArrVal_11507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))))))) is different from false [2023-11-28 23:42:29,692 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11600 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11600))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_11500))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_11503))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11599) .cse1 v_ArrVal_11501) .cse2 v_ArrVal_11502) .cse3 v_ArrVal_11505) (select (select (store .cse4 .cse3 v_ArrVal_11504) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_11506))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_11599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11600 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11507 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11508 (_ BitVec 32))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11600))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_11500))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_11503))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_11504))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11599) .cse8 v_ArrVal_11501) .cse9 v_ArrVal_11502) .cse10 v_ArrVal_11505) .cse11 v_ArrVal_11506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11508) (select (select (store .cse12 .cse11 v_ArrVal_11507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-28 23:42:29,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:42:29,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129473147] [2023-11-28 23:42:29,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129473147] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:42:29,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [606552523] [2023-11-28 23:42:29,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:42:29,744 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 23:42:29,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 23:42:29,745 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 23:42:29,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e697eca7-a41d-4849-9cc2-b39859bf80ea/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-11-28 23:42:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:49,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 125 conjunts are in the unsatisfiable core [2023-11-28 23:42:49,515 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:42:49,574 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-28 23:42:53,260 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 23:42:53,260 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-28 23:42:53,412 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-28 23:42:54,125 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-28 23:42:54,188 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-28 23:42:56,043 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 29 treesize of output 17 [2023-11-28 23:42:56,075 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-28 23:43:06,443 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:43:06,443 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 61 treesize of output 54 [2023-11-28 23:43:06,506 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-28 23:43:08,433 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:43:08,433 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 61 treesize of output 54 [2023-11-28 23:43:08,505 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-28 23:43:09,765 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:43:09,765 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 61 treesize of output 54 [2023-11-28 23:43:09,831 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-28 23:43:11,042 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:43:11,042 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 61 treesize of output 54 [2023-11-28 23:43:11,109 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-28 23:43:12,398 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:43:12,398 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 61 treesize of output 54 [2023-11-28 23:43:12,430 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-28 23:43:12,660 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 36 treesize of output 20 [2023-11-28 23:43:12,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:43:12,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-28 23:43:12,773 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-28 23:43:13,063 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-11-28 23:43:13,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-28 23:43:13,097 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-28 23:43:13,097 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:43:17,022 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_12122 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12123 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11508 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_12123) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11508) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_12122) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((v_ArrVal_12123 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_12123) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))))))) is different from false [2023-11-28 23:43:17,242 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12122 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12121 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11508 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_12120))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_12121) .cse0 v_ArrVal_12123) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11508) (select (select (store .cse2 .cse0 v_ArrVal_12122) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_12123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12121 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_12121) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_12120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12123) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))))) is different from false [2023-11-28 23:43:17,440 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (or (forall ((v_ArrVal_12123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12121 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_12121) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_12120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12123) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (forall ((v_ArrVal_12122 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12121 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11508 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_12120))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_12121) .cse3 v_ArrVal_12123) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11508) (select (select (store .cse4 .cse3 v_ArrVal_12122) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))))))) is different from false [2023-11-28 23:43:17,656 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((v_ArrVal_12123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_12119))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_12118) .cse1 v_ArrVal_12121) (select (select (store .cse2 .cse1 v_ArrVal_12120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12123))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (forall ((v_ArrVal_12122 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12118 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11508 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_12119))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_12120))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_12118) .cse4 v_ArrVal_12121) .cse5 v_ArrVal_12123) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11508) (select (select (store .cse6 .cse5 v_ArrVal_12122) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-28 23:43:17,866 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_12123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_12119))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_12118) .cse2 v_ArrVal_12121) (select (select (store .cse3 .cse2 v_ArrVal_12120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_12123))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_12122 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12118 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11508 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_12119))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_12120))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_12118) .cse5 v_ArrVal_12121) .cse6 v_ArrVal_12123) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11508) (select (select (store .cse7 .cse6 v_ArrVal_12122) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))))))) is different from false [2023-11-28 23:43:18,103 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_12123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12116))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_12119))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12117) .cse1 v_ArrVal_12118) .cse2 v_ArrVal_12121) (select (select (store .cse3 .cse2 v_ArrVal_12120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_12123))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_12122 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12118 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11508 (_ BitVec 32))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12116))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_12119))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_12120))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12117) .cse6 v_ArrVal_12118) .cse7 v_ArrVal_12121) .cse8 v_ArrVal_12123) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11508) (select (select (store .cse9 .cse8 v_ArrVal_12122) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-28 23:43:18,420 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_12122 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12118 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11508 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_12116))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_12119))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_12120))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_12117) .cse1 v_ArrVal_12118) .cse2 v_ArrVal_12121) .cse3 v_ArrVal_12123) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11508) (select (select (store .cse5 .cse3 v_ArrVal_12122) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_12123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_12116))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_12119))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_12117) .cse9 v_ArrVal_12118) .cse10 v_ArrVal_12121) (select (select (store .cse11 .cse10 v_ArrVal_12120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_12123))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse8 (bvadd (_ bv4 32) .cse8)))))))) is different from false [2023-11-28 23:43:23,297 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_12123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12216 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12216))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_12116))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_12119))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12215) .cse1 v_ArrVal_12117) .cse2 v_ArrVal_12118) .cse3 v_ArrVal_12121) (select (select (store .cse4 .cse3 v_ArrVal_12120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_12123))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) (forall ((v_ArrVal_12122 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12216 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12118 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11508 (_ BitVec 32))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12216))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_12116))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_12119))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_12120))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12215) .cse8 v_ArrVal_12117) .cse9 v_ArrVal_12118) .cse10 v_ArrVal_12121) .cse11 v_ArrVal_12123) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11508) (select (select (store .cse12 .cse11 v_ArrVal_12122) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-28 23:43:23,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [606552523] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:43:23,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:43:23,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2023-11-28 23:43:23,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131325010] [2023-11-28 23:43:23,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:43:23,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-28 23:43:23,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:43:23,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-28 23:43:23,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=459, Unknown=22, NotChecked=1020, Total=1640 [2023-11-28 23:43:23,346 INFO L87 Difference]: Start difference. First operand 802 states and 942 transitions. Second operand has 21 states, 18 states have (on average 7.555555555555555) internal successors, (136), 21 states have internal predecessors, (136), 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)