./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI --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 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:54:55,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:54:55,482 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 21:54:55,494 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:54:55,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:54:55,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:54:55,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:54:55,558 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:54:55,560 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:54:55,569 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:54:55,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:54:55,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:54:55,573 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:54:55,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:54:55,576 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:54:55,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:54:55,577 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:54:55,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:54:55,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:54:55,579 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:54:55,580 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:54:55,580 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:54:55,581 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:54:55,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:54:55,582 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:54:55,583 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:54:55,583 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:54:55,584 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:54:55,585 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:54:55,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:54:55,587 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:54:55,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:54:55,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:54:55,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:54:55,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:54:55,589 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:54:55,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:54:55,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:54:55,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:54:55,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:54:55,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:54:55,591 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_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/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_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI 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 -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2023-11-24 21:54:55,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:54:56,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:54:56,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:54:56,043 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:54:56,044 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:54:56,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2023-11-24 21:54:59,614 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:54:59,956 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:54:59,956 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2023-11-24 21:54:59,990 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/data/db1e26625/8fce0acd0d994ada92aae9485c84db85/FLAGd5d7eeb2a [2023-11-24 21:55:00,010 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/data/db1e26625/8fce0acd0d994ada92aae9485c84db85 [2023-11-24 21:55:00,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:55:00,016 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:55:00,018 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:55:00,018 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:55:00,025 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:55:00,026 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:55:00" (1/1) ... [2023-11-24 21:55:00,027 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f902de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:00, skipping insertion in model container [2023-11-24 21:55:00,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:55:00" (1/1) ... [2023-11-24 21:55:00,108 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:55:00,510 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:55:00,523 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-24 21:55:00,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@470ce1a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:00, skipping insertion in model container [2023-11-24 21:55:00,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:55:00,525 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-24 21:55:00,527 INFO L158 Benchmark]: Toolchain (without parser) took 510.14ms. Allocated memory is still 138.4MB. Free memory was 90.4MB in the beginning and 78.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-24 21:55:00,527 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 138.4MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:55:00,528 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.91ms. Allocated memory is still 138.4MB. Free memory was 90.2MB in the beginning and 78.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-24 21:55:00,530 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.37ms. Allocated memory is still 138.4MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 506.91ms. Allocated memory is still 138.4MB. Free memory was 90.2MB in the beginning and 78.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 556]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI --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 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:55:03,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:55:03,513 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-24 21:55:03,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:55:03,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:55:03,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:55:03,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:55:03,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:55:03,594 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:55:03,601 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:55:03,601 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:55:03,602 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:55:03,603 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:55:03,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:55:03,606 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:55:03,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:55:03,607 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:55:03,608 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:55:03,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:55:03,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:55:03,610 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:55:03,611 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:55:03,612 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:55:03,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:55:03,613 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:55:03,613 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-24 21:55:03,614 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-24 21:55:03,614 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:55:03,615 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:55:03,615 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:55:03,618 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:55:03,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:55:03,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:55:03,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:55:03,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:55:03,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:55:03,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:55:03,621 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-24 21:55:03,622 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-24 21:55:03,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:55:03,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:55:03,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:55:03,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:55:03,623 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-24 21:55:03,624 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_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/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_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI 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 -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2023-11-24 21:55:04,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:55:04,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:55:04,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:55:04,142 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:55:04,143 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:55:04,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2023-11-24 21:55:07,603 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:55:07,940 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:55:07,941 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2023-11-24 21:55:07,962 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/data/6f096ba9f/83e03e27a82e412582fdf3c66c71b17a/FLAG2cc5089a3 [2023-11-24 21:55:07,979 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/data/6f096ba9f/83e03e27a82e412582fdf3c66c71b17a [2023-11-24 21:55:07,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:55:07,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:55:07,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:55:07,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:55:07,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:55:07,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:55:07" (1/1) ... [2023-11-24 21:55:07,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73505e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:07, skipping insertion in model container [2023-11-24 21:55:07,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:55:07" (1/1) ... [2023-11-24 21:55:08,071 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:55:08,591 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:55:08,622 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-24 21:55:08,651 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:55:08,731 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:55:08,753 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:55:08,832 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:55:08,893 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:55:08,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:08 WrapperNode [2023-11-24 21:55:08,894 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:55:08,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:55:08,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:55:08,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:55:08,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:08" (1/1) ... [2023-11-24 21:55:08,950 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:08" (1/1) ... [2023-11-24 21:55:08,993 INFO L138 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2023-11-24 21:55:08,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:55:08,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:55:08,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:55:08,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:55:09,009 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:08" (1/1) ... [2023-11-24 21:55:09,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:08" (1/1) ... [2023-11-24 21:55:09,030 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:08" (1/1) ... [2023-11-24 21:55:09,082 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [2, 11, 31]. 70 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 18 writes are split as follows [0, 2, 16]. [2023-11-24 21:55:09,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:08" (1/1) ... [2023-11-24 21:55:09,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:08" (1/1) ... [2023-11-24 21:55:09,112 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:08" (1/1) ... [2023-11-24 21:55:09,118 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:08" (1/1) ... [2023-11-24 21:55:09,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:08" (1/1) ... [2023-11-24 21:55:09,132 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:08" (1/1) ... [2023-11-24 21:55:09,143 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:55:09,146 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:55:09,147 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:55:09,147 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:55:09,148 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:08" (1/1) ... [2023-11-24 21:55:09,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:55:09,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:55:09,190 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:55:09,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:55:09,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-24 21:55:09,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-24 21:55:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-24 21:55:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 21:55:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2023-11-24 21:55:09,246 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2023-11-24 21:55:09,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:55:09,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:55:09,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-24 21:55:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-24 21:55:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-24 21:55:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-24 21:55:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-24 21:55:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-24 21:55:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:55:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-24 21:55:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-24 21:55:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-24 21:55:09,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-24 21:55:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-24 21:55:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-24 21:55:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-24 21:55:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-24 21:55:09,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-24 21:55:09,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:55:09,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:55:09,400 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:55:09,403 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:55:10,443 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:55:10,560 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:55:10,561 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-24 21:55:10,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:55:10 BoogieIcfgContainer [2023-11-24 21:55:10,561 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:55:10,564 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:55:10,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:55:10,567 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:55:10,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:55:07" (1/3) ... [2023-11-24 21:55:10,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e9473f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:55:10, skipping insertion in model container [2023-11-24 21:55:10,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:55:08" (2/3) ... [2023-11-24 21:55:10,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e9473f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:55:10, skipping insertion in model container [2023-11-24 21:55:10,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:55:10" (3/3) ... [2023-11-24 21:55:10,571 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2023-11-24 21:55:10,587 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:55:10,587 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2023-11-24 21:55:10,636 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:55:10,643 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;@28adcec6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:55:10,644 INFO L358 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2023-11-24 21:55:10,649 INFO L276 IsEmpty]: Start isEmpty. Operand has 169 states, 73 states have (on average 2.4794520547945207) internal successors, (181), 165 states have internal predecessors, (181), 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-24 21:55:10,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-24 21:55:10,655 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:55:10,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-24 21:55:10,656 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-24 21:55:10,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:10,661 INFO L85 PathProgramCache]: Analyzing trace with hash 328757, now seen corresponding path program 1 times [2023-11-24 21:55:10,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:55:10,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236953744] [2023-11-24 21:55:10,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:55:10,673 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-24 21:55:10,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:55:10,678 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:10,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:55:10,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-24 21:55:10,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:55:10,800 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-24 21:55:10,800 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:55:10,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:55:10,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236953744] [2023-11-24 21:55:10,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236953744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:55:10,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:55:10,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:55:10,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850857133] [2023-11-24 21:55:10,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:55:10,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 21:55:10,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:55:10,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 21:55:10,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 21:55:10,863 INFO L87 Difference]: Start difference. First operand has 169 states, 73 states have (on average 2.4794520547945207) internal successors, (181), 165 states have internal predecessors, (181), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:55:11,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:55:11,054 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2023-11-24 21:55:11,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 21:55:11,058 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-24 21:55:11,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:55:11,068 INFO L225 Difference]: With dead ends: 169 [2023-11-24 21:55:11,068 INFO L226 Difference]: Without dead ends: 168 [2023-11-24 21:55:11,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 21:55:11,073 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:55:11,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:55:11,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-11-24 21:55:11,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2023-11-24 21:55:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 73 states have (on average 2.410958904109589) internal successors, (176), 164 states have internal predecessors, (176), 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-24 21:55:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 180 transitions. [2023-11-24 21:55:11,123 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 180 transitions. Word has length 3 [2023-11-24 21:55:11,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:55:11,124 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 180 transitions. [2023-11-24 21:55:11,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:55:11,124 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 180 transitions. [2023-11-24 21:55:11,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-24 21:55:11,125 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:55:11,125 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-24 21:55:11,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:11,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:11,327 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-24 21:55:11,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:11,328 INFO L85 PathProgramCache]: Analyzing trace with hash 326321, now seen corresponding path program 1 times [2023-11-24 21:55:11,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:55:11,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744921531] [2023-11-24 21:55:11,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:55:11,329 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-24 21:55:11,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:55:11,331 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:11,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:55:11,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-24 21:55:11,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:55:11,506 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-24 21:55:11,560 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-24 21:55:11,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-24 21:55:11,591 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-24 21:55:11,592 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:55:11,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:55:11,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744921531] [2023-11-24 21:55:11,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744921531] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:55:11,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:55:11,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:55:11,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233576034] [2023-11-24 21:55:11,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:55:11,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:55:11,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:55:11,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:55:11,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:55:11,596 INFO L87 Difference]: Start difference. First operand 168 states and 180 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:55:12,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:55:12,486 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2023-11-24 21:55:12,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:55:12,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-24 21:55:12,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:55:12,493 INFO L225 Difference]: With dead ends: 162 [2023-11-24 21:55:12,493 INFO L226 Difference]: Without dead ends: 162 [2023-11-24 21:55:12,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-24 21:55:12,495 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 75 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-24 21:55:12,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 233 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-24 21:55:12,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-24 21:55:12,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2023-11-24 21:55:12,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 73 states have (on average 2.328767123287671) internal successors, (170), 158 states have internal predecessors, (170), 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-24 21:55:12,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 174 transitions. [2023-11-24 21:55:12,511 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 174 transitions. Word has length 3 [2023-11-24 21:55:12,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:55:12,511 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 174 transitions. [2023-11-24 21:55:12,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:55:12,512 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 174 transitions. [2023-11-24 21:55:12,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-24 21:55:12,512 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:55:12,512 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-24 21:55:12,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-24 21:55:12,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:12,715 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-24 21:55:12,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:12,716 INFO L85 PathProgramCache]: Analyzing trace with hash 326322, now seen corresponding path program 1 times [2023-11-24 21:55:12,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:55:12,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373259066] [2023-11-24 21:55:12,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:55:12,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-24 21:55:12,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:55:12,719 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:12,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:55:12,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-24 21:55:12,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:55:12,828 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-24 21:55:12,835 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-24 21:55:12,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:55:12,925 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-24 21:55:12,943 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-24 21:55:12,944 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-24 21:55:12,963 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-24 21:55:12,963 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:55:12,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:55:12,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373259066] [2023-11-24 21:55:12,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373259066] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:55:12,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:55:12,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:55:12,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676911062] [2023-11-24 21:55:12,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:55:12,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:55:12,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:55:12,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:55:12,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:55:12,971 INFO L87 Difference]: Start difference. First operand 162 states and 174 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:55:13,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:55:13,991 INFO L93 Difference]: Finished difference Result 177 states and 192 transitions. [2023-11-24 21:55:13,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:55:13,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-24 21:55:13,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:55:13,995 INFO L225 Difference]: With dead ends: 177 [2023-11-24 21:55:13,995 INFO L226 Difference]: Without dead ends: 177 [2023-11-24 21:55:13,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-24 21:55:13,997 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 26 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-24 21:55:13,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 260 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-24 21:55:13,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-11-24 21:55:14,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 166. [2023-11-24 21:55:14,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 77 states have (on average 2.2857142857142856) internal successors, (176), 162 states have internal predecessors, (176), 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-24 21:55:14,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 180 transitions. [2023-11-24 21:55:14,012 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 180 transitions. Word has length 3 [2023-11-24 21:55:14,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:55:14,012 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 180 transitions. [2023-11-24 21:55:14,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:55:14,013 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 180 transitions. [2023-11-24 21:55:14,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-24 21:55:14,013 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:55:14,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-24 21:55:14,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-24 21:55:14,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:14,225 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-24 21:55:14,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:14,225 INFO L85 PathProgramCache]: Analyzing trace with hash 10116062, now seen corresponding path program 1 times [2023-11-24 21:55:14,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:55:14,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884254615] [2023-11-24 21:55:14,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:55:14,226 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-24 21:55:14,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:55:14,227 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:14,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:55:14,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 21:55:14,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:55:14,311 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-24 21:55:14,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-24 21:55:14,321 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:55:14,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:55:14,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1884254615] [2023-11-24 21:55:14,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1884254615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:55:14,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:55:14,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:55:14,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54536295] [2023-11-24 21:55:14,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:55:14,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:55:14,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:55:14,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:55:14,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:55:14,324 INFO L87 Difference]: Start difference. First operand 166 states and 180 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-24 21:55:14,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:55:14,819 INFO L93 Difference]: Finished difference Result 164 states and 177 transitions. [2023-11-24 21:55:14,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:55:14,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2023-11-24 21:55:14,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:55:14,822 INFO L225 Difference]: With dead ends: 164 [2023-11-24 21:55:14,822 INFO L226 Difference]: Without dead ends: 164 [2023-11-24 21:55:14,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 21:55:14,823 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 14 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-24 21:55:14,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 211 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-24 21:55:14,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-11-24 21:55:14,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2023-11-24 21:55:14,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 77 states have (on average 2.2467532467532467) internal successors, (173), 160 states have internal predecessors, (173), 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-24 21:55:14,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 177 transitions. [2023-11-24 21:55:14,835 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 177 transitions. Word has length 4 [2023-11-24 21:55:14,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:55:14,835 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 177 transitions. [2023-11-24 21:55:14,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-24 21:55:14,836 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 177 transitions. [2023-11-24 21:55:14,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-24 21:55:14,836 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:55:14,837 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-24 21:55:14,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-24 21:55:15,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:15,040 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-24 21:55:15,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:15,040 INFO L85 PathProgramCache]: Analyzing trace with hash 10116063, now seen corresponding path program 1 times [2023-11-24 21:55:15,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:55:15,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450291389] [2023-11-24 21:55:15,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:55:15,041 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:55:15,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:55:15,043 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:15,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:55:15,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:55:15,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:55:15,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 5 [2023-11-24 21:55:15,180 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-24 21:55:15,180 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:55:15,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:55:15,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450291389] [2023-11-24 21:55:15,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450291389] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:55:15,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:55:15,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:55:15,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995017884] [2023-11-24 21:55:15,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:55:15,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:55:15,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:55:15,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:55:15,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:55:15,183 INFO L87 Difference]: Start difference. First operand 164 states and 177 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-24 21:55:15,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:55:15,770 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2023-11-24 21:55:15,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:55:15,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2023-11-24 21:55:15,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:55:15,776 INFO L225 Difference]: With dead ends: 162 [2023-11-24 21:55:15,776 INFO L226 Difference]: Without dead ends: 162 [2023-11-24 21:55:15,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 21:55:15,777 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 10 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-24 21:55:15,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 214 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-24 21:55:15,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-24 21:55:15,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2023-11-24 21:55:15,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 77 states have (on average 2.207792207792208) internal successors, (170), 158 states have internal predecessors, (170), 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-24 21:55:15,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 174 transitions. [2023-11-24 21:55:15,787 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 174 transitions. Word has length 4 [2023-11-24 21:55:15,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:55:15,787 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 174 transitions. [2023-11-24 21:55:15,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-24 21:55:15,787 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 174 transitions. [2023-11-24 21:55:15,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-24 21:55:15,788 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:55:15,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:55:15,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-24 21:55:15,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:15,991 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-24 21:55:15,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:15,992 INFO L85 PathProgramCache]: Analyzing trace with hash 998682099, now seen corresponding path program 1 times [2023-11-24 21:55:15,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:55:15,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086371798] [2023-11-24 21:55:15,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:55:15,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-24 21:55:15,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:55:15,994 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:16,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:55:16,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-24 21:55:16,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:55:16,185 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-24 21:55:16,186 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:55:16,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:55:16,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086371798] [2023-11-24 21:55:16,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1086371798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:55:16,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:55:16,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:55:16,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840191211] [2023-11-24 21:55:16,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:55:16,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:55:16,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:55:16,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:55:16,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:55:16,189 INFO L87 Difference]: Start difference. First operand 162 states and 174 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-24 21:55:16,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:55:16,779 INFO L93 Difference]: Finished difference Result 170 states and 183 transitions. [2023-11-24 21:55:16,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:55:16,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2023-11-24 21:55:16,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:55:16,781 INFO L225 Difference]: With dead ends: 170 [2023-11-24 21:55:16,781 INFO L226 Difference]: Without dead ends: 170 [2023-11-24 21:55:16,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:55:16,783 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 17 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-24 21:55:16,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 536 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-24 21:55:16,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-11-24 21:55:16,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2023-11-24 21:55:16,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 78 states have (on average 2.1923076923076925) internal successors, (171), 159 states have internal predecessors, (171), 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-24 21:55:16,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 175 transitions. [2023-11-24 21:55:16,792 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 175 transitions. Word has length 8 [2023-11-24 21:55:16,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:55:16,792 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 175 transitions. [2023-11-24 21:55:16,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-24 21:55:16,792 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 175 transitions. [2023-11-24 21:55:16,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-24 21:55:16,793 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:55:16,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:55:16,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-24 21:55:16,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:16,994 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-24 21:55:16,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:16,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1952744820, now seen corresponding path program 1 times [2023-11-24 21:55:16,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:55:16,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925467452] [2023-11-24 21:55:16,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:55:16,995 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-24 21:55:16,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:55:16,996 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:16,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:55:17,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-24 21:55:17,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:55:17,138 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-24 21:55:17,139 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:55:17,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:55:17,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925467452] [2023-11-24 21:55:17,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925467452] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:55:17,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:55:17,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:55:17,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060518035] [2023-11-24 21:55:17,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:55:17,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:55:17,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:55:17,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:55:17,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:55:17,144 INFO L87 Difference]: Start difference. First operand 163 states and 175 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:55:17,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:55:17,526 INFO L93 Difference]: Finished difference Result 232 states and 248 transitions. [2023-11-24 21:55:17,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:55:17,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-24 21:55:17,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:55:17,529 INFO L225 Difference]: With dead ends: 232 [2023-11-24 21:55:17,530 INFO L226 Difference]: Without dead ends: 232 [2023-11-24 21:55:17,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-24 21:55:17,531 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 73 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 21:55:17,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 423 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 21:55:17,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-11-24 21:55:17,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 196. [2023-11-24 21:55:17,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 110 states have (on average 2.2181818181818183) internal successors, (244), 191 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-24 21:55:17,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 248 transitions. [2023-11-24 21:55:17,540 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 248 transitions. Word has length 10 [2023-11-24 21:55:17,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:55:17,541 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 248 transitions. [2023-11-24 21:55:17,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:55:17,541 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 248 transitions. [2023-11-24 21:55:17,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-24 21:55:17,542 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:55:17,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:55:17,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-24 21:55:17,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:17,743 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-24 21:55:17,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:17,743 INFO L85 PathProgramCache]: Analyzing trace with hash 405553465, now seen corresponding path program 1 times [2023-11-24 21:55:17,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:55:17,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854304326] [2023-11-24 21:55:17,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:55:17,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:55:17,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:55:17,745 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:17,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:55:17,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:55:17,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:55:17,868 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-24 21:55:17,869 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-24 21:55:17,885 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-24 21:55:17,885 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:55:17,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:55:17,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854304326] [2023-11-24 21:55:17,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854304326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:55:17,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:55:17,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:55:17,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951174612] [2023-11-24 21:55:17,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:55:17,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:55:17,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:55:17,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:55:17,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:55:17,888 INFO L87 Difference]: Start difference. First operand 196 states and 248 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:55:18,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:55:18,362 INFO L93 Difference]: Finished difference Result 183 states and 220 transitions. [2023-11-24 21:55:18,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:55:18,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-24 21:55:18,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:55:18,365 INFO L225 Difference]: With dead ends: 183 [2023-11-24 21:55:18,365 INFO L226 Difference]: Without dead ends: 183 [2023-11-24 21:55:18,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-24 21:55:18,366 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 53 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-24 21:55:18,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 155 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-24 21:55:18,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-11-24 21:55:18,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2023-11-24 21:55:18,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 110 states have (on average 1.9454545454545455) internal successors, (214), 176 states have internal predecessors, (214), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-24 21:55:18,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 218 transitions. [2023-11-24 21:55:18,373 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 218 transitions. Word has length 11 [2023-11-24 21:55:18,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:55:18,373 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 218 transitions. [2023-11-24 21:55:18,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:55:18,373 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 218 transitions. [2023-11-24 21:55:18,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-24 21:55:18,374 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:55:18,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:55:18,377 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:18,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:18,575 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-24 21:55:18,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:18,576 INFO L85 PathProgramCache]: Analyzing trace with hash 405553466, now seen corresponding path program 1 times [2023-11-24 21:55:18,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:55:18,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129668283] [2023-11-24 21:55:18,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:55:18,576 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-24 21:55:18,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:55:18,578 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:18,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:55:18,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-24 21:55:18,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:55:18,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:55:18,736 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 11 treesize of output 5 [2023-11-24 21:55:18,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-24 21:55:18,755 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-24 21:55:18,756 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:55:18,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:55:18,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129668283] [2023-11-24 21:55:18,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129668283] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:55:18,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:55:18,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:55:18,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630517912] [2023-11-24 21:55:18,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:55:18,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:55:18,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:55:18,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:55:18,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:55:18,758 INFO L87 Difference]: Start difference. First operand 181 states and 218 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:55:19,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:55:19,216 INFO L93 Difference]: Finished difference Result 168 states and 190 transitions. [2023-11-24 21:55:19,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:55:19,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-24 21:55:19,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:55:19,219 INFO L225 Difference]: With dead ends: 168 [2023-11-24 21:55:19,219 INFO L226 Difference]: Without dead ends: 168 [2023-11-24 21:55:19,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-24 21:55:19,220 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 38 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 21:55:19,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 156 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 21:55:19,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-11-24 21:55:19,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2023-11-24 21:55:19,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 110 states have (on average 1.6727272727272726) internal successors, (184), 161 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-24 21:55:19,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 188 transitions. [2023-11-24 21:55:19,226 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 188 transitions. Word has length 11 [2023-11-24 21:55:19,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:55:19,226 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 188 transitions. [2023-11-24 21:55:19,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:55:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 188 transitions. [2023-11-24 21:55:19,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-24 21:55:19,228 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:55:19,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:55:19,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-24 21:55:19,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:19,428 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-24 21:55:19,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:19,429 INFO L85 PathProgramCache]: Analyzing trace with hash 108174754, now seen corresponding path program 1 times [2023-11-24 21:55:19,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:55:19,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475160050] [2023-11-24 21:55:19,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:55:19,430 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-24 21:55:19,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:55:19,431 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:19,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:55:19,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-24 21:55:19,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:55:19,562 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 11 treesize of output 7 [2023-11-24 21:55:19,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 7 [2023-11-24 21:55:19,601 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-24 21:55:19,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-24 21:55:19,641 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-24 21:55:19,641 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:55:19,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:55:19,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475160050] [2023-11-24 21:55:19,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475160050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:55:19,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:55:19,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:55:19,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420167718] [2023-11-24 21:55:19,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:55:19,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:55:19,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:55:19,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:55:19,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:55:19,645 INFO L87 Difference]: Start difference. First operand 166 states and 188 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:55:20,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:55:20,489 INFO L93 Difference]: Finished difference Result 211 states and 246 transitions. [2023-11-24 21:55:20,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:55:20,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-24 21:55:20,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:55:20,492 INFO L225 Difference]: With dead ends: 211 [2023-11-24 21:55:20,492 INFO L226 Difference]: Without dead ends: 211 [2023-11-24 21:55:20,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-24 21:55:20,493 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 21 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-24 21:55:20,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 306 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-24 21:55:20,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-11-24 21:55:20,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 172. [2023-11-24 21:55:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 116 states have (on average 1.6724137931034482) internal successors, (194), 167 states have internal predecessors, (194), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-24 21:55:20,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 198 transitions. [2023-11-24 21:55:20,502 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 198 transitions. Word has length 14 [2023-11-24 21:55:20,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:55:20,502 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 198 transitions. [2023-11-24 21:55:20,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:55:20,503 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 198 transitions. [2023-11-24 21:55:20,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-24 21:55:20,503 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:55:20,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:55:20,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:20,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:20,707 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-24 21:55:20,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:20,707 INFO L85 PathProgramCache]: Analyzing trace with hash 108174755, now seen corresponding path program 1 times [2023-11-24 21:55:20,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:55:20,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472169203] [2023-11-24 21:55:20,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:55:20,708 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-24 21:55:20,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:55:20,709 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:20,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:55:20,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-24 21:55:20,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:55:20,846 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 11 treesize of output 5 [2023-11-24 21:55:20,860 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-24 21:55:20,909 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-24 21:55:20,926 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-24 21:55:20,993 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-24 21:55:21,032 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-24 21:55:21,032 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:55:21,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:55:21,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472169203] [2023-11-24 21:55:21,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472169203] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:55:21,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:55:21,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:55:21,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304889113] [2023-11-24 21:55:21,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:55:21,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:55:21,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:55:21,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:55:21,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:55:21,035 INFO L87 Difference]: Start difference. First operand 172 states and 198 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:55:22,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:55:22,002 INFO L93 Difference]: Finished difference Result 172 states and 194 transitions. [2023-11-24 21:55:22,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:55:22,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-24 21:55:22,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:55:22,004 INFO L225 Difference]: With dead ends: 172 [2023-11-24 21:55:22,004 INFO L226 Difference]: Without dead ends: 172 [2023-11-24 21:55:22,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:55:22,005 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-24 21:55:22,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 315 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-24 21:55:22,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-11-24 21:55:22,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2023-11-24 21:55:22,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 116 states have (on average 1.6379310344827587) internal successors, (190), 167 states have internal predecessors, (190), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-24 21:55:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 194 transitions. [2023-11-24 21:55:22,012 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 194 transitions. Word has length 14 [2023-11-24 21:55:22,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:55:22,012 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 194 transitions. [2023-11-24 21:55:22,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:55:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 194 transitions. [2023-11-24 21:55:22,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-24 21:55:22,014 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:55:22,014 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:55:22,028 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-24 21:55:22,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:22,217 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-24 21:55:22,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:22,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1416169509, now seen corresponding path program 1 times [2023-11-24 21:55:22,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:55:22,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430363189] [2023-11-24 21:55:22,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:55:22,218 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-24 21:55:22,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:55:22,219 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:22,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:55:22,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-24 21:55:22,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:55:22,438 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-24 21:55:22,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-11-24 21:55:22,501 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-24 21:55:22,647 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-24 21:55:22,647 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-24 21:55:22,697 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-24 21:55:22,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 21:55:22,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:55:26,874 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse0) v_ArrVal_167) c_create_data_~data~0.base) .cse0))) (_ bv1 1)))) is different from false [2023-11-24 21:55:26,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:55:26,925 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-11-24 21:55:26,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2023-11-24 21:55:26,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 21:55:27,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-24 21:55:27,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:55:27,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430363189] [2023-11-24 21:55:27,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430363189] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:55:27,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 21:55:27,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2023-11-24 21:55:27,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829665736] [2023-11-24 21:55:27,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 21:55:27,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 21:55:27,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:55:27,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 21:55:27,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=64, Unknown=3, NotChecked=16, Total=110 [2023-11-24 21:55:27,025 INFO L87 Difference]: Start difference. First operand 172 states and 194 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:55:28,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:55:28,478 INFO L93 Difference]: Finished difference Result 177 states and 198 transitions. [2023-11-24 21:55:28,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:55:28,480 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-24 21:55:28,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:55:28,482 INFO L225 Difference]: With dead ends: 177 [2023-11-24 21:55:28,482 INFO L226 Difference]: Without dead ends: 177 [2023-11-24 21:55:28,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=27, Invalid=64, Unknown=3, NotChecked=16, Total=110 [2023-11-24 21:55:28,483 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 40 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-24 21:55:28,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 474 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 387 Invalid, 0 Unknown, 88 Unchecked, 1.4s Time] [2023-11-24 21:55:28,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-11-24 21:55:28,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2023-11-24 21:55:28,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 116 states have (on average 1.6206896551724137) internal successors, (188), 166 states have internal predecessors, (188), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-24 21:55:28,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 192 transitions. [2023-11-24 21:55:28,492 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 192 transitions. Word has length 17 [2023-11-24 21:55:28,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:55:28,492 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 192 transitions. [2023-11-24 21:55:28,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:55:28,493 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 192 transitions. [2023-11-24 21:55:28,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-24 21:55:28,494 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:55:28,494 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:55:28,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-24 21:55:28,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:28,699 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-24 21:55:28,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:28,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1416169510, now seen corresponding path program 1 times [2023-11-24 21:55:28,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:55:28,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1381980297] [2023-11-24 21:55:28,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:55:28,700 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-24 21:55:28,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:55:28,701 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:28,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:55:28,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-24 21:55:28,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:55:28,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-24 21:55:28,937 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 11 treesize of output 5 [2023-11-24 21:55:28,985 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-24 21:55:29,008 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-24 21:55:29,213 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-24 21:55:29,214 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-24 21:55:29,230 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-24 21:55:29,344 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-24 21:55:29,358 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-24 21:55:29,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:55:29,397 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:55:29,723 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_210 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem9.base| v_ArrVal_210) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_210 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_209 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem9.base| v_ArrVal_210) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem9.base| v_ArrVal_209) c_create_data_~data~0.base) .cse2)))))) is different from false [2023-11-24 21:55:29,804 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_210 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_209 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_210) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_209) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_210 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_210) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) (bvadd (_ bv8 32) .cse3 .cse2))))))) is different from false [2023-11-24 21:55:29,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:55:29,863 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2023-11-24 21:55:29,868 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 54 treesize of output 36 [2023-11-24 21:55:29,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:55:29,922 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2023-11-24 21:55:29,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:55:29,946 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-11-24 21:55:29,954 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:55:29,961 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 33 treesize of output 21 [2023-11-24 21:55:29,968 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:55:29,973 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 24 treesize of output 12 [2023-11-24 21:55:30,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-24 21:55:30,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:55:30,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1381980297] [2023-11-24 21:55:30,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1381980297] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:55:30,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 21:55:30,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-11-24 21:55:30,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131362332] [2023-11-24 21:55:30,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 21:55:30,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-24 21:55:30,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:55:30,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-24 21:55:30,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=69, Unknown=2, NotChecked=34, Total=132 [2023-11-24 21:55:30,100 INFO L87 Difference]: Start difference. First operand 171 states and 192 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 12 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:55:32,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:55:32,670 INFO L93 Difference]: Finished difference Result 177 states and 198 transitions. [2023-11-24 21:55:32,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:55:32,672 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 12 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-24 21:55:32,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:55:32,673 INFO L225 Difference]: With dead ends: 177 [2023-11-24 21:55:32,673 INFO L226 Difference]: Without dead ends: 177 [2023-11-24 21:55:32,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=99, Unknown=2, NotChecked=42, Total=182 [2023-11-24 21:55:32,675 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-24 21:55:32,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 572 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 405 Invalid, 0 Unknown, 157 Unchecked, 2.3s Time] [2023-11-24 21:55:32,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-11-24 21:55:32,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2023-11-24 21:55:32,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 122 states have (on average 1.5901639344262295) internal successors, (194), 172 states have internal predecessors, (194), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-24 21:55:32,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 198 transitions. [2023-11-24 21:55:32,686 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 198 transitions. Word has length 17 [2023-11-24 21:55:32,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:55:32,687 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 198 transitions. [2023-11-24 21:55:32,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 12 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:55:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 198 transitions. [2023-11-24 21:55:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-24 21:55:32,688 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:55:32,688 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:55:32,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-11-24 21:55:32,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:32,892 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-24 21:55:32,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:32,892 INFO L85 PathProgramCache]: Analyzing trace with hash -350360893, now seen corresponding path program 2 times [2023-11-24 21:55:32,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:55:32,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747204830] [2023-11-24 21:55:32,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 21:55:32,893 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-24 21:55:32,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:55:32,894 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:32,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:33,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 21:55:33,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 21:55:33,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-24 21:55:33,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:55:33,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-24 21:55:33,171 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 11 treesize of output 5 [2023-11-24 21:55:33,216 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-24 21:55:33,234 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-24 21:55:33,409 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-24 21:55:33,410 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-24 21:55:33,424 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-24 21:55:33,606 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-24 21:55:33,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-24 21:55:33,620 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-24 21:55:33,717 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-24 21:55:33,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-24 21:55:33,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:55:33,773 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:55:34,062 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem9.base| v_ArrVal_269) c_create_data_~data~0.base) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem9.base| v_ArrVal_270) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_269 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem9.base| v_ArrVal_269) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd (_ bv8 32) .cse2 .cse1)))))) is different from false [2023-11-24 21:55:34,125 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_269 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_269) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_269) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse2 v_ArrVal_270) c_create_data_~data~0.base) .cse3))))))) is different from false [2023-11-24 21:55:34,398 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem9.base| v_ArrVal_267))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem9.base| v_ArrVal_268) .cse0 v_ArrVal_269) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_270) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_269 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem9.base| v_ArrVal_268) (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem9.base| v_ArrVal_267) c_create_data_~data~0.base) .cse1) v_ArrVal_269) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) .cse4 .cse2) (bvadd .cse4 .cse2 (_ bv12 32))))))) is different from false [2023-11-24 21:55:34,666 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_269 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_268) (select (select (store |c_#memory_$Pointer$#2.base| .cse2 v_ArrVal_267) c_create_data_~data~0.base) .cse3) v_ArrVal_269) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse2 v_ArrVal_267))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_268) .cse4 v_ArrVal_269) c_create_data_~data~0.base) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_270) c_create_data_~data~0.base) .cse3))))))))) is different from false [2023-11-24 21:55:34,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:55:34,739 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2023-11-24 21:55:34,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:55:34,755 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2023-11-24 21:55:34,763 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 102 treesize of output 84 [2023-11-24 21:55:34,770 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 174 treesize of output 144 [2023-11-24 21:55:34,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2023-11-24 21:55:34,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-24 21:55:34,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-24 21:55:34,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:55:34,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2023-11-24 21:55:34,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:55:34,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2023-11-24 21:55:34,899 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:55:34,905 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 92 treesize of output 56 [2023-11-24 21:55:34,911 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:55:34,916 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 24 treesize of output 12 [2023-11-24 21:55:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-11-24 21:55:35,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:55:35,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747204830] [2023-11-24 21:55:35,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747204830] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:55:35,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 21:55:35,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-11-24 21:55:35,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428386261] [2023-11-24 21:55:35,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 21:55:35,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-24 21:55:35,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:55:35,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-24 21:55:35,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=106, Unknown=4, NotChecked=92, Total=240 [2023-11-24 21:55:35,031 INFO L87 Difference]: Start difference. First operand 177 states and 198 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:55:37,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:55:37,919 INFO L93 Difference]: Finished difference Result 183 states and 204 transitions. [2023-11-24 21:55:37,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 21:55:37,921 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-24 21:55:37,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:55:37,922 INFO L225 Difference]: With dead ends: 183 [2023-11-24 21:55:37,923 INFO L226 Difference]: Without dead ends: 183 [2023-11-24 21:55:37,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=56, Invalid=166, Unknown=4, NotChecked=116, Total=342 [2023-11-24 21:55:37,924 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 2 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 326 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-24 21:55:37,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 702 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 430 Invalid, 0 Unknown, 326 Unchecked, 2.5s Time] [2023-11-24 21:55:37,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-11-24 21:55:37,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2023-11-24 21:55:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 128 states have (on average 1.5625) internal successors, (200), 178 states have internal predecessors, (200), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-24 21:55:37,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 204 transitions. [2023-11-24 21:55:37,930 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 204 transitions. Word has length 20 [2023-11-24 21:55:37,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:55:37,931 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 204 transitions. [2023-11-24 21:55:37,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:55:37,931 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 204 transitions. [2023-11-24 21:55:37,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-24 21:55:37,932 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:55:37,932 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:55:37,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:38,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:38,137 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-24 21:55:38,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:38,138 INFO L85 PathProgramCache]: Analyzing trace with hash -823318778, now seen corresponding path program 3 times [2023-11-24 21:55:38,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:55:38,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096640558] [2023-11-24 21:55:38,139 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-24 21:55:38,139 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-24 21:55:38,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:55:38,140 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:38,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:38,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-24 21:55:38,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 21:55:38,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-24 21:55:38,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:55:38,659 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 11 treesize of output 5 [2023-11-24 21:55:38,676 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-24 21:55:38,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-24 21:55:38,728 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-24 21:55:38,736 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-24 21:55:38,919 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-24 21:55:38,920 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-24 21:55:38,933 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-24 21:55:39,136 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-24 21:55:39,137 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-24 21:55:39,151 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-24 21:55:39,358 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-24 21:55:39,359 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-24 21:55:39,373 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-24 21:55:39,481 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-24 21:55:39,494 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-24 21:55:39,554 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:55:39,554 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:55:39,891 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem9.base| v_ArrVal_347) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem9.base| v_ArrVal_347) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem9.base| v_ArrVal_346) c_create_data_~data~0.base) .cse2)))))) is different from false [2023-11-24 21:55:39,951 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_347) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_346) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_347) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) (bvadd (_ bv8 32) .cse3 .cse2))))))) is different from false [2023-11-24 21:55:40,312 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_344 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem9.base| v_ArrVal_344))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse0 (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem9.base| v_ArrVal_345) .cse1 v_ArrVal_347) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_346) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_344 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem9.base| v_ArrVal_345) (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem9.base| v_ArrVal_344) c_create_data_~data~0.base) .cse2) v_ArrVal_347) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse0 .cse4) (bvadd .cse0 (_ bv12 32) .cse4)))))) is different from false [2023-11-24 21:55:40,776 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_344 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_345) (select (select (store |c_#memory_$Pointer$#2.base| .cse2 v_ArrVal_344) c_create_data_~data~0.base) .cse3) v_ArrVal_347) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_344 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse2 v_ArrVal_344))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_345) .cse4 v_ArrVal_347) c_create_data_~data~0.base) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_346) c_create_data_~data~0.base) .cse3))))))))) is different from false [2023-11-24 21:55:41,061 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_344 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem9.base| v_ArrVal_343))) (let ((.cse0 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (let ((.cse4 (store .cse5 .cse0 v_ArrVal_344))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem9.base| v_ArrVal_342) .cse0 v_ArrVal_345) .cse1 v_ArrVal_347) c_create_data_~data~0.base) .cse2) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_346) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_344 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem9.base| v_ArrVal_343))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem9.base| v_ArrVal_342) .cse7 v_ArrVal_345) (select (select (store .cse8 .cse7 v_ArrVal_344) c_create_data_~data~0.base) .cse2) v_ArrVal_347))) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse6 .cse3 (_ bv12 32)) (bvadd (_ bv16 32) .cse6 .cse3)))))) is different from false [2023-11-24 21:55:41,623 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_344 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse2 v_ArrVal_343))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_342) .cse3 v_ArrVal_345) (select (select (store .cse4 .cse3 v_ArrVal_344) c_create_data_~data~0.base) .cse5) v_ArrVal_347))) c_create_data_~data~0.base) .cse5))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_344 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| .cse2 v_ArrVal_343))) (let ((.cse6 (select (select .cse9 c_create_data_~data~0.base) .cse5))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_344))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_342) .cse6 v_ArrVal_345) .cse7 v_ArrVal_347) c_create_data_~data~0.base) .cse5) .cse1) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_346) c_create_data_~data~0.base) .cse5))))))))))) is different from false [2023-11-24 21:55:41,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:55:41,726 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 178 [2023-11-24 21:55:41,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:55:41,745 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 108 [2023-11-24 21:55:41,757 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 4828 treesize of output 4078 [2023-11-24 21:55:41,809 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 3906 treesize of output 3792 [2023-11-24 21:55:41,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2023-11-24 21:55:41,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2023-11-24 21:55:41,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2023-11-24 21:55:41,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2023-11-24 21:55:41,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2023-11-24 21:55:41,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-11-24 21:55:42,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:55:42,088 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 168 [2023-11-24 21:55:42,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:55:42,109 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 108 [2023-11-24 21:55:42,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 588 treesize of output 498 [2023-11-24 21:55:42,147 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 1230 treesize of output 1140 [2023-11-24 21:55:42,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2023-11-24 21:55:42,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2023-11-24 21:55:42,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2023-11-24 21:55:42,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2023-11-24 21:55:42,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-24 21:55:42,362 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2023-11-24 21:55:42,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:55:42,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096640558] [2023-11-24 21:55:42,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096640558] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:55:42,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 21:55:42,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-11-24 21:55:42,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974036402] [2023-11-24 21:55:42,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 21:55:42,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-24 21:55:42,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:55:42,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-24 21:55:42,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=151, Unknown=6, NotChecked=174, Total=380 [2023-11-24 21:55:42,365 INFO L87 Difference]: Start difference. First operand 183 states and 204 transitions. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:55:45,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:55:45,322 INFO L93 Difference]: Finished difference Result 189 states and 210 transitions. [2023-11-24 21:55:45,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 21:55:45,324 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-24 21:55:45,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:55:45,326 INFO L225 Difference]: With dead ends: 189 [2023-11-24 21:55:45,326 INFO L226 Difference]: Without dead ends: 189 [2023-11-24 21:55:45,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=73, Invalid=251, Unknown=6, NotChecked=222, Total=552 [2023-11-24 21:55:45,330 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 2 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 507 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-24 21:55:45,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 767 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 408 Invalid, 0 Unknown, 507 Unchecked, 2.4s Time] [2023-11-24 21:55:45,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-11-24 21:55:45,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2023-11-24 21:55:45,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 134 states have (on average 1.537313432835821) internal successors, (206), 184 states have internal predecessors, (206), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-24 21:55:45,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 210 transitions. [2023-11-24 21:55:45,339 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 210 transitions. Word has length 23 [2023-11-24 21:55:45,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:55:45,340 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 210 transitions. [2023-11-24 21:55:45,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:55:45,340 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 210 transitions. [2023-11-24 21:55:45,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-24 21:55:45,346 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:55:45,346 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:55:45,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-11-24 21:55:45,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:45,553 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-24 21:55:45,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:55:45,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1076027363, now seen corresponding path program 4 times [2023-11-24 21:55:45,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:55:45,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606137556] [2023-11-24 21:55:45,554 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-24 21:55:45,554 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-24 21:55:45,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:55:45,556 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:45,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61552760-fe5c-448f-a7a4-32d1d2042492/bin/uautomizer-verify-NlZe1sFDwI/mathsat -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-24 21:55:45,979 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-24 21:55:45,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 21:55:45,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-24 21:55:45,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:55:46,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-24 21:55:46,021 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 11 treesize of output 5 [2023-11-24 21:55:46,066 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-24 21:55:46,079 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-24 21:55:46,291 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-24 21:55:46,291 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-24 21:55:46,309 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-24 21:55:46,527 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-24 21:55:46,527 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-24 21:55:46,543 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-24 21:55:46,781 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-24 21:55:46,782 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-24 21:55:46,797 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-24 21:55:47,069 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-24 21:55:47,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-24 21:55:47,084 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-24 21:55:47,200 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-24 21:55:47,212 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-24 21:55:47,278 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:55:47,278 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:55:47,644 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_441 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem9.base| v_ArrVal_440) c_create_data_~data~0.base) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem9.base| v_ArrVal_441) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_440 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem9.base| v_ArrVal_440) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd (_ bv8 32) .cse2 .cse1)))))) is different from false [2023-11-24 21:55:47,696 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_440 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_440) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_441 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_440) c_create_data_~data~0.base) .cse3) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse2 v_ArrVal_441) c_create_data_~data~0.base) .cse3))))))) is different from false [2023-11-24 21:55:47,786 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_438 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem9.base| v_ArrVal_438))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem9.base| v_ArrVal_439) .cse0 v_ArrVal_440) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_441) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_438 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem9.base| v_ArrVal_439) (select (select (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem9.base| v_ArrVal_438) c_create_data_~data~0.base) .cse1) v_ArrVal_440) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) .cse4 .cse2) (bvadd .cse4 .cse2 (_ bv12 32))))))) is different from false [2023-11-24 21:55:47,854 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_438 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_439) (select (select (store |c_#memory_$Pointer$#2.base| .cse2 v_ArrVal_438) c_create_data_~data~0.base) .cse3) v_ArrVal_440) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_438 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse2 v_ArrVal_438))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_439) .cse4 v_ArrVal_440) c_create_data_~data~0.base) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_441) c_create_data_~data~0.base) .cse3))))))))) is different from false [2023-11-24 21:55:47,996 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_436 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_437 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_438 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem9.base| v_ArrVal_436))) (let ((.cse0 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (let ((.cse4 (store .cse5 .cse0 v_ArrVal_438))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem9.base| v_ArrVal_437) .cse0 v_ArrVal_439) .cse1 v_ArrVal_440) c_create_data_~data~0.base) .cse2) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_441) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_436 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_437 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_438 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_create_data_#t~mem9.base| v_ArrVal_436))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_create_data_#t~mem9.base| v_ArrVal_437) .cse7 v_ArrVal_439) (select (select (store .cse8 .cse7 v_ArrVal_438) c_create_data_~data~0.base) .cse2) v_ArrVal_440))) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse6 .cse3 (_ bv12 32)) (bvadd (_ bv16 32) .cse6 .cse3)))))) is different from false [2023-11-24 21:55:48,103 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$#2.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_436 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_437 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_438 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse2 v_ArrVal_436))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_437) .cse3 v_ArrVal_439) (select (select (store .cse4 .cse3 v_ArrVal_438) c_create_data_~data~0.base) .cse5) v_ArrVal_440))) c_create_data_~data~0.base) .cse5))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_436 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_437 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_438 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| .cse2 v_ArrVal_436))) (let ((.cse6 (select (select .cse9 c_create_data_~data~0.base) .cse5))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_438))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse2 v_ArrVal_437) .cse6 v_ArrVal_439) .cse7 v_ArrVal_440) c_create_data_~data~0.base) .cse5) .cse1) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_441) c_create_data_~data~0.base) .cse5))))))))))) is different from false