./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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 42d34b3801344b79b388ecea52b2e670196aa6b758fe24ea6ecf5c2b8bbf579b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:35:24,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:35:24,165 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 00:35:24,169 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:35:24,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:35:24,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:35:24,195 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:35:24,195 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:35:24,196 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:35:24,197 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:35:24,197 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:35:24,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:35:24,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:35:24,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:35:24,200 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:35:24,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:35:24,201 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:35:24,201 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:35:24,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:35:24,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:35:24,203 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 00:35:24,204 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 00:35:24,204 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 00:35:24,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:35:24,205 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:35:24,205 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:35:24,206 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:35:24,206 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:35:24,207 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:35:24,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:35:24,207 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:35:24,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:35:24,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:35:24,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:35:24,209 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:35:24,209 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:35:24,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:35:24,209 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:35:24,209 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:35:24,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:35:24,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:35:24,210 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_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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 -> 42d34b3801344b79b388ecea52b2e670196aa6b758fe24ea6ecf5c2b8bbf579b [2023-11-29 00:35:24,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:35:24,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:35:24,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:35:24,468 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:35:24,468 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:35:24,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i [2023-11-29 00:35:27,272 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:35:27,562 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:35:27,562 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i [2023-11-29 00:35:27,580 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/data/da3fd954e/5568a82de599489bac63a29d019a5a18/FLAG57548ced4 [2023-11-29 00:35:27,596 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/data/da3fd954e/5568a82de599489bac63a29d019a5a18 [2023-11-29 00:35:27,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:35:27,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:35:27,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:35:27,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:35:27,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:35:27,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:35:27" (1/1) ... [2023-11-29 00:35:27,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4420c5a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:27, skipping insertion in model container [2023-11-29 00:35:27,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:35:27" (1/1) ... [2023-11-29 00:35:27,679 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:35:28,212 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:35:28,225 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-11-29 00:35:28,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@290b7a9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:28, skipping insertion in model container [2023-11-29 00:35:28,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:35:28,226 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 00:35:28,228 INFO L158 Benchmark]: Toolchain (without parser) took 627.08ms. Allocated memory is still 153.1MB. Free memory was 108.7MB in the beginning and 87.8MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 00:35:28,229 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 104.9MB. Free memory is still 54.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:35:28,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 624.33ms. Allocated memory is still 153.1MB. Free memory was 108.3MB in the beginning and 87.8MB in the end (delta: 20.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 00:35:28,232 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.22ms. Allocated memory is still 104.9MB. Free memory is still 54.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 624.33ms. Allocated memory is still 153.1MB. Free memory was 108.3MB in the beginning and 87.8MB in the end (delta: 20.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 766]: 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_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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 42d34b3801344b79b388ecea52b2e670196aa6b758fe24ea6ecf5c2b8bbf579b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:35:30,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:35:30,113 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 00:35:30,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:35:30,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:35:30,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:35:30,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:35:30,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:35:30,151 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:35:30,151 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:35:30,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:35:30,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:35:30,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:35:30,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:35:30,154 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:35:30,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:35:30,156 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:35:30,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:35:30,157 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:35:30,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:35:30,158 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 00:35:30,159 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 00:35:30,159 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 00:35:30,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:35:30,160 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:35:30,160 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 00:35:30,161 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 00:35:30,161 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:35:30,162 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:35:30,162 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:35:30,163 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:35:30,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:35:30,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:35:30,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:35:30,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:35:30,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:35:30,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:35:30,165 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 00:35:30,165 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 00:35:30,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:35:30,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:35:30,166 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:35:30,166 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:35:30,166 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 00:35:30,166 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_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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 -> 42d34b3801344b79b388ecea52b2e670196aa6b758fe24ea6ecf5c2b8bbf579b [2023-11-29 00:35:30,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:35:30,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:35:30,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:35:30,484 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:35:30,484 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:35:30,486 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i [2023-11-29 00:35:33,344 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:35:33,633 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:35:33,634 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i [2023-11-29 00:35:33,653 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/data/0a523f95a/c9f9be3faa9c41beb7dc4a4929aeaa18/FLAG6f75c7226 [2023-11-29 00:35:33,670 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/data/0a523f95a/c9f9be3faa9c41beb7dc4a4929aeaa18 [2023-11-29 00:35:33,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:35:33,674 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:35:33,676 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:35:33,676 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:35:33,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:35:33,682 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:35:33" (1/1) ... [2023-11-29 00:35:33,684 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@609119cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:33, skipping insertion in model container [2023-11-29 00:35:33,684 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:35:33" (1/1) ... [2023-11-29 00:35:33,759 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:35:34,284 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:35:34,299 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 00:35:34,314 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:35:34,426 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:35:34,431 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:35:34,502 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:35:34,540 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:35:34,548 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:35:34,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:34 WrapperNode [2023-11-29 00:35:34,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:35:34,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:35:34,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:35:34,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:35:34,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:34" (1/1) ... [2023-11-29 00:35:34,590 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:34" (1/1) ... [2023-11-29 00:35:34,649 INFO L138 Inliner]: procedures = 180, calls = 350, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1184 [2023-11-29 00:35:34,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:35:34,650 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:35:34,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:35:34,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:35:34,663 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:34" (1/1) ... [2023-11-29 00:35:34,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:34" (1/1) ... [2023-11-29 00:35:34,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:34" (1/1) ... [2023-11-29 00:35:34,799 INFO L175 MemorySlicer]: Split 309 memory accesses to 4 slices as follows [2, 268, 5, 34]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 63 writes are split as follows [0, 58, 1, 4]. [2023-11-29 00:35:34,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:34" (1/1) ... [2023-11-29 00:35:34,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:34" (1/1) ... [2023-11-29 00:35:34,851 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:34" (1/1) ... [2023-11-29 00:35:34,863 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:34" (1/1) ... [2023-11-29 00:35:34,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:34" (1/1) ... [2023-11-29 00:35:34,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:34" (1/1) ... [2023-11-29 00:35:34,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:35:34,892 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:35:34,893 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:35:34,893 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:35:34,894 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:34" (1/1) ... [2023-11-29 00:35:34,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:35:34,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:35:34,929 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:35:34,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:35:34,967 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 00:35:34,967 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 00:35:34,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 00:35:34,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 00:35:34,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 00:35:34,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 00:35:34,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 00:35:34,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 00:35:34,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 00:35:34,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 00:35:34,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 00:35:34,969 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 00:35:34,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 00:35:34,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 00:35:34,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 00:35:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 00:35:34,970 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 00:35:34,970 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 00:35:34,970 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 00:35:34,970 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 00:35:34,971 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2023-11-29 00:35:34,971 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2023-11-29 00:35:34,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 00:35:34,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:35:34,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 00:35:34,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 00:35:34,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 00:35:34,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 00:35:34,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:35:34,972 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 00:35:34,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 00:35:34,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 00:35:34,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 00:35:34,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 00:35:34,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:35:34,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 00:35:34,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 00:35:34,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 00:35:34,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 00:35:34,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 00:35:34,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 00:35:34,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 00:35:34,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 00:35:34,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:35:34,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:35:35,222 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:35:35,225 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:35:35,252 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 00:35:35,293 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 00:35:35,316 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 00:35:35,337 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 00:35:40,257 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:35:40,446 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:35:40,446 INFO L309 CfgBuilder]: Removed 71 assume(true) statements. [2023-11-29 00:35:40,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:35:40 BoogieIcfgContainer [2023-11-29 00:35:40,447 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:35:40,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:35:40,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:35:40,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:35:40,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:35:33" (1/3) ... [2023-11-29 00:35:40,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3015db45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:35:40, skipping insertion in model container [2023-11-29 00:35:40,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:34" (2/3) ... [2023-11-29 00:35:40,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3015db45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:35:40, skipping insertion in model container [2023-11-29 00:35:40,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:35:40" (3/3) ... [2023-11-29 00:35:40,456 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test8-2.i [2023-11-29 00:35:40,477 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:35:40,477 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 640 error locations. [2023-11-29 00:35:40,556 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:35:40,562 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;@405e530c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:35:40,562 INFO L358 AbstractCegarLoop]: Starting to check reachability of 640 error locations. [2023-11-29 00:35:40,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 1187 states, 523 states have (on average 2.5181644359464626) internal successors, (1317), 1177 states have internal predecessors, (1317), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 00:35:40,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 00:35:40,601 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:40,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 00:35:40,603 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:35:40,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:40,608 INFO L85 PathProgramCache]: Analyzing trace with hash 71041, now seen corresponding path program 1 times [2023-11-29 00:35:40,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:35:40,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1308494610] [2023-11-29 00:35:40,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:40,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:35:40,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:35:40,636 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:35:40,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 00:35:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:40,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:35:40,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:35:40,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:35:40,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:35:40,969 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:35:40,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:35:40,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1308494610] [2023-11-29 00:35:40,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1308494610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:35:40,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:35:40,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:35:40,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428563027] [2023-11-29 00:35:40,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:35:40,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:35:40,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:35:41,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:35:41,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:41,005 INFO L87 Difference]: Start difference. First operand has 1187 states, 523 states have (on average 2.5181644359464626) internal successors, (1317), 1177 states have internal predecessors, (1317), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:35:45,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:35:45,327 INFO L93 Difference]: Finished difference Result 1724 states and 1862 transitions. [2023-11-29 00:35:45,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:35:45,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-29 00:35:45,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:35:45,354 INFO L225 Difference]: With dead ends: 1724 [2023-11-29 00:35:45,354 INFO L226 Difference]: Without dead ends: 1723 [2023-11-29 00:35:45,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:45,359 INFO L413 NwaCegarLoop]: 915 mSDtfsCounter, 588 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:35:45,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 1554 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-11-29 00:35:45,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2023-11-29 00:35:45,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1348. [2023-11-29 00:35:45,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 691 states have (on average 2.345875542691751) internal successors, (1621), 1337 states have internal predecessors, (1621), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 00:35:45,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1665 transitions. [2023-11-29 00:35:45,465 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1665 transitions. Word has length 2 [2023-11-29 00:35:45,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:35:45,466 INFO L495 AbstractCegarLoop]: Abstraction has 1348 states and 1665 transitions. [2023-11-29 00:35:45,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:35:45,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1665 transitions. [2023-11-29 00:35:45,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 00:35:45,466 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:45,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 00:35:45,470 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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)] Ended with exit code 0 [2023-11-29 00:35:45,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:35:45,669 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:35:45,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:45,670 INFO L85 PathProgramCache]: Analyzing trace with hash 71040, now seen corresponding path program 1 times [2023-11-29 00:35:45,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:35:45,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904003442] [2023-11-29 00:35:45,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:45,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:35:45,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:35:45,672 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:35:45,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 00:35:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:45,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:35:45,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:35:45,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:35:45,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:35:45,824 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:35:45,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:35:45,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904003442] [2023-11-29 00:35:45,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904003442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:35:45,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:35:45,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:35:45,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831000552] [2023-11-29 00:35:45,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:35:45,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:35:45,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:35:45,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:35:45,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:45,828 INFO L87 Difference]: Start difference. First operand 1348 states and 1665 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:35:48,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:35:48,166 INFO L93 Difference]: Finished difference Result 1533 states and 1859 transitions. [2023-11-29 00:35:48,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:35:48,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-29 00:35:48,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:35:48,176 INFO L225 Difference]: With dead ends: 1533 [2023-11-29 00:35:48,176 INFO L226 Difference]: Without dead ends: 1533 [2023-11-29 00:35:48,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:48,178 INFO L413 NwaCegarLoop]: 695 mSDtfsCounter, 1061 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:35:48,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1065 Valid, 904 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-29 00:35:48,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2023-11-29 00:35:48,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1351. [2023-11-29 00:35:48,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 702 states have (on average 2.3133903133903133) internal successors, (1624), 1339 states have internal predecessors, (1624), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 00:35:48,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1670 transitions. [2023-11-29 00:35:48,224 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1670 transitions. Word has length 2 [2023-11-29 00:35:48,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:35:48,224 INFO L495 AbstractCegarLoop]: Abstraction has 1351 states and 1670 transitions. [2023-11-29 00:35:48,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:35:48,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1670 transitions. [2023-11-29 00:35:48,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 00:35:48,225 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:48,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 00:35:48,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 00:35:48,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:35:48,426 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:35:48,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:48,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1186062026, now seen corresponding path program 1 times [2023-11-29 00:35:48,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:35:48,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703240714] [2023-11-29 00:35:48,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:48,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:35:48,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:35:48,429 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:35:48,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 00:35:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:48,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:35:48,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:35:48,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:35:48,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:35:48,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:35:48,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 00:35:48,669 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:35:48,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:35:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:35:48,693 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:35:48,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:35:48,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703240714] [2023-11-29 00:35:48,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703240714] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:35:48,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:35:48,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:35:48,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256519559] [2023-11-29 00:35:48,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:35:48,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:35:48,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:35:48,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:35:48,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:35:48,697 INFO L87 Difference]: Start difference. First operand 1351 states and 1670 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:35:52,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:35:52,543 INFO L93 Difference]: Finished difference Result 1522 states and 1848 transitions. [2023-11-29 00:35:52,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:35:52,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 00:35:52,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:35:52,550 INFO L225 Difference]: With dead ends: 1522 [2023-11-29 00:35:52,550 INFO L226 Difference]: Without dead ends: 1522 [2023-11-29 00:35:52,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:35:52,552 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 2386 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2392 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:35:52,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2392 Valid, 512 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-29 00:35:52,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2023-11-29 00:35:52,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1167. [2023-11-29 00:35:52,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 529 states have (on average 2.3137996219281662) internal successors, (1224), 1156 states have internal predecessors, (1224), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 00:35:52,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1268 transitions. [2023-11-29 00:35:52,587 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1268 transitions. Word has length 6 [2023-11-29 00:35:52,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:35:52,587 INFO L495 AbstractCegarLoop]: Abstraction has 1167 states and 1268 transitions. [2023-11-29 00:35:52,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:35:52,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1268 transitions. [2023-11-29 00:35:52,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 00:35:52,588 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:52,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:35:52,591 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 00:35:52,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:35:52,792 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:35:52,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:52,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1886782754, now seen corresponding path program 1 times [2023-11-29 00:35:52,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:35:52,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236222148] [2023-11-29 00:35:52,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:52,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:35:52,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:35:52,794 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:35:52,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 00:35:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:52,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:35:52,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:35:52,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:35:52,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:35:52,976 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:35:52,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:35:52,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1236222148] [2023-11-29 00:35:52,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1236222148] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:35:52,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:35:52,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:35:52,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412409932] [2023-11-29 00:35:52,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:35:52,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:35:52,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:35:52,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:35:52,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:52,978 INFO L87 Difference]: Start difference. First operand 1167 states and 1268 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:35:55,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:35:55,474 INFO L93 Difference]: Finished difference Result 1463 states and 1592 transitions. [2023-11-29 00:35:55,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:35:55,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 00:35:55,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:35:55,480 INFO L225 Difference]: With dead ends: 1463 [2023-11-29 00:35:55,480 INFO L226 Difference]: Without dead ends: 1463 [2023-11-29 00:35:55,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:55,482 INFO L413 NwaCegarLoop]: 1009 mSDtfsCounter, 895 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:35:55,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 1370 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 00:35:55,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2023-11-29 00:35:55,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1120. [2023-11-29 00:35:55,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 529 states have (on average 2.223062381852552) internal successors, (1176), 1109 states have internal predecessors, (1176), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 00:35:55,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1220 transitions. [2023-11-29 00:35:55,513 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1220 transitions. Word has length 7 [2023-11-29 00:35:55,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:35:55,513 INFO L495 AbstractCegarLoop]: Abstraction has 1120 states and 1220 transitions. [2023-11-29 00:35:55,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:35:55,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1220 transitions. [2023-11-29 00:35:55,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 00:35:55,514 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:55,514 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:35:55,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 00:35:55,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:35:55,717 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:35:55,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:55,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1886782753, now seen corresponding path program 1 times [2023-11-29 00:35:55,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:35:55,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440475835] [2023-11-29 00:35:55,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:55,718 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:35:55,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:35:55,719 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:35:55,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 00:35:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:35:55,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:35:55,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:35:55,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:35:55,869 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:35:55,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:35:55,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440475835] [2023-11-29 00:35:55,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440475835] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:35:55,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:35:55,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:35:55,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512384553] [2023-11-29 00:35:55,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:35:55,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:35:55,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:35:55,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:35:55,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:55,871 INFO L87 Difference]: Start difference. First operand 1120 states and 1220 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:35:59,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:35:59,591 INFO L93 Difference]: Finished difference Result 1546 states and 1681 transitions. [2023-11-29 00:35:59,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:35:59,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 00:35:59,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:35:59,601 INFO L225 Difference]: With dead ends: 1546 [2023-11-29 00:35:59,601 INFO L226 Difference]: Without dead ends: 1546 [2023-11-29 00:35:59,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:59,602 INFO L413 NwaCegarLoop]: 1190 mSDtfsCounter, 624 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:35:59,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 1690 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-11-29 00:35:59,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2023-11-29 00:35:59,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1322. [2023-11-29 00:35:59,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 739 states have (on average 2.205683355886333) internal successors, (1630), 1309 states have internal predecessors, (1630), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 00:35:59,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1678 transitions. [2023-11-29 00:35:59,640 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1678 transitions. Word has length 7 [2023-11-29 00:35:59,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:35:59,640 INFO L495 AbstractCegarLoop]: Abstraction has 1322 states and 1678 transitions. [2023-11-29 00:35:59,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:35:59,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1678 transitions. [2023-11-29 00:35:59,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 00:35:59,641 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:59,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:35:59,644 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 00:35:59,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:35:59,844 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr533REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:35:59,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:59,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1379275429, now seen corresponding path program 1 times [2023-11-29 00:35:59,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:35:59,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093951805] [2023-11-29 00:35:59,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:59,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:35:59,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:35:59,846 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:35:59,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 00:35:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:59,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:35:59,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:00,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:00,045 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:00,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:00,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093951805] [2023-11-29 00:36:00,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093951805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:00,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:00,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:36:00,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211606374] [2023-11-29 00:36:00,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:00,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:00,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:00,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:00,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:00,047 INFO L87 Difference]: Start difference. First operand 1322 states and 1678 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:01,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:01,676 INFO L93 Difference]: Finished difference Result 2056 states and 2631 transitions. [2023-11-29 00:36:01,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:01,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-29 00:36:01,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:01,685 INFO L225 Difference]: With dead ends: 2056 [2023-11-29 00:36:01,685 INFO L226 Difference]: Without dead ends: 2056 [2023-11-29 00:36:01,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:01,686 INFO L413 NwaCegarLoop]: 1173 mSDtfsCounter, 683 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 2082 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:01,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 2082 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 00:36:01,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2023-11-29 00:36:01,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 1657. [2023-11-29 00:36:01,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1072 states have (on average 2.183768656716418) internal successors, (2341), 1642 states have internal predecessors, (2341), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:36:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2393 transitions. [2023-11-29 00:36:01,722 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2393 transitions. Word has length 10 [2023-11-29 00:36:01,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:01,722 INFO L495 AbstractCegarLoop]: Abstraction has 1657 states and 2393 transitions. [2023-11-29 00:36:01,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:01,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2393 transitions. [2023-11-29 00:36:01,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 00:36:01,723 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:01,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:01,725 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 00:36:01,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:01,924 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr344REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:36:01,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:01,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1068672755, now seen corresponding path program 1 times [2023-11-29 00:36:01,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:01,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20733009] [2023-11-29 00:36:01,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:01,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:01,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:01,926 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:36:01,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 00:36:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:02,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:36:02,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:02,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:02,063 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:02,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:02,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20733009] [2023-11-29 00:36:02,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [20733009] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:02,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:02,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:02,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273254199] [2023-11-29 00:36:02,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:02,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:02,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:02,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:02,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:02,065 INFO L87 Difference]: Start difference. First operand 1657 states and 2393 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:02,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:02,921 INFO L93 Difference]: Finished difference Result 1573 states and 2233 transitions. [2023-11-29 00:36:02,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:02,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 00:36:02,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:02,930 INFO L225 Difference]: With dead ends: 1573 [2023-11-29 00:36:02,930 INFO L226 Difference]: Without dead ends: 1573 [2023-11-29 00:36:02,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:02,931 INFO L413 NwaCegarLoop]: 1024 mSDtfsCounter, 70 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1999 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:02,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1999 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 00:36:02,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2023-11-29 00:36:02,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1573. [2023-11-29 00:36:02,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1012 states have (on average 2.1551383399209487) internal successors, (2181), 1558 states have internal predecessors, (2181), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:36:02,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2233 transitions. [2023-11-29 00:36:02,960 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2233 transitions. Word has length 12 [2023-11-29 00:36:02,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:02,961 INFO L495 AbstractCegarLoop]: Abstraction has 1573 states and 2233 transitions. [2023-11-29 00:36:02,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2233 transitions. [2023-11-29 00:36:02,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 00:36:02,961 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:02,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:02,963 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 00:36:03,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:03,162 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr535REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:36:03,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:03,163 INFO L85 PathProgramCache]: Analyzing trace with hash -34685049, now seen corresponding path program 1 times [2023-11-29 00:36:03,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:03,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361994626] [2023-11-29 00:36:03,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:03,163 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:03,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:03,165 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:36:03,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 00:36:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:03,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:36:03,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:03,363 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:03,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:03,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361994626] [2023-11-29 00:36:03,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361994626] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:03,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:03,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:03,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987746959] [2023-11-29 00:36:03,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:03,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:36:03,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:03,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:36:03,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:03,365 INFO L87 Difference]: Start difference. First operand 1573 states and 2233 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:06,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:06,064 INFO L93 Difference]: Finished difference Result 1953 states and 2475 transitions. [2023-11-29 00:36:06,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:36:06,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-29 00:36:06,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:06,075 INFO L225 Difference]: With dead ends: 1953 [2023-11-29 00:36:06,075 INFO L226 Difference]: Without dead ends: 1953 [2023-11-29 00:36:06,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:36:06,076 INFO L413 NwaCegarLoop]: 1155 mSDtfsCounter, 660 mSDsluCounter, 2929 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 4084 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:06,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 4084 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-29 00:36:06,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2023-11-29 00:36:06,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1575. [2023-11-29 00:36:06,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1014 states have (on average 2.1528599605522682) internal successors, (2183), 1560 states have internal predecessors, (2183), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:36:06,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2235 transitions. [2023-11-29 00:36:06,116 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2235 transitions. Word has length 13 [2023-11-29 00:36:06,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:06,116 INFO L495 AbstractCegarLoop]: Abstraction has 1575 states and 2235 transitions. [2023-11-29 00:36:06,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:06,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2235 transitions. [2023-11-29 00:36:06,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 00:36:06,117 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:06,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:06,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 00:36:06,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:06,318 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr638ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:36:06,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:06,319 INFO L85 PathProgramCache]: Analyzing trace with hash -34678139, now seen corresponding path program 1 times [2023-11-29 00:36:06,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:06,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531129354] [2023-11-29 00:36:06,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:06,319 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:06,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:06,320 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:36:06,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 00:36:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:06,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 00:36:06,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:06,482 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:36:06,483 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:36:06,483 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:36:06,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2023-11-29 00:36:06,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:36:06,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2023-11-29 00:36:06,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:06,563 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:06,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:06,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531129354] [2023-11-29 00:36:06,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531129354] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:06,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:06,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:06,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474289939] [2023-11-29 00:36:06,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:06,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:06,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:06,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:06,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:06,565 INFO L87 Difference]: Start difference. First operand 1575 states and 2235 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:08,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:08,699 INFO L93 Difference]: Finished difference Result 2786 states and 3850 transitions. [2023-11-29 00:36:08,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:08,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-29 00:36:08,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:08,710 INFO L225 Difference]: With dead ends: 2786 [2023-11-29 00:36:08,710 INFO L226 Difference]: Without dead ends: 2786 [2023-11-29 00:36:08,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:08,711 INFO L413 NwaCegarLoop]: 1025 mSDtfsCounter, 1028 mSDsluCounter, 2042 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 3067 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:08,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 3067 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-29 00:36:08,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2023-11-29 00:36:08,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 1574. [2023-11-29 00:36:08,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1013 states have (on average 2.153010858835143) internal successors, (2181), 1559 states have internal predecessors, (2181), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:36:08,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 2233 transitions. [2023-11-29 00:36:08,757 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 2233 transitions. Word has length 13 [2023-11-29 00:36:08,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:08,757 INFO L495 AbstractCegarLoop]: Abstraction has 1574 states and 2233 transitions. [2023-11-29 00:36:08,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:08,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 2233 transitions. [2023-11-29 00:36:08,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 00:36:08,758 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:08,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:08,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 00:36:08,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:08,959 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:36:08,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:08,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1441026091, now seen corresponding path program 1 times [2023-11-29 00:36:08,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:08,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992803703] [2023-11-29 00:36:08,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:08,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:08,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:08,961 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:36:08,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 00:36:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:09,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:36:09,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:09,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:09,190 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:09,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:09,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992803703] [2023-11-29 00:36:09,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992803703] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:09,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:09,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:09,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446815548] [2023-11-29 00:36:09,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:09,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:09,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:09,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:09,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:09,192 INFO L87 Difference]: Start difference. First operand 1574 states and 2233 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:10,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:10,068 INFO L93 Difference]: Finished difference Result 1520 states and 2153 transitions. [2023-11-29 00:36:10,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:10,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 00:36:10,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:10,075 INFO L225 Difference]: With dead ends: 1520 [2023-11-29 00:36:10,075 INFO L226 Difference]: Without dead ends: 1520 [2023-11-29 00:36:10,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:10,076 INFO L413 NwaCegarLoop]: 987 mSDtfsCounter, 70 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1925 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:10,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1925 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 00:36:10,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2023-11-29 00:36:10,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1520. [2023-11-29 00:36:10,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 983 states have (on average 2.1373346897253307) internal successors, (2101), 1505 states have internal predecessors, (2101), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:36:10,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 2153 transitions. [2023-11-29 00:36:10,105 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 2153 transitions. Word has length 15 [2023-11-29 00:36:10,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:10,105 INFO L495 AbstractCegarLoop]: Abstraction has 1520 states and 2153 transitions. [2023-11-29 00:36:10,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:10,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 2153 transitions. [2023-11-29 00:36:10,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 00:36:10,106 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:10,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:10,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-29 00:36:10,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:10,307 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:36:10,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:10,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1846603601, now seen corresponding path program 1 times [2023-11-29 00:36:10,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:10,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887395056] [2023-11-29 00:36:10,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:10,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:10,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:10,309 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:36:10,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 00:36:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:10,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:36:10,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:10,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:10,489 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:10,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:10,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887395056] [2023-11-29 00:36:10,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1887395056] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:10,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:10,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:10,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457520017] [2023-11-29 00:36:10,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:10,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:10,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:10,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:10,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:10,491 INFO L87 Difference]: Start difference. First operand 1520 states and 2153 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:11,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:11,615 INFO L93 Difference]: Finished difference Result 1506 states and 2111 transitions. [2023-11-29 00:36:11,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:11,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-29 00:36:11,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:11,622 INFO L225 Difference]: With dead ends: 1506 [2023-11-29 00:36:11,622 INFO L226 Difference]: Without dead ends: 1506 [2023-11-29 00:36:11,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:11,623 INFO L413 NwaCegarLoop]: 956 mSDtfsCounter, 58 mSDsluCounter, 1888 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2844 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:11,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2844 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 00:36:11,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2023-11-29 00:36:11,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1504. [2023-11-29 00:36:11,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 981 states have (on average 2.09683995922528) internal successors, (2057), 1489 states have internal predecessors, (2057), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:36:11,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 2109 transitions. [2023-11-29 00:36:11,657 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 2109 transitions. Word has length 17 [2023-11-29 00:36:11,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:11,657 INFO L495 AbstractCegarLoop]: Abstraction has 1504 states and 2109 transitions. [2023-11-29 00:36:11,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:11,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 2109 transitions. [2023-11-29 00:36:11,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 00:36:11,658 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:11,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:11,663 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 00:36:11,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:11,860 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:36:11,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:11,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1743907683, now seen corresponding path program 1 times [2023-11-29 00:36:11,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:11,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758491764] [2023-11-29 00:36:11,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:11,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:11,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:11,862 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:36:11,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 00:36:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:12,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:36:12,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:12,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:36:12,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:12,117 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:12,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:12,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758491764] [2023-11-29 00:36:12,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758491764] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:12,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:12,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:12,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739684044] [2023-11-29 00:36:12,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:12,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:12,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:12,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:12,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:12,120 INFO L87 Difference]: Start difference. First operand 1504 states and 2109 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:14,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:14,517 INFO L93 Difference]: Finished difference Result 1514 states and 2117 transitions. [2023-11-29 00:36:14,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:14,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 00:36:14,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:14,524 INFO L225 Difference]: With dead ends: 1514 [2023-11-29 00:36:14,524 INFO L226 Difference]: Without dead ends: 1514 [2023-11-29 00:36:14,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:14,525 INFO L413 NwaCegarLoop]: 632 mSDtfsCounter, 788 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:14,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 1296 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 00:36:14,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2023-11-29 00:36:14,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1500. [2023-11-29 00:36:14,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 981 states have (on average 2.08868501529052) internal successors, (2049), 1485 states have internal predecessors, (2049), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:36:14,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 2101 transitions. [2023-11-29 00:36:14,545 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 2101 transitions. Word has length 31 [2023-11-29 00:36:14,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:14,545 INFO L495 AbstractCegarLoop]: Abstraction has 1500 states and 2101 transitions. [2023-11-29 00:36:14,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:14,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 2101 transitions. [2023-11-29 00:36:14,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 00:36:14,547 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:14,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:14,550 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 00:36:14,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:14,747 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:36:14,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:14,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1743907682, now seen corresponding path program 1 times [2023-11-29 00:36:14,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:14,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578922804] [2023-11-29 00:36:14,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:14,748 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:14,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:14,749 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:36:14,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 00:36:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:14,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:36:14,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:14,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:36:15,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:15,190 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:15,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:15,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578922804] [2023-11-29 00:36:15,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578922804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:15,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:15,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:15,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665799674] [2023-11-29 00:36:15,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:15,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:15,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:15,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:15,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:15,192 INFO L87 Difference]: Start difference. First operand 1500 states and 2101 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:19,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:19,567 INFO L93 Difference]: Finished difference Result 1697 states and 2097 transitions. [2023-11-29 00:36:19,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:19,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 00:36:19,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:19,575 INFO L225 Difference]: With dead ends: 1697 [2023-11-29 00:36:19,575 INFO L226 Difference]: Without dead ends: 1697 [2023-11-29 00:36:19,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:19,575 INFO L413 NwaCegarLoop]: 1170 mSDtfsCounter, 519 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 1583 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 2395 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:19,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 2395 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1583 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-11-29 00:36:19,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2023-11-29 00:36:19,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1496. [2023-11-29 00:36:19,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1496 states, 981 states have (on average 2.0805300713557595) internal successors, (2041), 1481 states have internal predecessors, (2041), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:36:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2093 transitions. [2023-11-29 00:36:19,594 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2093 transitions. Word has length 31 [2023-11-29 00:36:19,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:19,595 INFO L495 AbstractCegarLoop]: Abstraction has 1496 states and 2093 transitions. [2023-11-29 00:36:19,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:19,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2093 transitions. [2023-11-29 00:36:19,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 00:36:19,596 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:19,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:19,600 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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)] Ended with exit code 0 [2023-11-29 00:36:19,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:19,797 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:36:19,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:19,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1245945326, now seen corresponding path program 1 times [2023-11-29 00:36:19,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:19,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844514871] [2023-11-29 00:36:19,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:19,798 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:19,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:19,799 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:36:19,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 00:36:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:20,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:36:20,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:20,060 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:20,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:20,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844514871] [2023-11-29 00:36:20,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844514871] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:20,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:20,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:20,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128808850] [2023-11-29 00:36:20,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:20,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:20,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:20,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:20,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:20,062 INFO L87 Difference]: Start difference. First operand 1496 states and 2093 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:21,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:21,268 INFO L93 Difference]: Finished difference Result 1484 states and 2073 transitions. [2023-11-29 00:36:21,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:21,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-11-29 00:36:21,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:21,276 INFO L225 Difference]: With dead ends: 1484 [2023-11-29 00:36:21,276 INFO L226 Difference]: Without dead ends: 1484 [2023-11-29 00:36:21,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:21,277 INFO L413 NwaCegarLoop]: 950 mSDtfsCounter, 23 mSDsluCounter, 1880 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2830 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:21,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2830 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 00:36:21,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2023-11-29 00:36:21,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1484. [2023-11-29 00:36:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 969 states have (on average 2.085655314757482) internal successors, (2021), 1469 states have internal predecessors, (2021), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:36:21,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 2073 transitions. [2023-11-29 00:36:21,296 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 2073 transitions. Word has length 50 [2023-11-29 00:36:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:21,296 INFO L495 AbstractCegarLoop]: Abstraction has 1484 states and 2073 transitions. [2023-11-29 00:36:21,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:21,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 2073 transitions. [2023-11-29 00:36:21,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 00:36:21,297 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:21,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:21,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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-29 00:36:21,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:21,498 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:36:21,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:21,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1302219504, now seen corresponding path program 1 times [2023-11-29 00:36:21,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:21,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235489730] [2023-11-29 00:36:21,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:21,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:21,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:21,500 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:36:21,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 00:36:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:21,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:36:21,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:21,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:36:21,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:36:22,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:36:22,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 00:36:22,310 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:36:22,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:36:22,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:22,322 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:22,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:22,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235489730] [2023-11-29 00:36:22,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235489730] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:22,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:22,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:22,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561522173] [2023-11-29 00:36:22,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:22,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:22,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:22,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:22,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:22,324 INFO L87 Difference]: Start difference. First operand 1484 states and 2073 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:24,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:24,756 INFO L93 Difference]: Finished difference Result 1457 states and 2047 transitions. [2023-11-29 00:36:24,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:24,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-11-29 00:36:24,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:24,764 INFO L225 Difference]: With dead ends: 1457 [2023-11-29 00:36:24,764 INFO L226 Difference]: Without dead ends: 1457 [2023-11-29 00:36:24,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:24,765 INFO L413 NwaCegarLoop]: 458 mSDtfsCounter, 1389 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1394 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:24,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1394 Valid, 635 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 00:36:24,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2023-11-29 00:36:24,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1131. [2023-11-29 00:36:24,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 659 states have (on average 1.9817905918057663) internal successors, (1306), 1119 states have internal predecessors, (1306), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 00:36:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1352 transitions. [2023-11-29 00:36:24,782 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1352 transitions. Word has length 54 [2023-11-29 00:36:24,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:24,783 INFO L495 AbstractCegarLoop]: Abstraction has 1131 states and 1352 transitions. [2023-11-29 00:36:24,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:24,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1352 transitions. [2023-11-29 00:36:24,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 00:36:24,784 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:24,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:24,790 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 00:36:24,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:24,984 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:36:24,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:24,985 INFO L85 PathProgramCache]: Analyzing trace with hash -830805638, now seen corresponding path program 1 times [2023-11-29 00:36:24,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:24,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963927091] [2023-11-29 00:36:24,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:24,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:24,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:24,986 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:36:24,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 00:36:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:25,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 00:36:25,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:25,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:36:25,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:36:25,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 00:36:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:25,314 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:25,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:25,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963927091] [2023-11-29 00:36:25,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963927091] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:25,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:25,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:25,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226406608] [2023-11-29 00:36:25,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:25,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:36:25,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:25,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:36:25,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:25,316 INFO L87 Difference]: Start difference. First operand 1131 states and 1352 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:28,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:28,497 INFO L93 Difference]: Finished difference Result 1130 states and 1351 transitions. [2023-11-29 00:36:28,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:36:28,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-11-29 00:36:28,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:28,502 INFO L225 Difference]: With dead ends: 1130 [2023-11-29 00:36:28,502 INFO L226 Difference]: Without dead ends: 1130 [2023-11-29 00:36:28,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:36:28,503 INFO L413 NwaCegarLoop]: 922 mSDtfsCounter, 3 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2468 SdHoareTripleChecker+Invalid, 1656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:28,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2468 Invalid, 1656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1655 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-29 00:36:28,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2023-11-29 00:36:28,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1130. [2023-11-29 00:36:28,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 659 states have (on average 1.9802731411229135) internal successors, (1305), 1118 states have internal predecessors, (1305), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 00:36:28,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1351 transitions. [2023-11-29 00:36:28,516 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1351 transitions. Word has length 58 [2023-11-29 00:36:28,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:28,517 INFO L495 AbstractCegarLoop]: Abstraction has 1130 states and 1351 transitions. [2023-11-29 00:36:28,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:28,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1351 transitions. [2023-11-29 00:36:28,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 00:36:28,518 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:28,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:28,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 00:36:28,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:28,719 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:36:28,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:28,719 INFO L85 PathProgramCache]: Analyzing trace with hash -830805637, now seen corresponding path program 1 times [2023-11-29 00:36:28,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:28,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [44802668] [2023-11-29 00:36:28,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:28,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:28,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:28,720 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:36:28,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 00:36:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:29,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 00:36:29,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:29,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:36:29,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 00:36:29,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:36:29,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 21 treesize of output 9 [2023-11-29 00:36:29,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:29,093 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:29,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:29,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [44802668] [2023-11-29 00:36:29,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [44802668] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:29,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:29,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:29,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818065995] [2023-11-29 00:36:29,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:29,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:36:29,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:29,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:36:29,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:29,095 INFO L87 Difference]: Start difference. First operand 1130 states and 1351 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:33,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:33,140 INFO L93 Difference]: Finished difference Result 1129 states and 1350 transitions. [2023-11-29 00:36:33,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:36:33,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-11-29 00:36:33,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:33,145 INFO L225 Difference]: With dead ends: 1129 [2023-11-29 00:36:33,145 INFO L226 Difference]: Without dead ends: 1129 [2023-11-29 00:36:33,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:36:33,146 INFO L413 NwaCegarLoop]: 922 mSDtfsCounter, 1 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 1594 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2527 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:33,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2527 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1594 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-11-29 00:36:33,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2023-11-29 00:36:33,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1129. [2023-11-29 00:36:33,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 658 states have (on average 1.9817629179331306) internal successors, (1304), 1117 states have internal predecessors, (1304), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 00:36:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1350 transitions. [2023-11-29 00:36:33,160 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1350 transitions. Word has length 58 [2023-11-29 00:36:33,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:33,160 INFO L495 AbstractCegarLoop]: Abstraction has 1129 states and 1350 transitions. [2023-11-29 00:36:33,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1350 transitions. [2023-11-29 00:36:33,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 00:36:33,161 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:33,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:33,168 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 00:36:33,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:33,362 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:36:33,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:33,362 INFO L85 PathProgramCache]: Analyzing trace with hash 2042839326, now seen corresponding path program 1 times [2023-11-29 00:36:33,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:33,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [581717879] [2023-11-29 00:36:33,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:33,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:33,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:33,364 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:36:33,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 00:36:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:33,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:36:33,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:33,670 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:33,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:33,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [581717879] [2023-11-29 00:36:33,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [581717879] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:33,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:33,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:33,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807810885] [2023-11-29 00:36:33,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:33,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:33,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:33,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:33,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:33,672 INFO L87 Difference]: Start difference. First operand 1129 states and 1350 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 00:36:34,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:34,764 INFO L93 Difference]: Finished difference Result 1131 states and 1353 transitions. [2023-11-29 00:36:34,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:34,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2023-11-29 00:36:34,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:34,769 INFO L225 Difference]: With dead ends: 1131 [2023-11-29 00:36:34,769 INFO L226 Difference]: Without dead ends: 1131 [2023-11-29 00:36:34,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:34,770 INFO L413 NwaCegarLoop]: 922 mSDtfsCounter, 1 mSDsluCounter, 1841 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2763 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:34,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2763 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 00:36:34,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2023-11-29 00:36:34,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1131. [2023-11-29 00:36:34,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 659 states have (on average 1.9817905918057663) internal successors, (1306), 1119 states have internal predecessors, (1306), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 00:36:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1353 transitions. [2023-11-29 00:36:34,789 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1353 transitions. Word has length 64 [2023-11-29 00:36:34,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:34,789 INFO L495 AbstractCegarLoop]: Abstraction has 1131 states and 1353 transitions. [2023-11-29 00:36:34,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 00:36:34,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1353 transitions. [2023-11-29 00:36:34,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-29 00:36:34,790 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:34,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:34,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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-29 00:36:34,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:34,991 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:36:34,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:34,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1484445806, now seen corresponding path program 1 times [2023-11-29 00:36:34,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:34,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279261585] [2023-11-29 00:36:34,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:34,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:34,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:34,993 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:36:34,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 00:36:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:35,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:36:35,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:35,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:35,306 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:36:35,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:35,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:35,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279261585] [2023-11-29 00:36:35,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279261585] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:36:35,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:36:35,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 00:36:35,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297651387] [2023-11-29 00:36:35,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:36:35,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:36:35,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:35,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:36:35,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:36:35,370 INFO L87 Difference]: Start difference. First operand 1131 states and 1353 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:36:37,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:37,479 INFO L93 Difference]: Finished difference Result 1140 states and 1367 transitions. [2023-11-29 00:36:37,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:36:37,481 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2023-11-29 00:36:37,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:37,483 INFO L225 Difference]: With dead ends: 1140 [2023-11-29 00:36:37,483 INFO L226 Difference]: Without dead ends: 1140 [2023-11-29 00:36:37,483 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-29 00:36:37,484 INFO L413 NwaCegarLoop]: 921 mSDtfsCounter, 6 mSDsluCounter, 4595 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5516 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:37,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5516 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 00:36:37,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2023-11-29 00:36:37,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1139. [2023-11-29 00:36:37,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 666 states have (on average 1.9804804804804805) internal successors, (1319), 1126 states have internal predecessors, (1319), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 00:36:37,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1366 transitions. [2023-11-29 00:36:37,502 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1366 transitions. Word has length 65 [2023-11-29 00:36:37,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:37,503 INFO L495 AbstractCegarLoop]: Abstraction has 1139 states and 1366 transitions. [2023-11-29 00:36:37,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:36:37,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1366 transitions. [2023-11-29 00:36:37,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 00:36:37,504 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:37,504 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:37,510 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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-29 00:36:37,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:37,704 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:36:37,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:37,705 INFO L85 PathProgramCache]: Analyzing trace with hash -834453986, now seen corresponding path program 2 times [2023-11-29 00:36:37,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:37,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90532004] [2023-11-29 00:36:37,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:36:37,705 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:37,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:37,706 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:36:37,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-29 00:36:38,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:36:38,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:36:38,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 00:36:38,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:38,182 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:36:38,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:38,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:38,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90532004] [2023-11-29 00:36:38,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90532004] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:36:38,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:36:38,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 00:36:38,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450135021] [2023-11-29 00:36:38,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:36:38,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 00:36:38,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:38,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 00:36:38,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 00:36:38,323 INFO L87 Difference]: Start difference. First operand 1139 states and 1366 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:36:40,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:40,899 INFO L93 Difference]: Finished difference Result 1154 states and 1388 transitions. [2023-11-29 00:36:40,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 00:36:40,900 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2023-11-29 00:36:40,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:40,902 INFO L225 Difference]: With dead ends: 1154 [2023-11-29 00:36:40,902 INFO L226 Difference]: Without dead ends: 1152 [2023-11-29 00:36:40,903 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-29 00:36:40,903 INFO L413 NwaCegarLoop]: 921 mSDtfsCounter, 13 mSDsluCounter, 4600 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 5521 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:40,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 5521 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-29 00:36:40,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2023-11-29 00:36:40,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1148. [2023-11-29 00:36:40,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 675 states have (on average 1.9718518518518517) internal successors, (1331), 1135 states have internal predecessors, (1331), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 00:36:40,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1378 transitions. [2023-11-29 00:36:40,918 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1378 transitions. Word has length 68 [2023-11-29 00:36:40,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:40,919 INFO L495 AbstractCegarLoop]: Abstraction has 1148 states and 1378 transitions. [2023-11-29 00:36:40,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:36:40,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1378 transitions. [2023-11-29 00:36:40,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 00:36:40,919 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:40,919 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:40,926 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-11-29 00:36:41,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:41,120 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:36:41,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:41,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1472001634, now seen corresponding path program 3 times [2023-11-29 00:36:41,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:41,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630738326] [2023-11-29 00:36:41,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:36:41,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:41,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:41,122 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:36:41,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-29 00:36:41,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 00:36:41,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:36:41,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 00:36:41,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:42,033 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:42,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:36:42,707 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:42,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:42,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630738326] [2023-11-29 00:36:42,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630738326] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:36:42,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:36:42,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 00:36:42,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146164199] [2023-11-29 00:36:42,708 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:36:42,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 00:36:42,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:42,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 00:36:42,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 00:36:42,711 INFO L87 Difference]: Start difference. First operand 1148 states and 1378 transitions. Second operand has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:36:49,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:49,761 INFO L93 Difference]: Finished difference Result 1178 states and 1428 transitions. [2023-11-29 00:36:49,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 00:36:49,762 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2023-11-29 00:36:49,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:49,764 INFO L225 Difference]: With dead ends: 1178 [2023-11-29 00:36:49,764 INFO L226 Difference]: Without dead ends: 1175 [2023-11-29 00:36:49,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 00:36:49,766 INFO L413 NwaCegarLoop]: 920 mSDtfsCounter, 24 mSDsluCounter, 11942 mSDsCounter, 0 mSdLazyCounter, 2228 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 12862 SdHoareTripleChecker+Invalid, 2253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:49,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 12862 Invalid, 2253 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 2228 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2023-11-29 00:36:49,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2023-11-29 00:36:49,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1166. [2023-11-29 00:36:49,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 693 states have (on average 1.953823953823954) internal successors, (1354), 1153 states have internal predecessors, (1354), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 00:36:49,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1401 transitions. [2023-11-29 00:36:49,789 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1401 transitions. Word has length 74 [2023-11-29 00:36:49,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:49,789 INFO L495 AbstractCegarLoop]: Abstraction has 1166 states and 1401 transitions. [2023-11-29 00:36:49,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:36:49,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1401 transitions. [2023-11-29 00:36:49,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 00:36:49,790 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:49,790 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:49,798 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-11-29 00:36:49,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:49,991 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:36:49,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:49,991 INFO L85 PathProgramCache]: Analyzing trace with hash -968441698, now seen corresponding path program 4 times [2023-11-29 00:36:49,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:49,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469740391] [2023-11-29 00:36:49,992 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:36:49,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:36:49,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:49,993 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:36:49,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-11-29 00:36:50,351 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:36:50,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:36:50,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 00:36:50,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:50,731 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:50,731 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:36:52,309 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:52,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:52,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469740391] [2023-11-29 00:36:52,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469740391] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:36:52,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:36:52,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 00:36:52,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182051607] [2023-11-29 00:36:52,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:36:52,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 00:36:52,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:52,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 00:36:52,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 00:36:52,313 INFO L87 Difference]: Start difference. First operand 1166 states and 1401 transitions. Second operand has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:37:07,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:37:07,389 INFO L93 Difference]: Finished difference Result 1223 states and 1490 transitions. [2023-11-29 00:37:07,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 00:37:07,390 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2023-11-29 00:37:07,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:37:07,392 INFO L225 Difference]: With dead ends: 1223 [2023-11-29 00:37:07,392 INFO L226 Difference]: Without dead ends: 1221 [2023-11-29 00:37:07,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 00:37:07,398 INFO L413 NwaCegarLoop]: 921 mSDtfsCounter, 47 mSDsluCounter, 21160 mSDsCounter, 0 mSdLazyCounter, 4913 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 22081 SdHoareTripleChecker+Invalid, 4961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 4913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:37:07,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 22081 Invalid, 4961 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 4913 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2023-11-29 00:37:07,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2023-11-29 00:37:07,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1200. [2023-11-29 00:37:07,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 727 states have (on average 1.9257221458046767) internal successors, (1400), 1187 states have internal predecessors, (1400), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 00:37:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1447 transitions. [2023-11-29 00:37:07,420 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1447 transitions. Word has length 86 [2023-11-29 00:37:07,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:37:07,420 INFO L495 AbstractCegarLoop]: Abstraction has 1200 states and 1447 transitions. [2023-11-29 00:37:07,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:37:07,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1447 transitions. [2023-11-29 00:37:07,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 00:37:07,421 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:37:07,421 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:37:07,428 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-11-29 00:37:07,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:37:07,622 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:37:07,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:07,622 INFO L85 PathProgramCache]: Analyzing trace with hash 844996638, now seen corresponding path program 5 times [2023-11-29 00:37:07,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:37:07,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260838198] [2023-11-29 00:37:07,623 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 00:37:07,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:37:07,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:37:07,624 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:37:07,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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-29 00:37:09,027 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 00:37:09,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:37:09,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 00:37:09,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:37:09,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:37:09,179 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:37:09,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:37:09,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:37:09,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 00:37:10,306 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:37:10,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:37:10,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 00:37:10,401 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:37:10,401 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:37:14,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:37:14,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260838198] [2023-11-29 00:37:14,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260838198] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:37:14,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [160090969] [2023-11-29 00:37:14,882 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 00:37:14,882 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:37:14,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:37:14,883 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:37:14,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-11-29 00:38:21,877 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 00:38:21,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:38:22,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 00:38:22,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:38:22,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:38:22,469 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:38:22,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:38:22,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:38:22,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 00:38:23,824 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:38:23,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:38:23,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 00:38:23,968 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:38:23,968 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:38:28,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [160090969] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:38:28,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:38:28,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 00:38:28,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138738027] [2023-11-29 00:38:28,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:38:28,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 00:38:28,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:38:28,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 00:38:28,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=185, Unknown=2, NotChecked=0, Total=240 [2023-11-29 00:38:28,468 INFO L87 Difference]: Start difference. First operand 1200 states and 1447 transitions. Second operand has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:38:39,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:38:39,497 INFO L93 Difference]: Finished difference Result 1578 states and 1946 transitions. [2023-11-29 00:38:39,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:38:39,499 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-11-29 00:38:39,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:38:39,501 INFO L225 Difference]: With dead ends: 1578 [2023-11-29 00:38:39,501 INFO L226 Difference]: Without dead ends: 1576 [2023-11-29 00:38:39,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 204 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=62, Invalid=208, Unknown=2, NotChecked=0, Total=272 [2023-11-29 00:38:39,502 INFO L413 NwaCegarLoop]: 622 mSDtfsCounter, 1623 mSDsluCounter, 3512 mSDsCounter, 0 mSdLazyCounter, 4272 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 4134 SdHoareTripleChecker+Invalid, 4286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 4272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:38:39,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1628 Valid, 4134 Invalid, 4286 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [14 Valid, 4272 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2023-11-29 00:38:39,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2023-11-29 00:38:39,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1199. [2023-11-29 00:38:39,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 727 states have (on average 1.9188445667125171) internal successors, (1395), 1186 states have internal predecessors, (1395), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 00:38:39,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1442 transitions. [2023-11-29 00:38:39,519 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1442 transitions. Word has length 108 [2023-11-29 00:38:39,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:38:39,519 INFO L495 AbstractCegarLoop]: Abstraction has 1199 states and 1442 transitions. [2023-11-29 00:38:39,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:38:39,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1442 transitions. [2023-11-29 00:38:39,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 00:38:39,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:38:39,537 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:38:39,549 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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-29 00:38:39,772 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2023-11-29 00:38:39,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 00:38:39,938 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:38:39,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:38:39,938 INFO L85 PathProgramCache]: Analyzing trace with hash 844996639, now seen corresponding path program 1 times [2023-11-29 00:38:39,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:38:39,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166270056] [2023-11-29 00:38:39,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:38:39,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:38:39,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:38:39,940 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:38:39,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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-29 00:38:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:38:40,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-29 00:38:40,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:38:40,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:38:40,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:38:40,894 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:38:40,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:38:40,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 00:38:40,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:38:41,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 00:38:41,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 00:38:41,970 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:38:41,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 00:38:41,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 00:38:42,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 00:38:42,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 00:38:42,095 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:38:42,095 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:38:43,605 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3045 (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_3046) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3045) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3046 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3046) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-11-29 00:38:43,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:38:43,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166270056] [2023-11-29 00:38:43,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166270056] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:38:43,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [216730939] [2023-11-29 00:38:43,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:38:43,614 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:38:43,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:38:43,615 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:38:43,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-11-29 00:40:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:34,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-29 00:40:34,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:40:34,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:40:34,540 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:40:34,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:40:34,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:40:34,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:40:34,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:40:34,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 00:40:34,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:40:35,735 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:40:35,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:40:35,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:40:35,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 00:40:35,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:40:35,831 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:40:35,832 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:40:37,282 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3601 (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_3601) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv16 32)) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3600 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3601 (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_3601) |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_3600) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 00:40:37,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [216730939] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:40:37,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:40:37,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 00:40:37,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926847848] [2023-11-29 00:40:37,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:40:37,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 00:40:37,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:40:37,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 00:40:37,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=172, Unknown=2, NotChecked=54, Total=272 [2023-11-29 00:40:37,295 INFO L87 Difference]: Start difference. First operand 1199 states and 1442 transitions. Second operand has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:40:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:40:49,405 INFO L93 Difference]: Finished difference Result 1575 states and 1941 transitions. [2023-11-29 00:40:49,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:40:49,407 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-11-29 00:40:49,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:40:49,410 INFO L225 Difference]: With dead ends: 1575 [2023-11-29 00:40:49,410 INFO L226 Difference]: Without dead ends: 1575 [2023-11-29 00:40:49,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2023-11-29 00:40:49,411 INFO L413 NwaCegarLoop]: 621 mSDtfsCounter, 1635 mSDsluCounter, 2128 mSDsCounter, 0 mSdLazyCounter, 4189 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1640 SdHoareTripleChecker+Valid, 2749 SdHoareTripleChecker+Invalid, 4207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:40:49,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1640 Valid, 2749 Invalid, 4207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4189 Invalid, 0 Unknown, 0 Unchecked, 11.8s Time] [2023-11-29 00:40:49,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2023-11-29 00:40:49,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1198. [2023-11-29 00:40:49,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 727 states have (on average 1.9174690508940853) internal successors, (1394), 1185 states have internal predecessors, (1394), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 00:40:49,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1441 transitions. [2023-11-29 00:40:49,429 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1441 transitions. Word has length 108 [2023-11-29 00:40:49,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:40:49,429 INFO L495 AbstractCegarLoop]: Abstraction has 1198 states and 1441 transitions. [2023-11-29 00:40:49,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:40:49,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1441 transitions. [2023-11-29 00:40:49,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 00:40:49,436 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:40:49,436 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:40:49,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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)] Forceful destruction successful, exit code 0 [2023-11-29 00:40:49,678 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2023-11-29 00:40:49,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 00:40:49,837 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:40:49,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:40:49,839 INFO L85 PathProgramCache]: Analyzing trace with hash 294606094, now seen corresponding path program 1 times [2023-11-29 00:40:49,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:40:49,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490035796] [2023-11-29 00:40:49,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:40:49,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:40:49,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:40:49,841 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:40:49,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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-29 00:40:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:50,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 00:40:50,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:40:50,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:40:50,891 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:40:50,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:40:50,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:40:51,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 00:40:52,004 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:40:52,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:40:52,110 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:40:52,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:40:52,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 00:40:52,164 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:40:52,165 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:40:52,228 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4025 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4025) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 00:40:52,243 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4025 (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_4025) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 00:40:52,748 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4071 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4025 (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_4071))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4025)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:40:52,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:40:52,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490035796] [2023-11-29 00:40:52,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490035796] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:40:52,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1165956314] [2023-11-29 00:40:52,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:40:52,752 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:40:52,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:40:52,753 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:40:52,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-29 00:40:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:55,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 00:40:55,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:40:55,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:40:55,784 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:40:55,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:40:55,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:40:56,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 00:40:57,133 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:40:57,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:40:57,334 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:40:57,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:40:57,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 00:40:57,368 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:40:57,368 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:41:01,468 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4495 (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_4495) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:41:01,937 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4541 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4541))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4495)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 00:41:01,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1165956314] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:41:01,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:41:01,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 00:41:01,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724897022] [2023-11-29 00:41:01,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:41:01,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 00:41:01,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:41:01,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 00:41:01,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=243, Unknown=7, NotChecked=180, Total=506 [2023-11-29 00:41:01,943 INFO L87 Difference]: Start difference. First operand 1198 states and 1441 transitions. Second operand has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:41:11,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:11,162 INFO L93 Difference]: Finished difference Result 1574 states and 1940 transitions. [2023-11-29 00:41:11,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:41:11,165 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2023-11-29 00:41:11,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:11,168 INFO L225 Difference]: With dead ends: 1574 [2023-11-29 00:41:11,168 INFO L226 Difference]: Without dead ends: 1574 [2023-11-29 00:41:11,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=85, Invalid=270, Unknown=7, NotChecked=190, Total=552 [2023-11-29 00:41:11,169 INFO L413 NwaCegarLoop]: 621 mSDtfsCounter, 1007 mSDsluCounter, 2506 mSDsCounter, 0 mSdLazyCounter, 3102 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 3127 SdHoareTripleChecker+Invalid, 3109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:41:11,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 3127 Invalid, 3109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3102 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2023-11-29 00:41:11,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2023-11-29 00:41:11,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1197. [2023-11-29 00:41:11,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 727 states have (on average 1.9160935350756534) internal successors, (1393), 1184 states have internal predecessors, (1393), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 00:41:11,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1440 transitions. [2023-11-29 00:41:11,186 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1440 transitions. Word has length 110 [2023-11-29 00:41:11,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:11,187 INFO L495 AbstractCegarLoop]: Abstraction has 1197 states and 1440 transitions. [2023-11-29 00:41:11,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:41:11,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1440 transitions. [2023-11-29 00:41:11,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 00:41:11,188 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:11,188 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:41:11,203 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-11-29 00:41:11,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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-29 00:41:11,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:41:11,589 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:41:11,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:11,589 INFO L85 PathProgramCache]: Analyzing trace with hash 294606095, now seen corresponding path program 1 times [2023-11-29 00:41:11,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:41:11,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17144514] [2023-11-29 00:41:11,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:11,590 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:41:11,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:41:11,591 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:41:11,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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-29 00:41:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:12,582 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-29 00:41:12,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:41:12,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:41:12,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:41:12,756 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:41:12,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:41:12,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 00:41:12,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:41:12,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 00:41:12,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 00:41:13,806 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:41:13,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 00:41:13,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 00:41:13,951 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:41:13,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 00:41:13,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 00:41:13,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 00:41:13,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 00:41:14,022 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:41:14,022 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:41:14,206 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5012 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-11-29 00:41:14,250 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_5011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5012 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_5012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 00:41:15,944 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5103 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5011 (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_5104) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5103) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5103 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5012 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5103))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5104) .cse2 v_ArrVal_5011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 00:41:15,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:41:15,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17144514] [2023-11-29 00:41:15,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17144514] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:41:15,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1445412577] [2023-11-29 00:41:15,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:15,956 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:41:15,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:41:15,957 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:41:15,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 00:43:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:03,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-29 00:43:03,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:43:03,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:43:04,008 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:43:04,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:43:04,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:43:04,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:43:04,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:43:04,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 00:43:04,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:43:05,136 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:43:05,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:43:05,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:43:05,356 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:43:05,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 50 treesize of output 45 [2023-11-29 00:43:05,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:43:05,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 00:43:05,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:43:05,403 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:43:05,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:43:05,472 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5575 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5574 (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_5575) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5574) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5575 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5575) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd .cse1 (_ bv8 32))))))) is different from false [2023-11-29 00:43:05,514 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_5575 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5575) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5575 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5574 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5575) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_5574) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 00:43:07,149 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5575 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5574 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5667))) (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~mem38#1.base| v_ArrVal_5666) .cse0 v_ArrVal_5575) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5574) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5575 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5666 (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_5666) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5667) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5575) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) is different from false [2023-11-29 00:43:07,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1445412577] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:43:07,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:43:07,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 00:43:07,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900480423] [2023-11-29 00:43:07,166 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:43:07,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 00:43:07,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:43:07,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 00:43:07,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=228, Unknown=6, NotChecked=210, Total=506 [2023-11-29 00:43:07,167 INFO L87 Difference]: Start difference. First operand 1197 states and 1440 transitions. Second operand has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:43:22,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:43:22,580 INFO L93 Difference]: Finished difference Result 1573 states and 1939 transitions. [2023-11-29 00:43:22,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:43:22,582 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2023-11-29 00:43:22,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:43:22,586 INFO L225 Difference]: With dead ends: 1573 [2023-11-29 00:43:22,586 INFO L226 Difference]: Without dead ends: 1573 [2023-11-29 00:43:22,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=105, Invalid=375, Unknown=6, NotChecked=270, Total=756 [2023-11-29 00:43:22,587 INFO L413 NwaCegarLoop]: 620 mSDtfsCounter, 1012 mSDsluCounter, 2966 mSDsCounter, 0 mSdLazyCounter, 5745 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 3586 SdHoareTripleChecker+Invalid, 5755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 5745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:43:22,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 3586 Invalid, 5755 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10 Valid, 5745 Invalid, 0 Unknown, 0 Unchecked, 15.0s Time] [2023-11-29 00:43:22,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2023-11-29 00:43:22,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1196. [2023-11-29 00:43:22,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 727 states have (on average 1.9147180192572215) internal successors, (1392), 1183 states have internal predecessors, (1392), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 00:43:22,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1439 transitions. [2023-11-29 00:43:22,608 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1439 transitions. Word has length 110 [2023-11-29 00:43:22,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:43:22,609 INFO L495 AbstractCegarLoop]: Abstraction has 1196 states and 1439 transitions. [2023-11-29 00:43:22,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:43:22,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1439 transitions. [2023-11-29 00:43:22,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 00:43:22,611 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:43:22,611 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:43:22,621 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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-29 00:43:22,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-11-29 00:43:23,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 00:43:23,012 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:43:23,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:43:23,012 INFO L85 PathProgramCache]: Analyzing trace with hash -349734824, now seen corresponding path program 1 times [2023-11-29 00:43:23,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:43:23,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163857321] [2023-11-29 00:43:23,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:43:23,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:43:23,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:43:23,014 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:43:23,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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-29 00:43:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:24,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 00:43:24,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:43:24,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:43:24,261 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:43:24,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:43:24,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:43:24,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 00:43:25,589 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:43:25,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:43:25,735 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:43:25,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:43:25,853 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:43:25,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:43:25,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 00:43:25,923 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:43:25,923 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:43:25,999 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6107 (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_6107) |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-29 00:43:26,013 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6107 (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_6107) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 00:43:26,030 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6107 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6106 (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_6106))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6107)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 00:43:26,047 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6107 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6106 (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_6106))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6107)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:43:26,548 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6153 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6107 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6106 (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~mem38#1.base| v_ArrVal_6153))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6106)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6107)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:43:26,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:43:26,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163857321] [2023-11-29 00:43:26,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163857321] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:43:26,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [621157393] [2023-11-29 00:43:26,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:43:26,553 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:43:26,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:43:26,554 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:43:26,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 00:43:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:40,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 00:43:40,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:43:40,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:43:40,705 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:43:40,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:43:40,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:43:40,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 00:43:41,821 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:43:41,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:43:42,029 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:43:42,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:43:42,167 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:43:42,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:43:42,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 00:43:42,204 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:43:42,204 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:43:42,225 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6594 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6594) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 00:43:42,240 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6594 (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_6594) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:43:42,257 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6593 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6594 (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| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6593))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6594)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:43:42,275 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6593 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6594 (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_6593))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6594)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:43:42,790 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6593 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6594 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6640 (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_6640))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6593)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6594)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:43:42,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [621157393] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:43:42,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:43:42,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 00:43:42,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742627154] [2023-11-29 00:43:42,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:43:42,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 00:43:42,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:43:42,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 00:43:42,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=277, Unknown=10, NotChecked=430, Total=812 [2023-11-29 00:43:42,797 INFO L87 Difference]: Start difference. First operand 1196 states and 1439 transitions. Second operand has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:43:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:43:55,513 INFO L93 Difference]: Finished difference Result 1572 states and 1938 transitions. [2023-11-29 00:43:55,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 00:43:55,515 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 112 [2023-11-29 00:43:55,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:43:55,519 INFO L225 Difference]: With dead ends: 1572 [2023-11-29 00:43:55,520 INFO L226 Difference]: Without dead ends: 1572 [2023-11-29 00:43:55,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=306, Unknown=10, NotChecked=450, Total=870 [2023-11-29 00:43:55,521 INFO L413 NwaCegarLoop]: 620 mSDtfsCounter, 1612 mSDsluCounter, 3602 mSDsCounter, 0 mSdLazyCounter, 4559 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1617 SdHoareTripleChecker+Valid, 4222 SdHoareTripleChecker+Invalid, 4573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 4559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:43:55,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1617 Valid, 4222 Invalid, 4573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 4559 Invalid, 0 Unknown, 0 Unchecked, 12.5s Time] [2023-11-29 00:43:55,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2023-11-29 00:43:55,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1195. [2023-11-29 00:43:55,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 727 states have (on average 1.9133425034387896) internal successors, (1391), 1182 states have internal predecessors, (1391), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 00:43:55,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1438 transitions. [2023-11-29 00:43:55,537 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1438 transitions. Word has length 112 [2023-11-29 00:43:55,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:43:55,537 INFO L495 AbstractCegarLoop]: Abstraction has 1195 states and 1438 transitions. [2023-11-29 00:43:55,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:43:55,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1438 transitions. [2023-11-29 00:43:55,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 00:43:55,538 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:43:55,538 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:43:55,570 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-29 00:43:55,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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)] Forceful destruction successful, exit code 0 [2023-11-29 00:43:55,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:43:55,939 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:43:55,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:43:55,939 INFO L85 PathProgramCache]: Analyzing trace with hash -349734823, now seen corresponding path program 1 times [2023-11-29 00:43:55,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:43:55,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194304185] [2023-11-29 00:43:55,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:43:55,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:43:55,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:43:55,941 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:43:55,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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-29 00:43:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:57,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 115 conjunts are in the unsatisfiable core [2023-11-29 00:43:57,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:43:57,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:43:57,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:43:57,348 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:43:57,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:43:57,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:43:57,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 00:43:57,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 00:43:57,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 00:43:58,408 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:43:58,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 00:43:58,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 00:43:58,580 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:43:58,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 00:43:58,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 00:43:58,706 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:43:58,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 00:43:58,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 00:43:58,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 00:43:58,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 00:43:58,785 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:43:58,785 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:43:58,977 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7128 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7128 (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_7128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd (_ bv12 32) .cse1)))))) is different from false [2023-11-29 00:43:59,009 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_7127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7128 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7128 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-11-29 00:43:59,047 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7126))) (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_7125) .cse0 v_ArrVal_7128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7125 (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_7125) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 00:43:59,093 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_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7126))) (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_7125) .cse1 v_ArrVal_7128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7125) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-29 00:44:01,244 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7220 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7219 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7219))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7126))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7220) .cse0 v_ArrVal_7125) .cse1 v_ArrVal_7128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7220 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7219 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7219))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7220) .cse6 v_ArrVal_7125) (select (select (store .cse7 .cse6 v_ArrVal_7126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7128))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-29 00:44:01,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:44:01,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194304185] [2023-11-29 00:44:01,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194304185] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:44:01,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1738083624] [2023-11-29 00:44:01,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:44:01,258 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:44:01,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:44:01,259 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:44:01,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 00:44:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:44:15,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 00:44:15,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:44:15,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:44:16,412 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:44:16,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:44:16,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:44:16,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:44:16,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:44:16,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 00:44:16,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:44:17,959 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:44:17,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:44:17,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:44:18,286 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:44:18,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:44:18,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:44:18,517 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:44:18,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:44:18,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:44:18,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 00:44:18,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:44:18,572 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:44:18,573 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:44:18,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_7707 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7707) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7707 (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_7707) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7708) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 00:44:18,712 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_7707 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7707) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7707 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7707) |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_7708) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 00:44:18,787 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7706 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7705 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7706))) (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_7705) .cse0 v_ArrVal_7707) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7708) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7706 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7705 (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_7705) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7706) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7707) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 00:44:22,113 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7706 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7705 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7800 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7799 (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_7799))) (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_7800) .cse1 v_ArrVal_7705) (select (select (store .cse2 .cse1 v_ArrVal_7706) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7707))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7706 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7705 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7800 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7799 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7799))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7706))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7800) .cse4 v_ArrVal_7705) .cse5 v_ArrVal_7707) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7708) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 00:44:22,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1738083624] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:44:22,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:44:22,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 00:44:22,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068395573] [2023-11-29 00:44:22,126 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:44:22,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 00:44:22,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:44:22,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 00:44:22,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=314, Unknown=14, NotChecked=396, Total=812 [2023-11-29 00:44:22,128 INFO L87 Difference]: Start difference. First operand 1195 states and 1438 transitions. Second operand has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:44:43,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:44:43,947 INFO L93 Difference]: Finished difference Result 1571 states and 1937 transitions. [2023-11-29 00:44:43,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 00:44:43,950 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 112 [2023-11-29 00:44:43,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:44:43,954 INFO L225 Difference]: With dead ends: 1571 [2023-11-29 00:44:43,954 INFO L226 Difference]: Without dead ends: 1571 [2023-11-29 00:44:43,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=146, Invalid=526, Unknown=14, NotChecked=504, Total=1190 [2023-11-29 00:44:43,955 INFO L413 NwaCegarLoop]: 620 mSDtfsCounter, 1625 mSDsluCounter, 2794 mSDsCounter, 0 mSdLazyCounter, 5579 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1630 SdHoareTripleChecker+Valid, 3414 SdHoareTripleChecker+Invalid, 5597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 5579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:44:43,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1630 Valid, 3414 Invalid, 5597 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [18 Valid, 5579 Invalid, 0 Unknown, 0 Unchecked, 21.3s Time] [2023-11-29 00:44:43,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2023-11-29 00:44:43,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1194. [2023-11-29 00:44:43,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 727 states have (on average 1.9119669876203575) internal successors, (1390), 1181 states have internal predecessors, (1390), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 00:44:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1437 transitions. [2023-11-29 00:44:43,972 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1437 transitions. Word has length 112 [2023-11-29 00:44:43,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:44:43,972 INFO L495 AbstractCegarLoop]: Abstraction has 1194 states and 1437 transitions. [2023-11-29 00:44:43,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:44:43,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1437 transitions. [2023-11-29 00:44:43,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 00:44:43,973 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:44:43,973 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:44:43,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-11-29 00:44:44,183 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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-29 00:44:44,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:44:44,374 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:44:44,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:44:44,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1086071940, now seen corresponding path program 1 times [2023-11-29 00:44:44,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:44:44,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066128638] [2023-11-29 00:44:44,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:44:44,375 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:44:44,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:44:44,376 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:44:44,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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-29 00:44:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:44:45,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 00:44:45,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:44:45,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:44:45,952 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:44:45,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:44:46,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:44:46,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 00:44:47,731 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:44:47,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:44:47,922 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:44:47,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:44:48,075 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:44:48,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:44:48,233 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:44:48,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:44:48,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 00:44:48,345 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:44:48,345 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:44:48,473 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8256 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8256) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 00:44:48,493 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8256 (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_8256) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 00:44:48,517 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8255 (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_8255))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8256)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:44:48,541 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8255 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8255))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8256)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 00:44:48,568 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8255 (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_8254))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8255)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8256)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:44:48,596 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8255 (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| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8254))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8255)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8256)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:44:49,159 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8302 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8255 (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_8302))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8254)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8255)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8256)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:44:49,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:44:49,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066128638] [2023-11-29 00:44:49,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066128638] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:44:49,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1510708380] [2023-11-29 00:44:49,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:44:49,167 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:44:49,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:44:49,168 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:44:49,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-29 00:45:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:45:07,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 00:45:07,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:45:07,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:45:08,416 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:45:08,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:45:08,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:45:08,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 00:45:10,251 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:45:10,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:45:10,556 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:45:10,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:45:10,767 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:45:10,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:45:10,987 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:45:10,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 36 treesize of output 35 [2023-11-29 00:45:11,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 00:45:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:45:11,026 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:45:15,176 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8759 (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_8759) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 00:45:15,199 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8758 (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_8758))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8759)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:45:15,222 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8758 (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_8758))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8759)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:45:15,249 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8758 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8757 (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| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8757))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8758)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8759)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 00:45:15,279 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8758 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8757 (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_8757))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8758)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8759)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:45:15,951 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8758 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8757 (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_8805))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8757)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8758)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8759)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:45:15,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1510708380] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:45:15,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:45:15,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 00:45:15,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706385829] [2023-11-29 00:45:15,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:45:15,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 00:45:15,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:45:15,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 00:45:15,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=382, Unknown=14, NotChecked=676, Total=1190 [2023-11-29 00:45:15,960 INFO L87 Difference]: Start difference. First operand 1194 states and 1437 transitions. Second operand has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:45:31,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:45:31,668 INFO L93 Difference]: Finished difference Result 1570 states and 1936 transitions. [2023-11-29 00:45:31,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 00:45:31,671 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 114 [2023-11-29 00:45:31,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:45:31,674 INFO L225 Difference]: With dead ends: 1570 [2023-11-29 00:45:31,674 INFO L226 Difference]: Without dead ends: 1570 [2023-11-29 00:45:31,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=127, Invalid=417, Unknown=14, NotChecked=702, Total=1260 [2023-11-29 00:45:31,675 INFO L413 NwaCegarLoop]: 619 mSDtfsCounter, 1600 mSDsluCounter, 3327 mSDsCounter, 0 mSdLazyCounter, 4021 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1605 SdHoareTripleChecker+Valid, 3946 SdHoareTripleChecker+Invalid, 4034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:45:31,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1605 Valid, 3946 Invalid, 4034 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [13 Valid, 4021 Invalid, 0 Unknown, 0 Unchecked, 15.5s Time] [2023-11-29 00:45:31,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2023-11-29 00:45:31,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1193. [2023-11-29 00:45:31,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 727 states have (on average 1.9105914718019257) internal successors, (1389), 1180 states have internal predecessors, (1389), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 00:45:31,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1436 transitions. [2023-11-29 00:45:31,690 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1436 transitions. Word has length 114 [2023-11-29 00:45:31,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:45:31,690 INFO L495 AbstractCegarLoop]: Abstraction has 1193 states and 1436 transitions. [2023-11-29 00:45:31,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:45:31,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1436 transitions. [2023-11-29 00:45:31,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 00:45:31,691 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:45:31,692 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:45:31,707 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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-29 00:45:31,921 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2023-11-29 00:45:32,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 00:45:32,092 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:45:32,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:45:32,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1086071939, now seen corresponding path program 1 times [2023-11-29 00:45:32,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:45:32,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422291641] [2023-11-29 00:45:32,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:45:32,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:45:32,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:45:32,095 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:45:32,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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-29 00:45:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:45:33,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 00:45:33,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:45:33,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:45:33,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:45:33,896 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:45:33,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:45:33,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 00:45:33,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:45:34,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 00:45:34,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 00:45:35,346 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:45:35,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 00:45:35,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 00:45:35,569 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:45:35,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 00:45:35,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 00:45:35,751 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:45:35,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 00:45:35,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 00:45:35,931 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:45:35,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 00:45:35,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 00:45:35,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 00:45:35,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 00:45:36,040 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:45:36,040 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:45:36,309 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9309 (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_9309) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (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_9309) |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_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 00:45:36,367 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_9309 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9309) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9309) |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_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 00:45:36,433 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9308))) (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_9307) .cse0 v_ArrVal_9309) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (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_9307) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9308) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9309) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-29 00:45:36,617 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_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9307) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9308) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9309) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9308))) (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_9307) .cse3 v_ArrVal_9309) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 00:45:37,366 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9305 (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_9305))) (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_9306) .cse1 v_ArrVal_9307) (select (select (store .cse2 .cse1 v_ArrVal_9308) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9309))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9305 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9305))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9308))) (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_9306) .cse4 v_ArrVal_9307) .cse5 v_ArrVal_9309) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 00:45:37,753 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (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|) .cse3))) (and (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9305 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9305))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9308))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9306) .cse1 v_ArrVal_9307) .cse2 v_ArrVal_9309) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9305 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9305))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9306) .cse7 v_ArrVal_9307) (select (select (store .cse8 .cse7 v_ArrVal_9308) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9309))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd (_ bv24 32) .cse6))))))) is different from false [2023-11-29 00:45:43,863 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9305 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9402 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9401 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9402))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9305))) (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~mem38#1.base| v_ArrVal_9401) .cse1 v_ArrVal_9306) .cse2 v_ArrVal_9307) (select (select (store .cse3 .cse2 v_ArrVal_9308) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9309))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9305 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9402 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9401 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9402))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9305))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9308))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9401) .cse6 v_ArrVal_9306) .cse7 v_ArrVal_9307) .cse8 v_ArrVal_9309) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 00:45:43,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:45:43,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422291641] [2023-11-29 00:45:43,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422291641] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:45:43,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1161930575] [2023-11-29 00:45:43,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:45:43,903 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:45:43,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:45:43,904 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:45:43,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2023-11-29 00:46:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:02,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 121 conjunts are in the unsatisfiable core [2023-11-29 00:46:02,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:46:02,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:46:05,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:46:05,370 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:46:05,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:46:05,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:46:05,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:46:07,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 00:46:07,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:46:13,322 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:46:13,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:46:13,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:46:14,589 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:46:14,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:46:14,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:46:15,638 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:46:15,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:46:15,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:46:16,686 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:46:16,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:46:16,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:46:16,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 00:46:16,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:46:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:46:16,980 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:46:17,267 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9906 (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_9906) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9907 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9906 (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_9906) |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_9907) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 00:46:17,413 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_9906 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9906) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9907 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9906 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9906) |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_9907) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 00:46:17,566 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9907 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9906 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9904 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9905))) (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_9904) .cse0 v_ArrVal_9906) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9907) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9906 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9904 (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_9904) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9905) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9906) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-29 00:46:17,743 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_9907 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9906 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9904 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9905))) (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_9904) .cse1 v_ArrVal_9906) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9907) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9906 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9904 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9904) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9905) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9906) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-11-29 00:46:18,144 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9907 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9906 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9902 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9902))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9905))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9903) .cse0 v_ArrVal_9904) .cse1 v_ArrVal_9906) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9907) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9906 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9902 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9902))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9903) .cse6 v_ArrVal_9904) (select (select (store .cse7 .cse6 v_ArrVal_9905) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9906))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-29 00:46:18,601 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (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|) .cse3))) (and (forall ((v_ArrVal_9907 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9906 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9902 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9902))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9905))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9903) .cse1 v_ArrVal_9904) .cse2 v_ArrVal_9906) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9907) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_9906 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9902 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9902))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9903) .cse7 v_ArrVal_9904) (select (select (store .cse8 .cse7 v_ArrVal_9905) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9906))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-11-29 00:46:26,045 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9907 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9906 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9999 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9998 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9999))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9902))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9905))) (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_9998) .cse0 v_ArrVal_9903) .cse1 v_ArrVal_9904) .cse2 v_ArrVal_9906) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9907) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9906 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9999 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9998 (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_9999))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9902))) (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_9998) .cse8 v_ArrVal_9903) .cse9 v_ArrVal_9904) (select (select (store .cse10 .cse9 v_ArrVal_9905) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9906))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-11-29 00:46:26,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1161930575] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:46:26,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:46:26,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 00:46:26,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683129456] [2023-11-29 00:46:26,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:46:26,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 00:46:26,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:46:26,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 00:46:26,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=14, NotChecked=714, Total=1190 [2023-11-29 00:46:26,083 INFO L87 Difference]: Start difference. First operand 1193 states and 1436 transitions. Second operand has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:48:12,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:48:12,450 INFO L93 Difference]: Finished difference Result 1569 states and 1935 transitions. [2023-11-29 00:48:12,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 00:48:12,453 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 114 [2023-11-29 00:48:12,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:48:12,460 INFO L225 Difference]: With dead ends: 1569 [2023-11-29 00:48:12,460 INFO L226 Difference]: Without dead ends: 1569 [2023-11-29 00:48:12,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=161, Invalid=637, Unknown=14, NotChecked=910, Total=1722 [2023-11-29 00:48:12,462 INFO L413 NwaCegarLoop]: 619 mSDtfsCounter, 1005 mSDsluCounter, 3381 mSDsCounter, 0 mSdLazyCounter, 6323 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 100.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 4000 SdHoareTripleChecker+Invalid, 6333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 6323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 103.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:48:12,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 4000 Invalid, 6333 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10 Valid, 6323 Invalid, 0 Unknown, 0 Unchecked, 103.8s Time] [2023-11-29 00:48:12,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2023-11-29 00:48:12,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1192. [2023-11-29 00:48:12,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 727 states have (on average 1.9092159559834938) internal successors, (1388), 1179 states have internal predecessors, (1388), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 00:48:12,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1435 transitions. [2023-11-29 00:48:12,484 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1435 transitions. Word has length 114 [2023-11-29 00:48:12,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:48:12,485 INFO L495 AbstractCegarLoop]: Abstraction has 1192 states and 1435 transitions. [2023-11-29 00:48:12,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:48:12,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1435 transitions. [2023-11-29 00:48:12,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-29 00:48:12,486 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:48:12,486 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:48:12,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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)] Forceful destruction successful, exit code 0 [2023-11-29 00:48:12,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2023-11-29 00:48:12,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 00:48:12,887 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 00:48:12,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:12,888 INFO L85 PathProgramCache]: Analyzing trace with hash -36389789, now seen corresponding path program 1 times [2023-11-29 00:48:12,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:48:12,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1560244053] [2023-11-29 00:48:12,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:12,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:48:12,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:48:12,890 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:48:12,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/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-29 00:48:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:14,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 00:48:14,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:48:14,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:48:16,451 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:48:16,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:48:16,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:48:17,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 00:48:24,798 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:48:24,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:48:25,839 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:48:25,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:48:26,538 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:48:26,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:48:27,336 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:48:27,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:48:28,180 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:48:28,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:48:28,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 00:48:28,652 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-29 00:48:28,653 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-29 00:48:29,150 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:48:29,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:48:30,030 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10473 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ 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_10473) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 00:48:30,101 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10473 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ 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_10473) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:48:30,182 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10473 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ 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 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10472))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10473)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 00:48:30,257 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10473 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ 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_10472))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10473)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:48:30,336 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10471 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ 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 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10471))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10472)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10473)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:48:30,417 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10471 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ 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 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10471))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10472)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10473)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:48:30,502 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10471 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ 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 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10470))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10471)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10472)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10473)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:48:30,590 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10471 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ 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 (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_10470))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10471)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10472)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10473)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:48:32,493 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10472 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10520 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ 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 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10520))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10470)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10471)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10472)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10473)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:48:32,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:48:32,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1560244053] [2023-11-29 00:48:32,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1560244053] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:48:32,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2085173179] [2023-11-29 00:48:32,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:32,513 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:48:32,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:48:32,514 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:48:32,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_112351ef-1ddc-4a26-ae5e-d0f5050a5d9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-11-29 00:48:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:40,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-29 00:48:40,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:48:40,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:48:43,692 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:48:43,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:48:44,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:48:46,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 00:48:55,573 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:48:55,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:48:57,187 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:48:57,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:48:58,214 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:48:58,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 36 treesize of output 35 [2023-11-29 00:48:59,365 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:48:59,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:49:00,441 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:49:00,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:49:01,038 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2023-11-29 00:49:01,038 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 32 treesize of output 44 [2023-11-29 00:49:01,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 00:49:01,348 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:49:01,348 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:49:06,113 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10995 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10996 (_ 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_10996) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_10995) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))))) is different from false [2023-11-29 00:49:06,259 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10995 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10996 (_ 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_10996) (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_10995) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 00:49:06,382 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10994 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10995 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10996 (_ 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 (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17| v_ArrVal_10996) (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_10994))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10995)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2023-11-29 00:49:06,502 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10994 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10995 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10996 (_ 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 (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17| v_ArrVal_10996) (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_10994))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10995)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2023-11-29 00:49:06,635 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10993 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10994 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10995 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10996 (_ 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_10996) (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_10993))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10994)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10995)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 00:49:06,763 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10993 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10994 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10995 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10996 (_ 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_10996) (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_10993))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10994)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10995)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 00:49:06,893 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10993 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10994 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10995 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10996 (_ 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_10996) (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_10992))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10993)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10994)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10995)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 00:49:07,026 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10993 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10994 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10995 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10996 (_ 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_10996) (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_10992))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10993)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10994)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10995)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 00:49:09,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2085173179] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:49:09,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:49:09,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2023-11-29 00:49:09,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739821815] [2023-11-29 00:49:09,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:49:09,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 00:49:09,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:49:09,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 00:49:09,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=590, Unknown=18, NotChecked=1122, Total=1892 [2023-11-29 00:49:09,887 INFO L87 Difference]: Start difference. First operand 1192 states and 1435 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)